LIPIcs, Volume 148, IPEC 2019

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