LIPIcs, Volume 43, IPEC 2015

• Thore Husfeldt and Iyad Kanj LIPIcs, Volume 43, IPEC'15, Complete Volume 10.4230/LIPIcs.IPEC.2015
• Thore Husfeldt and Iyad Kanj Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors 10.4230/LIPIcs.IPEC.2015.i
• Dimitrios M. Thilikos Bidimensionality and Parameterized Algorithms (Invited Talk) 10.4230/LIPIcs.IPEC.2015.1
• Virginia Vassilevska Williams Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk) 10.4230/LIPIcs.IPEC.2015.17
• Petr A. Golovach, Clément Requilé, and Dimitrios M. Thilikos Variants of Plane Diameter Completion 10.4230/LIPIcs.IPEC.2015.30
• Florian Barbero, Gregory Gutin, Mark Jones, and Bin Sheng Parameterized and Approximation Algorithms for the Load Coloring Problem 10.4230/LIPIcs.IPEC.2015.43
• Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, and Gerhard Woeginger Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs 10.4230/LIPIcs.IPEC.2015.55
• Jason Crampton, Andrei Gagarin, Gregory Gutin, and Mark Jones On the Workflow Satisfiability Problem with Class-independent Constraints 10.4230/LIPIcs.IPEC.2015.66
• Eun Jung Kim, Christophe Paul, Ignasi Sau, and Dimitrios M. Thilikos Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism 10.4230/LIPIcs.IPEC.2015.78
• Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, and Junichi Teruyama Improved Exact Algorithms for Mildly Sparse Instances of Max SAT 10.4230/LIPIcs.IPEC.2015.90
• Archontia C. Giannopoulou, George B. Mertzios, and Rolf Niedermeier Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs 10.4230/LIPIcs.IPEC.2015.102
• Eduard Eiben, Robert Ganian, and Stefan Szeider Meta-kernelization using Well-structured Modulators 10.4230/LIPIcs.IPEC.2015.114
• Hubie Chen Parameter Compilation 10.4230/LIPIcs.IPEC.2015.127
• Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, and Christophe Paul An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion 10.4230/LIPIcs.IPEC.2015.138
• Ondrj Suchý Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices 10.4230/LIPIcs.IPEC.2015.151
• Bart M. P. Jansen and Astrid Pieterse Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT 10.4230/LIPIcs.IPEC.2015.163
• Lars Jaffke and Hans L. Bodlaender Definability Equals Recognizability for k-Outerplanar Graphs 10.4230/LIPIcs.IPEC.2015.175
• Chiel B. ten Brinke, Frank J. P. van Houten, and Hans L. Bodlaender Practical Algorithms for Linear Boolean-width 10.4230/LIPIcs.IPEC.2015.187
• Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, and Arkadiusz Socala Linear Kernels for Outbranching Problems in Sparse Digraphs 10.4230/LIPIcs.IPEC.2015.199
• Jisu Jeong, Sigve Hortemo Sæther, and Jan Arne Telle Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set 10.4230/LIPIcs.IPEC.2015.212
• Max Bannach, Christoph Stockhusen, and Till Tantau Fast Parallel Fixed-parameter Algorithms via Color Coding 10.4230/LIPIcs.IPEC.2015.224
• Jannis Bulian and Anuj Dawar Fixed-parameter Tractable Distances to Sparse Graph Classes 10.4230/LIPIcs.IPEC.2015.236
• Ilario Bonacina and Navid Talebanfard Strong ETH and Resolution via Games and the Multiplicity of Strategies 10.4230/LIPIcs.IPEC.2015.248
• Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh Quick but Odd Growth of Cacti 10.4230/LIPIcs.IPEC.2015.258
• Eun Jung Kim and O-joung Kwon A Polynomial Kernel for Block Graph Deletion 10.4230/LIPIcs.IPEC.2015.270
• Tom C. van der Zanden Parameterized Complexity of Graph Constraint Logic 10.4230/LIPIcs.IPEC.2015.282
• Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, and Tobias Mömke Complexity and Approximability of Parameterized MAX-CSPs 10.4230/LIPIcs.IPEC.2015.294
• Petr A. Golovach, Pinar Heggernes, and Dieter Kratsch Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality 10.4230/LIPIcs.IPEC.2015.307
• Édouard Bonnet and Florian Sikora The Graph Motif Problem Parameterized by the Structure of the Input Graph 10.4230/LIPIcs.IPEC.2015.319
• Diptapriyo Majumdar, Venkatesh Raman, and Saket Saurabh Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators 10.4230/LIPIcs.IPEC.2015.331
• Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, and Barak Navon Parameterized Complexity of Critical Node Cuts 10.4230/LIPIcs.IPEC.2015.343
• Hanna Sumita, Naonori Kakimura, and Kazuhisa Makino Parameterized Complexity of Sparse Linear Complementarity Problems 10.4230/LIPIcs.IPEC.2015.355
• R. B. Sandeep and Naveen Sivadasan Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion 10.4230/LIPIcs.IPEC.2015.365
• Stefan Kratsch and Manuel Sorge On Kernelization and Approximation for the Vector Connectivity Problem 10.4230/LIPIcs.IPEC.2015.377
• Fahad Panolan, Geevarghese Philip, and Saket Saurabh B-Chromatic Number: Beyond NP-Hardness 10.4230/LIPIcs.IPEC.2015.389
• Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, and Somnath Sikdar Fast Biclustering by Dual Parameterization 10.4230/LIPIcs.IPEC.2015.402