<h2>LIPIcs, Volume 180, IPEC 2020</h2>
<ul>
<li>
<span class="authors">Yixin Cao and Marcin Pilipczuk</span>
<span class="title">LIPIcs, Volume 180, IPEC 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020">10.4230/LIPIcs.IPEC.2020</a>
</li>
<li>
<span class="authors">Yixin Cao and Marcin Pilipczuk</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.0">10.4230/LIPIcs.IPEC.2020.0</a>
</li>
<li>
<span class="authors">Akanksha Agrawal and M. S. Ramanujan</span>
<span class="title">On the Parameterized Complexity of Clique Elimination Distance</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.1">10.4230/LIPIcs.IPEC.2020.1</a>
</li>
<li>
<span class="authors">Jørgen Bang-Jensen, Eduard Eiben, Gregory Gutin, Magnus Wahlström, and Anders Yeo</span>
<span class="title">Component Order Connectivity in Directed Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.2">10.4230/LIPIcs.IPEC.2020.2</a>
</li>
<li>
<span class="authors">Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, and O-joung Kwon</span>
<span class="title">Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.3">10.4230/LIPIcs.IPEC.2020.3</a>
</li>
<li>
<span class="authors">Hans L. Bodlaender and Marieke van der Wegen</span>
<span class="title">Parameterized Complexity of Scheduling Chains of Jobs with Delays</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.4">10.4230/LIPIcs.IPEC.2020.4</a>
</li>
<li>
<span class="authors">Łukasz Bożyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, and Karolina Okrasa</span>
<span class="title">Vertex Deletion into Bipartite Permutation Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.5">10.4230/LIPIcs.IPEC.2020.5</a>
</li>
<li>
<span class="authors">Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, and Daniël Paulusma</span>
<span class="title">Bounding the Mim-Width of Hereditary Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.6">10.4230/LIPIcs.IPEC.2020.6</a>
</li>
<li>
<span class="authors">Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, and Minshen Zhu</span>
<span class="title">Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.7">10.4230/LIPIcs.IPEC.2020.7</a>
</li>
<li>
<span class="authors">Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, and Dušan Knop</span>
<span class="title">Recognizing Proper Tree-Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.8">10.4230/LIPIcs.IPEC.2020.8</a>
</li>
<li>
<span class="authors">Louis Dublois, Michael Lampis, and Vangelis Th. Paschos</span>
<span class="title">New Algorithms for Mixed Dominating Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.9">10.4230/LIPIcs.IPEC.2020.9</a>
</li>
<li>
<span class="authors">Eduard Eiben, William Lochet, and Saket Saurabh</span>
<span class="title">A Polynomial Kernel for Paw-Free Editing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.10">10.4230/LIPIcs.IPEC.2020.10</a>
</li>
<li>
<span class="authors">Carl Einarson and Felix Reidl</span>
<span class="title">A General Kernelization Technique for Domination and Independence Problems in Sparse Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.11">10.4230/LIPIcs.IPEC.2020.11</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, and Roohani Sharma</span>
<span class="title">Parameterized Complexity of Directed Spanner Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.12">10.4230/LIPIcs.IPEC.2020.12</a>
</li>
<li>
<span class="authors">Marcelo Garlet Milani</span>
<span class="title">A Polynomial Kernel for Funnel Arc Deletion Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.13">10.4230/LIPIcs.IPEC.2020.13</a>
</li>
<li>
<span class="authors">Dishant Goyal, Ragesh Jaiswal, and Amit Kumar</span>
<span class="title">FPT Approximation for Constrained Metric k-Median/Means</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.14">10.4230/LIPIcs.IPEC.2020.14</a>
</li>
<li>
<span class="authors">Tatsuhiko Hatanaka, Felix Hommelsheim, Takehiro Ito, Yusuke Kobayashi, Moritz Mühlenthaler, and Akira Suzuki</span>
<span class="title">Fixed-Parameter Algorithms for Graph Constraint Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.15">10.4230/LIPIcs.IPEC.2020.15</a>
</li>
<li>
<span class="authors">Radek Hušek, Dušan Knop, and Tomáš Masařk</span>
<span class="title">Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.16">10.4230/LIPIcs.IPEC.2020.16</a>
</li>
<li>
<span class="authors">Andreas Emil Feldmann, Davis Issac, and Ashutosh Rai</span>
<span class="title">Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.17">10.4230/LIPIcs.IPEC.2020.17</a>
</li>
<li>
<span class="authors">Ashwin Jacob, Diptapriyo Majumdar, and Venkatesh Raman</span>
<span class="title">Parameterized Complexity of Deletion to Scattered Graph Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.18">10.4230/LIPIcs.IPEC.2020.18</a>
</li>
<li>
<span class="authors">Ashwin Jacob, Fahad Panolan, Venkatesh Raman, and Vibha Sahlot</span>
<span class="title">Structural Parameterizations with Modulator Oblivion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.19">10.4230/LIPIcs.IPEC.2020.19</a>
</li>
<li>
<span class="authors">Leon Kellerhals and Tomohiro Koana</span>
<span class="title">Parameterized Complexity of Geodetic Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.20">10.4230/LIPIcs.IPEC.2020.20</a>
</li>
<li>
<span class="authors">Yasuaki Kobayashi and Yota Otachi</span>
<span class="title">Parameterized Complexity of Graph Burning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.21">10.4230/LIPIcs.IPEC.2020.21</a>
</li>
<li>
<span class="authors">Tuukka Korhonen</span>
<span class="title">Finding Optimal Triangulations Parameterized by Edge Clique Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.22">10.4230/LIPIcs.IPEC.2020.22</a>
</li>
<li>
<span class="authors">Łukasz Kowalik and Konrad Majewski</span>
<span class="title">The Asymmetric Travelling Salesman Problem In Sparse Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.23">10.4230/LIPIcs.IPEC.2020.23</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, and Sebastian Siebertz</span>
<span class="title">On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.24">10.4230/LIPIcs.IPEC.2020.24</a>
</li>
<li>
<span class="authors">Jesper Nederlof and Céline M. F. Swennenhuis</span>
<span class="title">On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.25">10.4230/LIPIcs.IPEC.2020.25</a>
</li>
<li>
<span class="authors">Saket Saurabh and Prafullkumar Tale</span>
<span class="title">On the Parameterized Complexity of Maximum Degree Contraction Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.26">10.4230/LIPIcs.IPEC.2020.26</a>
</li>
<li>
<span class="authors">Max Bannach, Sebastian Berndt, Martin Schuster, and Marcel Wienöbst</span>
<span class="title">PACE Solver Description: Fluid</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.27">10.4230/LIPIcs.IPEC.2020.27</a>
</li>
<li>
<span class="authors">Max Bannach, Sebastian Berndt, Martin Schuster, and Marcel Wienöbst</span>
<span class="title">PACE Solver Description: PID^⋆</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.28">10.4230/LIPIcs.IPEC.2020.28</a>
</li>
<li>
<span class="authors">Ruben Brokkelkamp, Raymond van Venetië, Mees de Vries, and Jan Westerdiep</span>
<span class="title">PACE Solver Description: tdULL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.29">10.4230/LIPIcs.IPEC.2020.29</a>
</li>
<li>
<span class="authors">Tuukka Korhonen</span>
<span class="title">PACE Solver Description: SMS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.30">10.4230/LIPIcs.IPEC.2020.30</a>
</li>
<li>
<span class="authors">Zijian Xu, Dejun Mao, and Vorapong Suppakitpaisarn</span>
<span class="title">PACE Solver Description: Computing Exact Treedepth via Minimal Separators</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.31">10.4230/LIPIcs.IPEC.2020.31</a>
</li>
<li>
<span class="authors">Ben Strasser</span>
<span class="title">PACE Solver Description: Tree Depth with FlowCutter</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.32">10.4230/LIPIcs.IPEC.2020.32</a>
</li>
<li>
<span class="authors">Sylwester Swat</span>
<span class="title">PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.33">10.4230/LIPIcs.IPEC.2020.33</a>
</li>
<li>
<span class="authors">James Trimble</span>
<span class="title">PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.34">10.4230/LIPIcs.IPEC.2020.34</a>
</li>
<li>
<span class="authors">James Trimble</span>
<span class="title">PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.35">10.4230/LIPIcs.IPEC.2020.35</a>
</li>
<li>
<span class="authors">Marcin Wrochna</span>
<span class="title">PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.36">10.4230/LIPIcs.IPEC.2020.36</a>
</li>
<li>
<span class="authors">Łukasz Kowalik, Marcin Mucha, Wojciech Nadara, Marcin Pilipczuk, Manuel Sorge, and Piotr Wygocki</span>
<span class="title">The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2020.37">10.4230/LIPIcs.IPEC.2020.37</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