<h2>LIPIcs, Volume 115, IPEC 2018</h2>
<ul>
<li>
<span class="authors">Christophe Paul and Michał Pilipczuk</span>
<span class="title">LIPIcs, Volume 115, IPEC'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018">10.4230/LIPIcs.IPEC.2018</a>
</li>
<li>
<span class="authors">Christophe Paul and Michal 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.2018.0">10.4230/LIPIcs.IPEC.2018.0</a>
</li>
<li>
<span class="authors">Radu Curticapean</span>
<span class="title">Counting Problems in Parameterized Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.1">10.4230/LIPIcs.IPEC.2018.1</a>
</li>
<li>
<span class="authors">Julien Baste, Ignasi Sau, and Dimitrios M. Thilikos</span>
<span class="title">A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.2">10.4230/LIPIcs.IPEC.2018.2</a>
</li>
<li>
<span class="authors">Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, and Rolf Morel</span>
<span class="title">Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.3">10.4230/LIPIcs.IPEC.2018.3</a>
</li>
<li>
<span class="authors">Karl Bringmann, Thore Husfeldt, and Måns Magnusson</span>
<span class="title">Multivariate Analysis of Orthogonal Range Searching and Graph Distances</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.4">10.4230/LIPIcs.IPEC.2018.4</a>
</li>
<li>
<span class="authors">Kustaa Kangas, Mikko Koivisto, and Sami Salonen</span>
<span class="title">A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.5">10.4230/LIPIcs.IPEC.2018.5</a>
</li>
<li>
<span class="authors">Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, and Jan Arne Telle</span>
<span class="title">Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.6">10.4230/LIPIcs.IPEC.2018.6</a>
</li>
<li>
<span class="authors">Junjie Luo, Hendrik Molter, and Ondrej Suchý</span>
<span class="title">A Parameterized Complexity View on Collapsing k-Cores</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.7">10.4230/LIPIcs.IPEC.2018.7</a>
</li>
<li>
<span class="authors">Saket Saurabh and Meirav Zehavi</span>
<span class="title">Parameterized Complexity of Multi-Node Hubs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.8">10.4230/LIPIcs.IPEC.2018.8</a>
</li>
<li>
<span class="authors">Kitty Meeks and Fiona Skerman</span>
<span class="title">The Parameterised Complexity of Computing the Maximum Modularity of a Graph</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.9">10.4230/LIPIcs.IPEC.2018.9</a>
</li>
<li>
<span class="authors">Florian Barbero, Lucas Isenmann, and Jocelyn Thiebaut</span>
<span class="title">On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.10">10.4230/LIPIcs.IPEC.2018.10</a>
</li>
<li>
<span class="authors">David Eppstein and Daniel Lokshtanov</span>
<span class="title">The Parameterized Complexity of Finding Point Sets with Hereditary Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.11">10.4230/LIPIcs.IPEC.2018.11</a>
</li>
<li>
<span class="authors">Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, and Ana Silva</span>
<span class="title">Dual Parameterization of Weighted Coloring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.12">10.4230/LIPIcs.IPEC.2018.12</a>
</li>
<li>
<span class="authors">Max Bannach and Till Tantau</span>
<span class="title">Computing Kernels in Parallel: Lower and Upper Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.13">10.4230/LIPIcs.IPEC.2018.13</a>
</li>
<li>
<span class="authors">Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, and Saket Saurabh</span>
<span class="title">Exploring the Kernelization Borders for Hitting Cycles</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.14">10.4230/LIPIcs.IPEC.2018.14</a>
</li>
<li>
<span class="authors">Hubie Chen, Bart M. P. Jansen, and Astrid Pieterse</span>
<span class="title">Best-Case and Worst-Case Sparsifiability of Boolean CSPs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.15">10.4230/LIPIcs.IPEC.2018.15</a>
</li>
<li>
<span class="authors">David Eppstein and Elham Havvaei</span>
<span class="title">Parameterized Leaf Power Recognition via Embedding into Graph Products</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.16">10.4230/LIPIcs.IPEC.2018.16</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, and Rémi Watrigant</span>
<span class="title">Parameterized Complexity of Independent Set in H-Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.17">10.4230/LIPIcs.IPEC.2018.17</a>
</li>
<li>
<span class="authors">Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, and Magnus Wahlström</span>
<span class="title">Multi-Budgeted Directed Cuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.18">10.4230/LIPIcs.IPEC.2018.18</a>
</li>
<li>
<span class="authors">Christian Komusiewicz, Dieter Kratsch, and Van Bang Le</span>
<span class="title">Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.19">10.4230/LIPIcs.IPEC.2018.19</a>
</li>
<li>
<span class="authors">Charis Papadopoulos and Spyridon Tzimas</span>
<span class="title">Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.20">10.4230/LIPIcs.IPEC.2018.20</a>
</li>
<li>
<span class="authors">Tomás Gavenciak, Dusan Knop, and Martin Koutecký</span>
<span class="title">Integer Programming in Parameterized Complexity: Three Miniatures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.21">10.4230/LIPIcs.IPEC.2018.21</a>
</li>
<li>
<span class="authors">Ivan Bliznets and Danil Sagunov</span>
<span class="title">Solving Target Set Selection with Bounded Thresholds Faster than 2^n</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.22">10.4230/LIPIcs.IPEC.2018.22</a>
</li>
<li>
<span class="authors">Katrin Casel</span>
<span class="title">Resolving Conflicts for Lower-Bounded Clustering</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.23">10.4230/LIPIcs.IPEC.2018.23</a>
</li>
<li>
<span class="authors">Marc Roth and Johannes Schmitt</span>
<span class="title">Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.24">10.4230/LIPIcs.IPEC.2018.24</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Mateus de Oliveira Oliveira, and Saket Saurabh</span>
<span class="title">A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.25">10.4230/LIPIcs.IPEC.2018.25</a>
</li>
<li>
<span class="authors">Édouard Bonnet and Florian Sikora</span>
<span class="title">The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.IPEC.2018.26">10.4230/LIPIcs.IPEC.2018.26</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