LIPIcs, Volume 115, IPEC 2018

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