STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Introduction to the theory of complexity
Introduction to the theory of complexity
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Schemes Using L-Reductions
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
An approximation scheme for planar graph TSP
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Lecture notes on approximation algorithms: Volume I
Lecture notes on approximation algorithms: Volume I
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Information and Computation
Embedding k-outerplanar graphs into ℓ1
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Parameterized Complexity: The Main Ideas and Some Research Frontiers
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Fundamenta Informaticae
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Discrete Applied Mathematics
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Quantum Information & Computation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs
Fundamenta Informaticae
When is weighted satisfiability FPT?
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |