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