Get started
Keyword

parameterized complexity

Description: A branch of computational complexity theory that studies how problem-solving time depends on input size and a separately specified parameter.
Wikidata ID: wiki/Q1570441
OpenAlex ID: keywords/parameterized-complexity
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 Complexity Theory
2006 · Flum, Jörg, Grohe, Martin · Springer eBooks · 1,913
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
Fixed-parameter tractability and completeness II: On completeness for W[1]
1995 · Rod G. Downey, Michael R. Fellows · Theoretical Computer Science · 576
PDF
On problems without polynomial kernels
2009 · Hans L. Bodlaender, Rodney G. Downey, et al. · Journal of Computer and System Sciences · 567
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
The complexity of homomorphism and constraint satisfaction problems seen from the other side
2007 · Martin Grohe · Journal of the ACM · 424
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
On the parameterized complexity of multiple-interval graph problems
2008 · Michael R. Fellows, Danny Hermelin, et al. · Theoretical Computer Science · 324
Invitation to fixed-parameter algorithms
2007 · Dimitrios M. Thilikos · Computer Science Review · 320
Parameterizing above Guaranteed Values: MaxSat and MaxCut
1999 · Meena Mahajan, Venkatesh Raman · Journal of Algorithms · 303
A fixed-parameter algorithm for the directed feedback vertex set problem
2008 · Jianer Chen, Yang Liu, et al. · Journal of the ACM · 294
Parameterized Complexity and Approximation Algorithms
2007 · D. Marx · The Computer Journal · 283
Parameterized graph separation problems
2005 · Dániel Marx · Theoretical Computer Science · 278
Containment and equivalence for an XPath fragment
2002 · Gerome Miklau, Dan Suciu · ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS) · 264
Strong computational lower bounds via parameterized complexity
2006 · Jianer Chen, Xiuzhen Huang, et al. · Journal of Computer and System Sciences · 255
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
2011 · Marek Cygan, Jesper Nederlof, et al. · Annual Symposium on Foundations of Computer Science · 252
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
2009 · P. Faliszewski, E. Hemaspaandra, et al. · Journal of Artificial Intelligence Research · 242
PDF
Kernel bounds for disjoint cycles and disjoint paths
2011 · Hans L. Bodlaender, Stéphan Thomassé, et al. · Theoretical Computer Science · 239
PDF
NP-completeness of some generalizations of the maximum matching problem
1982 · Larry J. Stockmeyer, Vijay V. Vazirani · Information Processing Letters · 229
Kernelization Lower Bounds by Cross-Composition
2014 · Hans L. Bodlaender, Bart M. P. Jansen, et al. · SIAM Journal on Discrete Mathematics · 228
Works count: 6,498
Citation count: 69,460
Year
Topic
Type