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