The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors

Parameterized complexity studies a generalization of the notion of polynomial time where, in addition to the overall input size n, one also considers the effects on computational complexity of a secondary measurement, the parameter. The central notion of the field is fixed-parameter tractability (FPT), which refers to solvability in time f(k)n, where f is some function (usually exponential) of the parameter k, and c is a constant. The subject unfolds in two basic complementary projects and associated mathematical toolkits: (1) How to design (and improve) FPT algorithms, for parameterized problems that admit them and (2) How to gather evidence that a parameterized problem probably does not admit an FPT algorithm. There are several things that one can say about the field, in a general way.

[1]  Karsten Weihe.  On the Differences between "Practical" and "Applied" , 2000, Algorithm Engineering.

[2]  Hans L. Bodlaender,et al.  A Cubic Kernel for Feedback Vertex Set and Loop Cutset , 2010, Theory of Computing Systems.

[3]  Michael R. Fellows,et al.  Parameterized Approximation Problems , 2006, IWPEC.

[4]  Samir Khuller,et al.  On local search and placement of meters in networks , 2000, SODA '00.

[5]  Lance Fortnow,et al.  Infeasibility of instance compression and succinct PCPs for NP , 2007, J. Comput. Syst. Sci..

[6]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

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

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

[9]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[10]  Dorit S. Hochbaum,et al.  Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[11]  Sanjeev Arora,et al.  Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.

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

[13]  Martin Grohe,et al.  Parameterized Approximability of the Disjoint Cycle Problem , 2007, ICALP.

[14]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[15]  Dániel Marx,et al.  Parameterized Complexity of Independence and Domination on Geometric Graphs , 2006, IWPEC.

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

[17]  Dániel Marx,et al.  Searching the k-change neighborhood for TSP is W[1]-hard , 2008, Oper. Res. Lett..

[18]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[20]  Gerhard J. Woeginger,et al.  Exact Algorithms for NP-Hard Problems: A Survey , 2001, Combinatorial Optimization.

[21]  Dániel Marx,et al.  The closest substring problem with small distances , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[22]  Liming Cai,et al.  On the existence of subexponential parameterized algorithms , 2003, J. Comput. Syst. Sci..