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