Parameterized Complexity News

Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. We expecially congratulate new graduates, and ask you to help them find postdoc or other positions. The Newsletter is archived at the IWPEC website at (http://www.scs.carleton.ca/~dehne/iwpec) and at Mike Fellows’ website http://www.mrfellows.net. The WIKI is located at http://www.fpt.wikidot.com. Additions are very appreciated as new great work in parameterized complexity is happening too quickly for only one person (me) to post to the WIKI. The next Newsletter will include a report on the excellent Corsica meeting. An article by Michael Lampis, Georgia Kaouri and Valia Mitsou will describe new directions in treewidth, continuing work reported at ISAAC. The Table of FPT and Kernelization Races will return. A new plan is to add a picture to the first page of each newsletter (partly to differentiate them, other than by the date). Please send me a note if you have difficulty receiving the newsletter. I am experimenting with a new mailing program. Many thanks to many people for helping with this newsletter. This Newsletter features an article by Iris van Rooij who develops a theory of cognitive psychology using parameterized complexity. The journal Cognitive Science, 32, 2008 has a 45 page paper by Iris introducing the tractable cognition thesis. She has summarized some of those ideas for us here. We have an exciting article by Saket Saurabh on k-Feedback Arc Set: FAST, and Chromatic Coding, a Report on the Adaptive, Output-Sensitive, Online and Parameterized Algorithms Dagstuhl Seminar by Nadja Betzler and Britta Dorn, and a New Ideas column by Mike Fellows.

[1]  M. Dom.  Recognition , Generation , and Application of Binary Matrices with the Consecutive-Ones Property , 2009 .

[2]  Daniel M. Kane,et al.  The geometry of binary search trees , 2009, SODA.

[3]  Ken-ichi Kawarabayashi,et al.  Additive approximation algorithms for list-coloring minor-closed class of graphs , 2009, SODA.

[4]  Saket Saurabh,et al.  The Budgeted Unique Coverage Problem and Color-Coding , 2009, CSR.

[5]  Andreas Mitschele,et al.  Integrated Risk Management: Risk Aggregation and Allocation Using Intelligent Systems , 2008 .

[6]  Yijia Chen,et al.  Lower Bounds for Kernelizations and Other Preprocessing Procedures , 2009, CiE.

[7]  Barnaby Martin,et al.  Cutting Planes and the Parameter Cutwidth , 2009, CiE.

[8]  Ken-ichi Kawarabayashi,et al.  Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[9]  Rolf Niedermeier,et al.  Parameterized computational complexity of Dodgson and Young elections , 2008, Inf. Comput..

[10]  Dániel Marx.  Tractable Structures for Constraint Satisfaction with Truth Tables , 2009, Theory of Computing Systems.

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

[12]  Magnus Wahlström,et al.  Algorithms, measures and upper bounds for satisfiability and related problems , 2007 .

[13]  Gregory Gutin,et al.  FPT algorithms and kernels for the Directed k-Leaf problem , 2008, J. Comput. Syst. Sci..

[14]  Juraj Hromkovic,et al.  The Parameterized Approximability of TSP with Deadlines , 2007, Theory of Computing Systems.

[15]  William J. Cook,et al.  On integer points in polyhedra , 1992, Comb..

[16]  Ryan Williams,et al.  Finding paths of length k in O*(2k) time , 2008, Inf. Process. Lett..

[17]  Yijia Chen,et al.  On Parameterized Approximability , 2006, IWPEC.

[18]  M. Overmars,et al.  Geometric matching of weighted point sets , 2000 .

[19]  Iris van Rooij,et al.  Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities , 2008, Comput. J..

[20]  Daniel Lokshtanov,et al.  New Methods in Parameterized Algorithms and Complexity , 2009 .

[21]  Jaroslaw Byrka,et al.  New Results on Optimizing Rooted Triplets Consistency , 2008, ISAAC.

[22]  Zoltán Miklós,et al.  Understanding Tractable Decompositions for Constraint Satisfaction , 2008 .

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

[24]  I. Rooij.  Tractable cognition : complexity theory in cognitive psychology , 2003 .

[25]  Pinar Heggernes,et al.  Faster Parameterized Algorithms for Minimum Fill-in , 2010, Algorithmica.

[26]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[27]  Saket Saurabh,et al.  Linear Kernel for Planar Connected Dominating Set , 2009, TAMC.

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

[29]  Dániel Marx,et al.  Parameterized Complexity and Approximation Algorithms , 2008, Comput. J..

[30]  Christian Knauer,et al.  Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance , 2011, Int. J. Comput. Geom. Appl..

[31]  Michael R. Fellows,et al.  Computing Kemeny rankings, parameterized by the average K-T distance , 2008 .

[32]  Marcello Frixione,et al.  Tractable Competence , 2001, Minds and Machines.

[33]  Juraj Hromkovic,et al.  Ambiguity and Communication , 2010, Theory of Computing Systems.

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

[35]  Michael R. Fellows,et al.  Kernelization for Convex Recoloring , 2006, ACiD.

[36]  Morteza Zadimoghaddam,et al.  The Price of Anarchy in Cooperative Network Creation Games , 2009, STACS.

[37]  Michael Lampis,et al.  On the algorithmic effectiveness of digraph decompositions and complexity measures , 2008, Discret. Optim..

[38]  Joachim Kneis,et al.  Algorithmica manuscript No. (will be inserted by the editor) A New Algorithm for Finding Trees with Many Leaves , 2022 .

[39]  Michael R. Fellows,et al.  On complexity of lobbying in multiple referenda , 2006 .

[40]  Rolf Niedermeier,et al.  Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems , 2008, TAMC.

[41]  Jianer Chen,et al.  Improved Algorithms for Weighted and Unweighted Set Splitting Problems , 2007, COCOON.

[42]  Dogan Kesdogan,et al.  Breaking Anonymity by Learning a Unique Minimum Hitting Set , 2009, CSR.

[43]  John K. Tsotsos.  Analyzing vision at the complexity level , 1990, Behavioral and Brain Sciences.

[44]  Sariel Har-Peled,et al.  On coresets for k-means and k-median clustering , 2004, STOC '04.

[45]  Leslie Ann Goldberg,et al.  A Complexity Dichotomy for Partition Functions with Mixed Signs , 2010, SIAM J. Comput..

[46]  Frances A. Rosamond,et al.  Parameterized Complexity of the Clique Partition Problem , 2008, CATS.

[47]  Iris van Rooij,et al.  The Tractable Cognition Thesis , 2008, Cogn. Sci..

[48]  Henning Fernau,et al.  Power Domination in O*(1.7548n) Using Reference Search Trees , 2008, ISAAC.

[49]  Michael R. Fellows,et al.  Parameterized Complexity of Stabbing Rectangles and Squares in the Plane , 2009, WALCOM.

[50]  Moshe Lewenstein,et al.  Optimization problems in multiple-interval graphs , 2007, SODA '07.

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

[52]  Arkadii M. Slinko.  How the size of a coalition affects its chances to influence an election , 2006, Soc. Choice Welf..

[53]  Christian Komusiewicz,et al.  A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing , 2009, AAIM.

[54]  Lin Yang,et al.  Firefighting on Trees: (1-1/e)-Approximation, Fixed Parameter Tractability and a Subexponential Algorithm , 2008, ISAAC.

[55]  Christian Komusiewicz,et al.  On Generating Triangle-Free Graphs , 2009, Electron. Notes Discret. Math..

[56]  Jianer Chen,et al.  Improved algorithms for feedback vertex set problems , 2007, J. Comput. Syst. Sci..

[57]  Petr A. Golovach,et al.  Approximating Acyclicity Parameters of Sparse Hypergraphs , 2008, STACS.

[58]  Saket Saurabh,et al.  König Deletion Sets and Vertex Covers above the Matching Size , 2008, ISAAC.

[59]  Dimitrios M. Thilikos,et al.  Dominating sets in planar graphs: branch-width and exponential speed-up , 2003, SODA '03.

[60]  Ge Xia,et al.  Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size , 2005, SIAM J. Comput..

[61]  Vadim V. Lozin,et al.  Independent Sets of Maximum Weight in Apple-Free Graphs , 2008, SIAM J. Discret. Math..

[62]  Rolf Niedermeier,et al.  Fixed-Parameter Algorithms for Kemeny Scores , 2008, AAIM.

[63]  Iris van Rooij,et al.  Sources of complexity in subset choice , 2005 .

[64]  Rolf Niedermeier,et al.  Techniques for Practical Fixed-Parameter Algorithms , 2007, Comput. J..

[65]  Chan-Su Shin,et al.  Covering a Simple Polygon by Monotone Directions , 2008, ISAAC.

[66]  Osamu Watanabe,et al.  On the Complexity of Kings , 2007, FCT.

[67]  Faisal N. Abu-Khzam.  Kernelization Algorithms for d-Hitting Set Problems , 2007, WADS.

[68]  Sebastian Heinz,et al.  Complexity of integer quasiconvex polynomial optimization , 2005, J. Complex..

[69]  Stefan Kratsch,et al.  Polynomial Kernelizations for MIN F+Π1 and MAX NP , 2009, Algorithmica.

[70]  Yijia Chen,et al.  Lower Bounds for Kernelizations and Other Preprocessing Procedures , 2010, Theory of Computing Systems.

[71]  Andreas Björklund,et al.  Fourier meets möbius: fast subset convolution , 2006, STOC '07.

[72]  Michael A. Langston,et al.  Innovative Computational Methods for Transcriptomic Data Analysis: A Case Study in the Use of FPT for Practical Algorithm Design and Implementation , 2008, Comput. J..

[73]  Jan Arne Telle,et al.  An Overview of Techniques for Designing Parameterized Algorithms , 2008, Comput. J..

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

[75]  Dániel Marx,et al.  Approximating fractional hypertree width , 2009, TALG.

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

[77]  Falk Hüffner,et al.  Parametrisierte Ansätze für schwere Graphprobleme: Algorithmen und ExperimenteAlgorithms and Experiments for Parameterized Approaches to Hard Graph Problems , 2009, it Inf. Technol..

[78]  Jesper Nederlof.  Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems , 2009, ICALP.

[79]  Jianer Chen,et al.  Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms , 2006, IWPEC.

[80]  Patricia A. Evans,et al.  Identifying Sources of Intractability in Cognitive Models: An Illustration Using Analogical Structure Mapping , 2008 .

[81]  Armando Tacchella,et al.  Theory and Applications of Satisfiability Testing , 2003, Lecture Notes in Computer Science.

[82]  Christian Komusiewicz,et al.  Deconstructing Intractability: A Case Study for Interval Constrained Coloring , 2009, CPM.

[83]  Arkadii Slinko,et al.  Additive Representability of Finite Measurement Structures , 2009, The Mathematics of Preference, Choice and Order.

[84]  Jiong Guo,et al.  A More Effective Linear Kernelization for Cluster Editing , 2007, ESCAPE.

[85]  H. Wareham,et al.  Similarity as tractable transformation , 2009 .

[86]  Jakub Szymanik,et al.  Quantifiers in TIME and SPACE : computational complexity of generalized quantifiers in natural language , 2009 .

[87]  Jaroslaw Byrka,et al.  New Results on Optimizing Rooted Triplets Consistency , 2008, ISAAC.

[88]  Stéphan Thomassé.  A quadratic kernel for feedback vertex set , 2009, SODA.

[89]  Ge Xia,et al.  On parameterized exponential time complexity , 2009, Theor. Comput. Sci..

[90]  Michael R. Fellows,et al.  Leaf Powers and Their Properties: Using the Trees , 2008, ISAAC.

[91]  Dániel Marx,et al.  Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees , 2004, WAOA.

[92]  Claudia Lindner,et al.  Fixed-Parameter Tractability and Parameterized Complexity, Applied to Problems From Computational Social Choice — Mathematical Programming Glossary Supplement — , 2008 .

[93]  Petr A. Golovach,et al.  Clique-width: on the price of generality , 2009, SODA.

[94]  Sang-il Oum,et al.  Approximating rank-width and clique-width quickly , 2008, ACM Trans. Algorithms.

[95]  Gad M. Landau,et al.  A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression , 2009, STACS.

[96]  Hannes Moser,et al.  A Problem Kernelization for Graph Packing , 2009, SOFSEM.

[97]  Ken-ichi Kawarabayashi,et al.  List-color-critical graphs on a fixed surface , 2009, SODA.

[98]  Morteza Zadimoghaddam,et al.  The price of anarchy in cooperative network creation games , 2009, SECO.

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