The time complexity of maximum matching by simulated annealing
Journal of the ACM (JACM)
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
SIAM Journal on Discrete Mathematics
Constructing a maximal independent set in parallel
SIAM Journal on Discrete Mathematics
The analysis of local search problems and their heuristics
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Simple local search problems that are hard to solve
SIAM Journal on Computing
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A modified greedy heuristic for the set covering problem with improved worst case bound
Information Processing Letters
Approximation results for the minimum graph coloring problem
Information Processing Letters
New results on the old k-opt algorithm for the TSP
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Parallel and Sequential Approximations of Shortest Superstrings
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Some Further Approximation Algorithms for the Vertex Cover Problem
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
On syntactic versus computational views of approximability
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Greedy local improvement and weighted set packing approximation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Simple approximation algorithm for nonoverlapping local alignments
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A d/2 approximation for maximum weight independent set in d-claw free graphs
Nordic Journal of Computing
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Approximation algorithms for NMR spectral peak assignment
Theoretical Computer Science
Hardness of approximation for non-overlapping local alignments
Discrete Applied Mathematics
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On approximating minimum vertex cover for graphs with perfect matching
Theoretical Computer Science
Assignment of Orthologous Genes via Genome Rearrangement
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Target tracking with distributed sensors: the focus of attention problem
Computer Vision and Image Understanding - Special issue: Attention and performance in computer vision
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
Theoretical Computer Science
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
Discrete Applied Mathematics
A better differential approximation ratio for symmetric TSP
Theoretical Computer Science
Efficient sensor network design for continuous monitoring of moving objects
Theoretical Computer Science
Discrete Applied Mathematics
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
New differential approximation algorithm for k-customer vehicle routing problem
Information Processing Letters
Target tracking with distributed sensors: The focus of attention problem
Computer Vision and Image Understanding - Special issue: Attention and performance in computer vision
An approximation algorithm for maximum triangle packing
Discrete Applied Mathematics
A modified greedy algorithm for dispersively weighted 3-set cover
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Scheduling intervals using independent sets in claw-free graphs
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
Linear time local improvements for weighted matchings in graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Efficient sensor network design for continuous monitoring of moving objects
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On the complexity of local search for weighted standard set problems
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
On sorting permutations by double-cut-and-joins
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Uniform unweighted set cover: The power of non-oblivious local search
Theoretical Computer Science
Information Processing Letters
Parameterized algorithms for the independent set problem in some hereditary graph classes
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Tractability and approximability of maximal strip recovery
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
A better-than-greedy algorithm for k-set multicover
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Poly-APX- and PTAS-Completeness in standard and differential approximation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Vertex cover approximations: experiments and observations
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Covering analysis of the greedy algorithm for partial cover
Algorithms and Applications
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Independence and coloring problems on intersection graphs of disks
Efficient Approximation and Online Algorithms
Tractability and approximability of maximal strip recovery
Theoretical Computer Science
Analysis of approximation algorithms for k-set cover using factor-revealing linear programs
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A 6/5-approximation algorithm for the maximum 3-cover problem
Journal of Combinatorial Optimization
Large neighborhood local search for the maximum set packing problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.01 |