Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating the maximum diameter ratio of graphs
Discrete Mathematics - Algebraic and topological methods in graph theory
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The Longest Common Subsequence Problem for Arc-Annotated Sequences
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs
Theoretical Computer Science - Mathematical foundations of computer science
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Finding Frequent Patterns in a Large Sparse Graph*
Data Mining and Knowledge Discovery
Independent set of intersection graphs of convex objects in 2D
Computational Geometry: Theory and Applications
On the complexity of approximating k-set packing
Computational Complexity
Communication: A note on the precedence-constrained class sequencing problem
Discrete Applied Mathematics
Reversal and transposition medians
Theoretical Computer Science
Improved approximation results for the stable marriage problem
ACM Transactions on Algorithms (TALG)
A 1.875: approximation algorithm for the stable marriage problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Simultaneous matchings: Hardness and approximation
Journal of Computer and System Sciences
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Priority algorithms for graph optimization problems
Theoretical Computer Science
Independent set of intersection graphs of convex objects in 2D
Computational Geometry: Theory and Applications
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Approximation hardness for small occurrence instances of NP-hard problems
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Approximations of weighted independent set and hereditary subset problems
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Wireless sensor network's lifetime maximization problem in case of given set of covers
ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
Discrete Applied Mathematics
Using fractional primal-dual to schedule split intervals with demands
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A (2 - c1/√N)-approximation algorithm for the stable marriage problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximability of bounded occurrence max ones
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Priority algorithms for graph optimization problems
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
The maximum clique problem in multiple interval graphs (extended abstract)
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
| Hi-index | 0.02 |