Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
(2+ f(n))-SAT and Its Properties
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On the complexity of finding balanced oneway cuts
Information Processing Letters
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
(2 +f(n))-SAT and its properties
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Journal of Computer and System Sciences
Subexponential-time algorithms for maximum independent set and related problems on box graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
Hypercontractivity, sum-of-squares proofs, and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |