FPT suspects and tough customers: open problems of downey and fellows

Authors:
Fedor V. Fomin;Dániel Marx
Affiliations:
Department of Informatics, University of Bergen, Norway;Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Budapest, Hungary
Venue:
The Multivariate Algorithmic Revolution and Beyond
Year:
2012

Citing 39
Cited 0

A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
Finding $k$ Disjoint Paths in a Directed Planar Graph

SIAM Journal on Computing
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Fixed-parameter tractability and completeness II: on completeness for W[1]

Theoretical Computer Science
The parameterized complexity of sequence alignment and consensus

Theoretical Computer Science
Color-coding

Journal of the ACM (JACM)
Fixed-Parameter Tractability and Completeness I: Basic Results

SIAM Journal on Computing
Well quasi ordering finite posets and formal languages

Journal of Combinatorial Theory Series B
Algorithmic complexity in coding theory and the minimum distance problem

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On algorithmic applications of the immersion order

Discrete Mathematics - Special issue on Graph theory
The planar multiterminal cut problem

Discrete Applied Mathematics
An improved algorithm for the jump number problem

Information Processing Letters
Computing crossing numbers in quadratic time

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Deciding first-order properties of locally tree-decomposable structures

Journal of the ACM (JACM)
Which problems have strongly exponential complexity?

Journal of Computer and System Sciences
Fixed-Parameter Complexity and Cryptography

AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Computing crossing numbers in quadratic time

Journal of Computer and System Sciences - STOC 2001
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized graph separation problems

Theoretical Computer Science - Parameterized and exact computation
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

Journal of Computer and System Sciences
Computing crossing number in linear time

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A fixed-parameter algorithm for the directed feedback vertex set problem

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A fixed-parameter algorithm for the directed feedback vertex set problem

Journal of the ACM (JACM)
An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem

Algorithmica
Parameterized Complexity: The Main Ideas and Some Research Frontiers

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A 4k2 kernel for feedback vertex set

ACM Transactions on Algorithms (TALG)
Graph minors XXIII. Nash-Williams' immersion conjecture

Journal of Combinatorial Theory Series B
Finding topological subgraphs is fixed-parameter tractable

Proceedings of the forty-third annual ACM symposium on Theory of computing
On the parameterized complexity of finding short winning strategies in combinatorial games

On the parameterized complexity of finding short winning strategies in combinatorial games
Clustering with local restrictions

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
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
On multiway cut parameterized above lower bounds

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
FPT algorithms for path-transversal and cycle-transversal problems

Discrete Optimization
Solving planar k-terminal cut in O(nc√k) time

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A tight lower bound for planar multiway cut with fixed number of terminals

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an update on the status of open problems from the book "Parameterized Complexity" by Downey and Fellows.