Kernels: Annotated, Proper and Induced

The notion of a problem kernel plays a central role in the design of fixed-parameter algorithms. The FPT literature is rich in kernelization algorithms that exhibit fundamentally different approaches. We highlight these differences and discuss several generalizations and restrictions of the standard notion.

[1]  Rolf Niedermeier,et al.  A General Data Reduction Scheme for Domination in Graphs , 2006, SOFSEM.

[2]  Henning Fernau,et al.  NONBLOCKER: Parameterized Algorithmics for minimum dominating set , 2006, SOFSEM.

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

[4]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

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

[6]  Stefan Szeider,et al.  The Linear Arrangement Problem Parameterized Above Guaranteed Value , 2007, Theory of Computing Systems.

[7]  Rolf Niedermeier,et al.  On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER , 2000, ISAAC.

[8]  Michael Kaufmann,et al.  Fixed Parameter Algorithms for one-sided crossing minimization Revisited , 2003, Graph Drawing.

[9]  Ge Xia,et al.  Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, STACS.

[10]  Henning Fernau,et al.  2 Contents , 1996 .

[11]  Michael Kaufmann,et al.  Fixed parameter algorithms for one-sided crossing minimization revisited , 2003, J. Discrete Algorithms.

[12]  Henning Fernau.  Parameterized algorithmics for linear arrangement problems , 2008, Discret. Appl. Math..

[13]  Rolf Niedermeier,et al.  An efficient fixed-parameter algorithm for 3-Hitting Set , 2003, J. Discrete Algorithms.

[14]  Rolf Niedermeier,et al.  Fixed-parameter tractability results for feedback set problems in tournaments , 2006, J. Discrete Algorithms.

[15]  Maria J. Serna,et al.  Parameterized Complexity for Graph Layout Problems , 2005, Bull. EATCS.

[16]  Faisal N. Abu-Khzam,et al.  A Direct Algorithm for the Parameterized Face Cover Problem , 2004, IWPEC.

[17]  Henning Fernau.  A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set , 2008, Algorithmica.

[18]  Rolf Niedermeier,et al.  Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems , 2004, Algorithmica.

[19]  Henning Fernau,et al.  Two-Layer Planarization: Improving on Parameterized Algorithmics , 2005, J. Graph Algorithms Appl..