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