The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number

[1]  Stefan Szeider,et al.  Not So Easy Problems for Tree Decomposable Graphs , 2011, ArXiv.

[2]  Michael R. Fellows,et al.  FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .

[3]  Svatopluk Poljak,et al.  On the complexity of the subgraph problem , 1985 .

[4]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[5]  Ge Xia,et al.  Improved Parameterized Upper Bounds for Vertex Cover , 2006, MFCS.

[6]  Erik D. Demaine,et al.  Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs , 2005, JACM.

[7]  Jan Arne Telle,et al.  Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems , 1993, WADS.

[8]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[9]  Yuri Gurevich,et al.  The challenger-Solver Game: variations on the Theme of P=NP , 2017, Current Trends in Theoretical Computer Science.

[10]  Stefan Szeider,et al.  Monadic second order logic on graphs with local cardinality constraints , 2008, TOCL.

[11]  Hans L. Bodlaender,et al.  A Cubic Kernel for Feedback Vertex Set , 2007, STACS.

[12]  Rolf Niedermeier,et al.  Improved Fixed-Parameter Algorithms for Two Feedback Set Problems , 2005, WADS.

[13]  Michael T. Hallett,et al.  The Parameterized Complexity of Some Problems in Logic and Linguistics , 1994, LFCS.

[14]  Rolf Niedermeier,et al.  Improved Tree Decomposition Based Algorithms for Domination-like Problems , 2002, LATIN.

[15]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[16]  Martin Grohe,et al.  Definability and Descriptive Complexity on Databases of Bounded Tree-Width , 1999, ICDT.

[17]  Michael R. Fellows,et al.  An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations , 1989, 30th Annual Symposium on Foundations of Computer Science.

[18]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[19]  P. Seymour,et al.  Surveys in combinatorics 1985: Graph minors – a survey , 1985 .

[20]  Rolf Niedermeier,et al.  Polynomial-time data reduction for dominating set , 2002, JACM.

[21]  Ge Xia,et al.  Simplicity is Beauty: Improved Upper Bounds for Vertex Cover , 2005 .

[22]  Yonatan Aumann,et al.  Fixed Structure Complexity , 2008, IWPEC.

[23]  D. Karpov.  Spanning trees with many leaves , 2011 .

[24]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[25]  Erik D. Demaine,et al.  Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs , 2004, SODA '04.

[26]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[27]  Michael R. Fellows,et al.  FPT is P-Time Extremal Structure I (Fixed-parameter tractability is polynomial-time extremal structure theory) , 2005 .

[28]  Michael R. Fellows,et al.  Graph Layout Problems Parameterized by Vertex Cover , 2008, ISAAC.

[29]  Erik D. Demaine,et al.  The Bidimensionality Theory and Its Algorithmic Applications , 2008, Comput. J..

[30]  Paul D. Seymour,et al.  Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.

[31]  M. Fellows,et al.  Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy , 1994, Symposium on the Theory of Computing.

[32]  Michael R. Fellows,et al.  FPT is P-Time Extremal Structure I , 2005, ACiD.

[33]  Christian Sloper,et al.  Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree , 2003, WADS.

[34]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[35]  Gerhard J. Woeginger,et al.  Exact (Exponential) Algorithms for the Dominating Set Problem , 2004, WG.

[36]  Erik D. Demaine,et al.  Bidimensionality: new connections between FPT algorithms and PTASs , 2005, SODA '05.

[37]  Liming Cai,et al.  On the parameterized complexity of short computation and factorization , 1997, Arch. Math. Log..

[38]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[39]  Michael R. Fellows,et al.  The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel , 2006, IWPEC.

[40]  Michael R. Fellows,et al.  Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT , 2003, WG.

[41]  Harry G. Mairson,et al.  The complexity of type inference for higher-order lambda calculi , 1991, POPL '91.

[42]  Jerzy Tiuryn,et al.  An analysis of ML typability , 1994, JACM.

[43]  Rolf Niedermeier,et al.  Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms , 2004, MFCS.

[44]  Michael R. Fellows,et al.  Parameterized Complexity: The Main Ideas and Connections to Practical Computing , 2000, Experimental Algorithmics.

[45]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[46]  Robin Thomas,et al.  Quickly excluding a forest , 1991, J. Comb. Theory, Ser. B.

[47]  Michael R. Fellows,et al.  Beyond NP-completeness for problems of bounded width (extended abstract): hardness for the W hierarchy , 1994, STOC '94.

[48]  Michael R. Fellows,et al.  Fixed-Parameter Tractability is Polynomial-Time Extremal Structure Theory I: The Case of Max Leaf , 2005 .

[49]  R. Battiti,et al.  Covering Trains by Stations or the Power of Data Reduction , 1998 .

[50]  Ronald L. Graham.  Contemporary trends in discrete mathematics : from DIMACS and DIMATIA to the future : DIMATIA-DIMACS conference, May 19-25, 1997, Štiřín Castle, Czech Republic , 1999 .

[51]  Elena Prieto Rodríguez,et al.  SYSTEMATIC KERNELIZATION IN FPT ALGORITHM DESIGN , 2005 .

[52]  Jörg Flum,et al.  Query evaluation via tree-decompositions , 2001, JACM.

[53]  Martin Grohe,et al.  The parameterized complexity of database queries , 2001, PODS '01.

[54]  Ge Xia,et al.  Tight lower bounds for certain parameterized NP-hard problems , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[55]  Michael R. Fellows,et al.  Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps , 2004, WG.

[56]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[57]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[58]  Frances A. Rosamond,et al.  The Undirected Feedback Vertex Set Problem has Polynomial Kernel Size , 2006 .

[59]  Joseph G. Peters,et al.  Regularity and Locality in K-terminal Graphs , 1994, Discret. Appl. Math..

[60]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[61]  Michael R. Fellows,et al.  Parameterized complexity: A framework for systematically confronting computational intractability , 1997, Contemporary Trends in Discrete Mathematics.

[62]  Michael R. Fellows,et al.  On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.

[63]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[64]  Michael R. Fellows,et al.  On the Complexity of Some Colorful Problems Parameterized by Treewidth , 2007, COCOA.

[65]  Harry G. Mairson,et al.  The Complexity of Type Inference for Higher-Order Typed lambda Calculi , 1994, J. Funct. Program..

[66]  Michael R. Fellows,et al.  Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems , 2003, CATS.

[67]  Arie M. C. A. Koster,et al.  Combinatorial Optimization on Graphs of Bounded Treewidth , 2008, Comput. J..

[68]  Rodney G. Downey,et al.  Parameterized complexity for the skeptic , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[69]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..