Parameterized Counting Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Parameterized Complexity: The Main Ideas and Some Research Frontiers
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The Closest Substring problem with small distances
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Chordless paths through three vertices
Theoretical Computer Science - Parameterized and exact computation
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
Batch Coloring Flat Graphs and Thin
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Core instances for testing: a case study
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Algorithms and theory of computation handbook
Approximation of minimum weight spanners for sparse graphs
Theoretical Computer Science
SIAM Journal on Discrete Mathematics
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
Efficient approximation schemes for geometric problems?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
W-hardness under linear FPT-reductions: structural properties and further applications
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Lower bounds and parameterized approach for longest common subsequence
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Hardness of discrepancy computation and ε-net verification in high dimension
Journal of Complexity
Parameterized approximation problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Safe approximation and its relation to kernelization
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Approximation algorithms for scheduling and packing problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.89 |