LIPIcs, Volume 89, IPEC 2017

• Daniel Lokshtanov and Naomi Nishimura LIPIcs, Volume 89, IPEC'17, Complete Volume 10.4230/LIPIcs.IPEC.2017
• Daniel Lokshtanov and Naomi Nishimura Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.IPEC.2017.0
• Akanksha Agrawal, Saket Saurabh, and Prafullkumar Tale On the Parameterized Complexity of Contraction to Generalization of Trees 10.4230/LIPIcs.IPEC.2017.1
• Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, and Jacobo Torán Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable 10.4230/LIPIcs.IPEC.2017.2
• Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, and Dimitrios M. Thilikos Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter 10.4230/LIPIcs.IPEC.2017.3
• Julien Baste, Ignasi Sau, and Dimitrios M. Thilikos Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth 10.4230/LIPIcs.IPEC.2017.4
• Julien Baste and Dimitrios M. Thilikos Contraction-Bidimensionality of Geometric Intersection Graphs 10.4230/LIPIcs.IPEC.2017.5
• Andreas Björklund, Petteri Kaski, and Ryan Williams Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants 10.4230/LIPIcs.IPEC.2017.6
• Édouard Bonnet, Nick Brettell, O-joung Kwon, and Dániel Marx Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms 10.4230/LIPIcs.IPEC.2017.7
• Édouard Bonnet, Panos Giannopoulos, and Michael Lampis On the Parameterized Complexity of Red-Blue Points Separation 10.4230/LIPIcs.IPEC.2017.8
• Ralph Bottesch Relativization and Interactive Proof Systems in Parameterized Complexity Theory 10.4230/LIPIcs.IPEC.2017.9
• Marin Bougeret and Ignasi Sau How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? 10.4230/LIPIcs.IPEC.2017.10
• Jean Cardinal, Jerri Nummenpalo, and Emo Welzl Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems 10.4230/LIPIcs.IPEC.2017.11
• Karthekeyan Chandrasekaran and Sahand Mozaffari Odd Multiway Cut in Directed Acyclic Graphs 10.4230/LIPIcs.IPEC.2017.12
• Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, and John Lapinskas A Fixed-Parameter Perspective on #BIS 10.4230/LIPIcs.IPEC.2017.13
• Mark de Berg, Sándor Kisfaludi-Bak, and Gerhard Woeginger The Dominating Set Problem in Geometric Intersection Graphs 10.4230/LIPIcs.IPEC.2017.14
• Lech Duraj, Marvin Künnemann, and Adam Polak Tight Conditional Lower Bounds for Longest Common Increasing Subsequence 10.4230/LIPIcs.IPEC.2017.15
• David Eppstein and Denis Kurz K-Best Solutions of MSO Problems on Tree-Decomposable Graphs 10.4230/LIPIcs.IPEC.2017.16
• Johannes K. Fichte, Markus Hecher, Michael Morak, and Stefan Woltran DynASP2.5: Dynamic Programming on Tree Decompositions in Action 10.4230/LIPIcs.IPEC.2017.17
• Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, and Pedro Montealegre Finding Connected Secluded Subgraphs 10.4230/LIPIcs.IPEC.2017.18
• Petr Hlineny, Filip Pokrývka, and Bodhayan Roy FO Model Checking of Geometric Graphs 10.4230/LIPIcs.IPEC.2017.19
• Eva-Maria C. Hols and Stefan Kratsch Smaller Parameters for Vertex Cover Kernelization 10.4230/LIPIcs.IPEC.2017.20
• Lars Jaffke, O-joung Kwon, and Jan Arne Telle Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width 10.4230/LIPIcs.IPEC.2017.21
• Bart M. P. Jansen and Astrid Pieterse Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials 10.4230/LIPIcs.IPEC.2017.22
• Bart M. P. Jansen, Marcin Pilipczuk, and Marcin Wrochna Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor 10.4230/LIPIcs.IPEC.2017.23
• Nikolai Karpov, Marcin Pilipczuk, and Anna Zych-Pawlewicz An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs 10.4230/LIPIcs.IPEC.2017.24
• Yasuaki Kobayashi, Hiromu Ohtsuka, and Hisao Tamaki An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization 10.4230/LIPIcs.IPEC.2017.25
• Michael Lampis and Valia Mitsou Treewidth with a Quantifier Alternation Revisited 10.4230/LIPIcs.IPEC.2017.26
• George Manoussakis An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs 10.4230/LIPIcs.IPEC.2017.27
• Lei Shang, Michele Garraffa, Federico Della Croce, and Vincent T'Kindt Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem 10.4230/LIPIcs.IPEC.2017.28
• Tom C. van der Zanden and Hans L. Bodlaender Computing Treewidth on the GPU 10.4230/LIPIcs.IPEC.2017.29
• Holger Dell, Christian Komusiewicz, Nimrod Talmon, and Mathias Weller The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration 10.4230/LIPIcs.IPEC.2017.30