LIPIcs, Volume 180, IPEC 2020

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