<h2>LIPIcs, Volume 148, IPEC 2019</h2>
<ul>
<li>
<span class="authors">Bart M. P. Jansen and Jan Arne Telle</span>
<span class="title">LIPIcs, Volume 148, IPEC'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019">10.4230/LIPIcs.IPEC.2019</a>
</li>
<li>
<span class="authors">Bart M. P. Jansen and Jan Arne Telle</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.0">10.4230/LIPIcs.IPEC.2019.0</a>
</li>
<li>
<span class="authors">Benjamin Aram Berendsohn, László Kozma, and Dániel Marx</span>
<span class="title">Finding and Counting Permutations via CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.1">10.4230/LIPIcs.IPEC.2019.1</a>
</li>
<li>
<span class="authors">Stéphane Bessy, Marin Bougeret, Alan D. A. Carneiro, Fábio Protti, and Uéverton S. Souza</span>
<span class="title">Width Parameterizations for Knot-Free Vertex Deletion on Digraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.2">10.4230/LIPIcs.IPEC.2019.2</a>
</li>
<li>
<span class="authors">Markus Bläser and Christian Engels</span>
<span class="title">Parameterized Valiant’s Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.3">10.4230/LIPIcs.IPEC.2019.3</a>
</li>
<li>
<span class="authors">Johannes Blum</span>
<span class="title">Hierarchy of Transportation Network Parameters and Hardness Results</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.4">10.4230/LIPIcs.IPEC.2019.4</a>
</li>
<li>
<span class="authors">Édouard Bonnet and Nidhi Purohit</span>
<span class="title">Metric Dimension Parameterized by Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.5">10.4230/LIPIcs.IPEC.2019.5</a>
</li>
<li>
<span class="authors">Marco Bressan</span>
<span class="title">Faster Subgraph Counting in Sparse Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.6">10.4230/LIPIcs.IPEC.2019.6</a>
</li>
<li>
<span class="authors">Rajesh Chitnis and Graham Cormode</span>
<span class="title">Towards a Theory of Parameterized Streaming Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.7">10.4230/LIPIcs.IPEC.2019.7</a>
</li>
<li>
<span class="authors">Rajesh Chitnis and Andreas Emil Feldmann</span>
<span class="title">FPT Inapproximability of Directed Cut and Connectivity Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.8">10.4230/LIPIcs.IPEC.2019.8</a>
</li>
<li>
<span class="authors">Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, and Siddharth Gupta</span>
<span class="title">C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.9">10.4230/LIPIcs.IPEC.2019.9</a>
</li>
<li>
<span class="authors">Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, and Hung-Lung Wang</span>
<span class="title">The Complexity of Packing Edge-Disjoint Paths</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.10">10.4230/LIPIcs.IPEC.2019.10</a>
</li>
<li>
<span class="authors">Jan Dreier and Peter Rossmanith</span>
<span class="title">Hardness of FO Model-Checking on Random Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.11">10.4230/LIPIcs.IPEC.2019.11</a>
</li>
<li>
<span class="authors">Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa, Rafael C. S. Schouery, and Uéverton S. Souza</span>
<span class="title">Computing the Largest Bond of a Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.12">10.4230/LIPIcs.IPEC.2019.12</a>
</li>
<li>
<span class="authors">Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, and Yusuke Kobayashi</span>
<span class="title">Parameterized Algorithms for Maximum Cut with Connectivity Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.13">10.4230/LIPIcs.IPEC.2019.13</a>
</li>
<li>
<span class="authors">Till Fluschnik, Rolf Niedermeier, Valentin Rohm, and Philipp Zschoche</span>
<span class="title">Multistage Vertex Cover</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.14">10.4230/LIPIcs.IPEC.2019.14</a>
</li>
<li>
<span class="authors">Florent Foucaud, Hervé Hocquard, Dimitri Lajou, Valia Mitsou, and Théo Pierron</span>
<span class="title">Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.15">10.4230/LIPIcs.IPEC.2019.15</a>
</li>
<li>
<span class="authors">Jiawei Gao</span>
<span class="title">On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.16">10.4230/LIPIcs.IPEC.2019.16</a>
</li>
<li>
<span class="authors">Alexander Göke, Lydia Mirabel Mendoza Cadena, and Matthias Mnich</span>
<span class="title">Resolving Infeasibility of Linear Systems: A Parameterized Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.17">10.4230/LIPIcs.IPEC.2019.17</a>
</li>
<li>
<span class="authors">Petr A. Golovach and Dimitrios M. Thilikos</span>
<span class="title">Clustering to Given Connectivities</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.18">10.4230/LIPIcs.IPEC.2019.18</a>
</li>
<li>
<span class="authors">Guilherme C. M. Gomes and Ignasi Sau</span>
<span class="title">Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.19">10.4230/LIPIcs.IPEC.2019.19</a>
</li>
<li>
<span class="authors">Thekla Hamm</span>
<span class="title">Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.20">10.4230/LIPIcs.IPEC.2019.20</a>
</li>
<li>
<span class="authors">Edin Husić, Stéphan Thomassé, and Nicolas Trotignon</span>
<span class="title">The Independent Set Problem Is FPT for Even-Hole-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.21">10.4230/LIPIcs.IPEC.2019.21</a>
</li>
<li>
<span class="authors">Yoichi Iwata and Yusuke Kobayashi</span>
<span class="title">Improved Analysis of Highest-Degree Branching for Feedback Vertex Set</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.22">10.4230/LIPIcs.IPEC.2019.22</a>
</li>
<li>
<span class="authors">Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, and Bartosz Walczak</span>
<span class="title">Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.23">10.4230/LIPIcs.IPEC.2019.23</a>
</li>
<li>
<span class="authors">Gregory Rosenthal</span>
<span class="title">Beating Treewidth for Average-Case Subgraph Isomorphism</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.24">10.4230/LIPIcs.IPEC.2019.24</a>
</li>
<li>
<span class="authors">M. Ayaz Dzulfikar, Johannes K. Fichte, and Markus Hecher</span>
<span class="title">The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2019.25">10.4230/LIPIcs.IPEC.2019.25</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