Concepedia

Subexponential parameterized algorithms

Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos

Computer Science Review · 2008 · 87 citations · 37 references

DOI

References

37

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

, , +12

Which Problems Have Strongly Exponential Complexity?

Russell Impagliazzo, Ramamohan Paturi, Francis Zane · Journal of Computer and System Sciences · 2001 · 1.4K citations

, , +16

Graph Minors .XIII. The Disjoint Paths Problem

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1995 · 1.3K citations

, , +8

Graph minors. X. Obstructions to tree-decomposition

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1991 · 670 citations

, , +11

Linear time algorithms for NP-hard problems restricted to partial k-trees

Stefan Arnborg, Andrzej Proskurowski · Discrete Applied Mathematics · 1989 · 579 citations

, , +8