<h2>LIPIcs, Volume 63, IPEC 2016</h2>
<ul>
<li>
<span class="authors">Jiong Guo and Danny Hermelin</span>
<span class="title">LIPIcs, Volume 63, IPEC'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016">10.4230/LIPIcs.IPEC.2016</a>
</li>
<li>
<span class="authors">Jiong Guo and Danny Hermelin</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.2016.0">10.4230/LIPIcs.IPEC.2016.0</a>
</li>
<li>
<span class="authors">Andreas Björklund</span>
<span class="title">Determinant Sums for Hamiltonicity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.1">10.4230/LIPIcs.IPEC.2016.1</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, and Roohani Sharma</span>
<span class="title">Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.2">10.4230/LIPIcs.IPEC.2016.2</a>
</li>
<li>
<span class="authors">Gábor Bacsó, Dániel Marx, and Zsolt Tuza</span>
<span class="title">H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.3">10.4230/LIPIcs.IPEC.2016.3</a>
</li>
<li>
<span class="authors">Max Bannach and Till Tantau</span>
<span class="title">Parallel Multivariate Meta-Theorems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.4">10.4230/LIPIcs.IPEC.2016.4</a>
</li>
<li>
<span class="authors">René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, and Ondrej Suchý</span>
<span class="title">Finding Secluded Places of Special Interest in Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.5">10.4230/LIPIcs.IPEC.2016.5</a>
</li>
<li>
<span class="authors">Thomas Bläsius, Tobias Friedrich, and Martin Schirneck</span>
<span class="title">The Parameterized Complexity of Dependency Detection in Relational Databases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.6">10.4230/LIPIcs.IPEC.2016.6</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender, Hirotaka Ono, and Yota Otachi</span>
<span class="title">A Faster Parameterized Algorithm for Pseudoforest Deletion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.7">10.4230/LIPIcs.IPEC.2016.7</a>
</li>
<li>
<span class="authors">Glencora Borradaile and Hung Le</span>
<span class="title">Optimal Dynamic Program for r-Domination Problems over Tree Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.8">10.4230/LIPIcs.IPEC.2016.8</a>
</li>
<li>
<span class="authors">Cornelius Brand, Holger Dell, and Marc Roth</span>
<span class="title">Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.9">10.4230/LIPIcs.IPEC.2016.9</a>
</li>
<li>
<span class="authors">Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, and Rolf Niedermeier</span>
<span class="title">A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.10">10.4230/LIPIcs.IPEC.2016.10</a>
</li>
<li>
<span class="authors">Sunil Chandran, Davis Issac, and Andreas Karrenbauer</span>
<span class="title">On the Parameterized Complexity of Biclique Cover and Partition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.11">10.4230/LIPIcs.IPEC.2016.11</a>
</li>
<li>
<span class="authors">Khaled Elbassioni</span>
<span class="title">Exact Algorithms for List-Coloring of Intersecting Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.12">10.4230/LIPIcs.IPEC.2016.12</a>
</li>
<li>
<span class="authors">Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, and Stefan Rümmele</span>
<span class="title">Turbocharging Treewidth Heuristics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.13">10.4230/LIPIcs.IPEC.2016.13</a>
</li>
<li>
<span class="authors">Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, and Jan Arne Telle</span>
<span class="title">On Satisfiability Problems with a Linear Structure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.14">10.4230/LIPIcs.IPEC.2016.14</a>
</li>
<li>
<span class="authors">Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, and Marcin Wrochna</span>
<span class="title">Cutwidth: Obstructions and Algorithmic Aspects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.15">10.4230/LIPIcs.IPEC.2016.15</a>
</li>
<li>
<span class="authors">Thore Husfeldt</span>
<span class="title">Computing Graph Distances Parameterized by Treewidth and Diameter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.16">10.4230/LIPIcs.IPEC.2016.16</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen and Jules J. H. M. Wulms</span>
<span class="title">Lower Bounds for Protrusion Replacement by Counting Equivalence Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.17">10.4230/LIPIcs.IPEC.2016.17</a>
</li>
<li>
<span class="authors">Yasuaki Kobayashi and Hisao Tamaki</span>
<span class="title">Treedepth Parameterized by Vertex Cover Number</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.18">10.4230/LIPIcs.IPEC.2016.18</a>
</li>
<li>
<span class="authors">R. Krithika, Abhishek Sahu, and Prafullkumar Tale</span>
<span class="title">Dynamic Parameterized Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.19">10.4230/LIPIcs.IPEC.2016.19</a>
</li>
<li>
<span class="authors">Mithilesh Kumar and Daniel Lokshtanov</span>
<span class="title">A 2lk Kernel for l-Component Order Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.20">10.4230/LIPIcs.IPEC.2016.20</a>
</li>
<li>
<span class="authors">Diptapriyo Majumdar</span>
<span class="title">Structural Parameterizations of Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.21">10.4230/LIPIcs.IPEC.2016.21</a>
</li>
<li>
<span class="authors">Kitty Meeks</span>
<span class="title">Randomised Enumeration of Small Witnesses Using a Decision Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.22">10.4230/LIPIcs.IPEC.2016.22</a>
</li>
<li>
<span class="authors">Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, and Irena Schindler</span>
<span class="title">Backdoors for Linear Temporal Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.23">10.4230/LIPIcs.IPEC.2016.23</a>
</li>
<li>
<span class="authors">Matthias Mnich and Eva-Lotta Teutrine</span>
<span class="title">Improved Bounds for Minimal Feedback Vertex Sets in Tournaments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.24">10.4230/LIPIcs.IPEC.2016.24</a>
</li>
<li>
<span class="authors">Mateus de Oliveira Oliveira</span>
<span class="title">Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.25">10.4230/LIPIcs.IPEC.2016.25</a>
</li>
<li>
<span class="authors">Marcin Pilipczuk, Michal Pilipczuk, and Marcin Wrochna</span>
<span class="title">Edge Bipartization Faster Than 2^k</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.26">10.4230/LIPIcs.IPEC.2016.26</a>
</li>
<li>
<span class="authors">Willem J. A. Pino, Hans L. Bodlaender, and Johan M. M. van Rooij</span>
<span class="title">Cut and Count and Representative Sets on Branch Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.27">10.4230/LIPIcs.IPEC.2016.27</a>
</li>
<li>
<span class="authors">Blair D. Sullivan and Andrew van der Poel</span>
<span class="title">A Fast Parameterized Algorithm for Co-Path Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.28">10.4230/LIPIcs.IPEC.2016.28</a>
</li>
<li>
<span class="authors">Michal Wlodarczyk</span>
<span class="title">Clifford Algebras Meet Tree Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.29">10.4230/LIPIcs.IPEC.2016.29</a>
</li>
<li>
<span class="authors">Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, and Frances A. Rosamond</span>
<span class="title">The First Parameterized Algorithms and Computational Experiments Challenge</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2016.30">10.4230/LIPIcs.IPEC.2016.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