SIAM Journal on Computing
The Complexity of Decision Versus Search
SIAM Journal on Computing
On the structure of parameterized problems in NP
Information and Computation
On fixed-parameter tractability and approximability of NP optimization problems
Journal of Computer and System Sciences - special issue on complexity theory
Circuit Bottom Fan-in and Computational Power
SIAM Journal on Computing
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
Faster exact algorithms for hard problems: a parameterized point of view
Discrete Mathematics
Vertex cover: further observations and further improvements
Journal of Algorithms
Introduction to Algorithms
Which Problems Have Strongly Exponential Complexity?
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Journal of Computer and System Sciences
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Parameterized algorithms for feedback set problems and their duals in tournaments
Theoretical Computer Science - Parameterized and exact computation
Genus characterizes the complexity of certain graph problems: Some tight results
Journal of Computer and System Sciences
Parameterized Algorithms for Generalized Domination
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
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
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Genus characterizes the complexity of graph problems: some tight results
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Improved upper bounds for vertex cover
Theoretical Computer Science
Fast sub-exponential algorithms and compactness in planar graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved parameterized upper bounds for vertex cover
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Parameterized complexity of generalized vertex cover problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Fixed-parameter approximation: conceptual framework and approximability results
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized problems on coincidence graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Generalized above guarantee vertex cover and r-partization
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Operations Research Letters
Survey: Subexponential parameterized algorithms
Computer Science Review
Vertex cover, dominating set and my encounters with parameterized complexity and mike fellows
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Max-cut parameterized above the edwards-erdős bound
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Faster parameterized algorithms for deletion to split graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Subexponential parameterized algorithms
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
European Journal of Combinatorics
Bisections above tight lower bounds
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
| Hi-index | 0.00 |
The existence of subexponential-time parameterized algorithms is examined for various parameterized problems solvable in time O(2o(k)p(n)). It is shown that for each t ≥ 1, there are parameterized problems in FPT for which the existence of O(2o(k)p(n))-time parameterized algorithms implies the collapse of W[t] to FPT. Evidence is demonstrated that Max-SNP-hard optimization problems do not admit subexponential-time parameterized algorithms. In particular, it is shown that each Max-SNP-complete problem is solvable in time O(2o(k)p(n)) if and only if 3-SAT ∈ DTIME(2o(n)). These results are also applied to show evidence for the non-existence of O(2o(√k)p(n))-time parameterized algorithms for a number of other important problems such as Dominating Set, Vertex Cover, and Independent Set on planar graph instances.