Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
Genus characterizes the complexity of certain graph problems: Some tight results
Journal of Computer and System Sciences
Efficiency in exponential time for domination-type problems
Discrete Applied Mathematics
On parameterized exponential time complexity
Theoretical Computer Science
On Parameterized Exponential Time Complexity
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Polynomial-time solvability of the maximum clique problem
ECC'09 Proceedings of the 3rd international conference on European computing conference
Pathwidth of cubic graphs and exact algorithms
Information Processing Letters
The time complexity of constraint satisfaction
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact algorithms for dominating set
Discrete Applied Mathematics
Maximum independent set in graphs of average degree at most three in O(1.08537n)
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Exact (exponential) algorithms for the dominating set problem
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |