IPEC 2015 Accepted Papers

• Petr Golovach, Clément Requileé and Dimitrios Thilikos.
  Variants of Plane Diameter Completion


• Florian Barbero, Gregory Gutin, Mark Jones and Bin Sheng.
  Parameterized and Approximation Algorithms for the Load Coloring Problem


• Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon and Gerhard Woeginger.
  Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs


• Jason Crampton, Gregory Gutin, Andrei Gagarin and Mark Jones.
  On the Workflow Satisfiability Problem with Class-Independent Constraints


• Eun Jung Kim, Christophe Paul, Ignasi Sau and Dimitrios Thilikos.
  Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism


• Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki and Junichi Teruyama.
  Improved Exact Algorithms for Mildly Sparse Instances of Max SAT


• Archontia Giannopoulou, George Mertzios and Rolf Niedermeier.
  Polynomial Fixed-Parameter Algorithms: A Case Study for Longest Path on Interval Graphs


• Eduard Eiben, Robert Ganian and Stefan Szeider.
  Meta-Kernelization using Well-Structured Modulators


• Hubie Chen.
  Parameter Compilation


• Mamadou Kanté, Eun Jung Kim, O-Joung Kwon and Christophe Paul.
  An FPT algorithm and a polynomial kernel for Linear Rankwidth One Vertex Deletion


• Ondrej Suchy.
  Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices


• Bart M. P. Jansen and Astrid Pieterse.
  Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT


• Lars Jaffke and Hans L. Bodlaender.
  Definability equals recognizability for k-outerplanar graphs


• Chiel ten Brinke, Frank van Houten and Hans Bodlaender.
  Practical Algorithms for Linear Boolean-width


• Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk and Arkadiusz Socała.
  Linear kernels for outbranching problems in sparse digraphs


• Jisu Jeong, Sigve Hortemo Sæther and Jan Arne Telle.
  Maximum matching width: new characterizations and a fast algorithm for dominating set


• Max Bannach, Christoph Stockhusen and Till Tantau.
  Fast Parallel Fixed-Parameter Algorithms via Color Coding


• Jannis Bulian and Anuj Dawar.
  Fixed-parameter Tractable Distances to Sparse Graph Classes


• Navid Talebanfard and Ilario Bonacina.
  Strong ETH and Resolution via Games and the Multiplicity of Strategies


• Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan and Saket Saurabh.
  Quick but Odd Growth of Cacti


• Eun Jung Kim and O-Joung Kwon.
  A polynomial kernel for Block Graph Deletion


• Tom van der Zanden.
  Parameterized Complexity of Graph Constraint Logic


• Holger Dell, Eunjung Kim, Michael Lampis, Valia Mitsou and Tobias Mömke.
  Complexity and Approximability for Parameterized CSPs


• Petr Golovach, Pinar Heggernes and Dieter Kratsch.
  Enumerating minimal connected dominating sets in graphs of bounded chordality


• Edouard Bonnet and Florian Sikora.
  The Graph Motif problem parameterized by the structure of the input graph


• Diptapriyo Majumdar, Venkatesh Raman and Saket Saurabh.
  Kernels for structural parameterizations of vertex cover -- case of small degree modulators


• Danny Hermelin, Moshe Kaspi, Christian Komusiewicz and Barak Navon.
  Parameterized Complexity of Critical Node Cuts


• Hanna Sumita, Naonori Kakimura and Kazuhisa Makino.
  Parameterized complexity of sparse linear complementarity problems


• R.B. Sandeep and Naveen Sivadasan.
  Parameterized lower bound and improved kernel for Diamond-free Edge Deletion


• Stefan Kratsch and Manuel Sorge.
  On Kernelization and Approximation for the Vector Connectivity Problem


• Fahad Panolan, Geevarghese Philip and Saket Saurabh.
  b-Chromatic Number: beyond NP-hardness


• Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil and Somnath Sikdar.
  Fast Biclustering by Dual Parameterization