Get started
Keyword

fixed-parameter tractability

Description: Fixed-parameter tractability is a property of computational problems solvable in time bounded by a function of a parameter times a polynomial in input size.
OpenAlex ID: keywords/fixed-parameter-tractability
Parameterized Complexity
2002 · Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2,837
PDF
Parameterized Complexity
1999 · R. G. Downey, M. R. Fellows · Texts and monographs in computer science · 2,565
Parameterized Algorithms
2015 · Marek Cygan, Fedor V. Fomin, et al. · Springer eBooks · 2,042
Parameterized Complexity Theory
2006 · Flum, Jörg, Grohe, Martin · Springer eBooks · 1,913
Invitation to Fixed-Parameter Algorithms
2006 · Rolf Niedermeier · 1,696
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
1996 · Hans L. Bodlaender · SIAM Journal on Computing · 1,544
Graph minors. II. Algorithmic aspects of tree-width
1986 · Neil Robertson, P.D Seymour · Journal of Algorithms · 1,542
Fundamentals of Parameterized Complexity
2013 · Rodney G. Downey, Michael R. Fellows · Texts in computer science · 1,419
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
2006 · J. Flum, Martin Grohe · 1,114
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
2000 · B. Courcelle, J. A. Makowsky, et al. · Theory of Computing Systems · 776
The Complexity of Multiterminal Cuts
1994 · E. Dahlhaus, D. S. Johnson, et al. · SIAM Journal on Computing · 664
Fixed-parameter tractability and completeness II: On completeness for W[1]
1995 · Rod G. Downey, Michael R. Fellows · Theoretical Computer Science · 576
PDF
Settling the Complexity of Two-Player Nash Equilibrium
2006 · Xi Chen, Xiaotie Deng · Annual Symposium on Foundations of Computer Science · 493
Approximating clique-width and branch-width
2006 · Sang-il Oum, Paul Seymour · Journal of Combinatorial Theory Series B · 482
PDF
Exact Exponential Algorithms
2010 · Fedor V. Fomin, Dieter Kratsch · Texts in theoretical computer science · 475
Fixed-Parameter Tractability and Completeness I: Basic Results
1995 · Rod G. Downey, Michael R. Fellows · SIAM Journal on Computing · 468
W hats H ap : Weighted Haplotype Assembly for Future-Generation Sequencing Reads
2015 · Murray Patterson, Tobias Marschall, et al. · Journal of Computational Biology · 452
PDF
Finding odd cycle transversals
2004 · Bruce Reed, Kaleigh Smith, et al. · Operations Research Letters · 434
Vertex Cover: Further Observations and Further Improvements
2001 · Jianer Chen, Iyad A. Kanj, et al. · Journal of Algorithms · 413
The Complexity of Coloring Circular Arcs and Chords
1980 · M. R. Garey, D. S. Johnson, et al. · SIAM Journal on Algebraic and Discrete Methods · 391
Improved upper bounds for vertex cover
2010 · Jianer Chen, Iyad A. Kanj, et al. · Theoretical Computer Science · 383
PDF
Invitation to data reduction and problem kernelization
2007 · Jiong Guo, Rolf Niedermeier · ACM SIGACT News · 373
Fixed-parameter tractability of graph modification problems for hereditary properties
1996 · Leizhen Cai · Information Processing Letters · 370
Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees
2012 · Maureen Stolzer, Han Lai, et al. · Bioinformatics · 350
PDF
Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees
2001 · Benjamin L. Allen, Mike Steel · Annals of Combinatorics · 341
Works count: 7,489
Citation count: 96,090
Year
Topic
Type