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