| 2018 | 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, Vienna, Austria, September 6-8, 2017 Daniel Lokshtanov, Naomi Nishimura |
| 2017 | A Fixed-Parameter Perspective on #BIS. Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas |
| 2017 | An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz |
| 2017 | An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. Yasuaki Kobayashi, Hiromu Ohtsuka, Hisao Tamaki |
| 2017 | An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs. George Manoussakis |
| 2017 | Computing Treewidth on the GPU. Tom C. van der Zanden, Hans L. Bodlaender |
| 2017 | Contraction-Bidimensionality of Geometric Intersection Graphs. Julien Baste, Dimitrios M. Thilikos |
| 2017 | DynASP2.5: Dynamic Programming on Tree Decompositions in Action. Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
| 2017 | FO Model Checking of Geometric Graphs. Petr Hlinený, Filip Pokrývka, Bodhayan Roy |
| 2017 | Finding Connected Secluded Subgraphs. Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre |
| 2017 | Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán |
| 2017 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2017 | Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx |
| 2017 | Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants. Andreas Björklund, Petteri Kaski, R. Ryan Williams |
| 2017 | How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?. Marin Bougeret, Ignasi Sau |
| 2017 | K-Best Solutions of MSO Problems on Tree-Decomposable Graphs. David Eppstein, Denis Kurz |
| 2017 | Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. Lei Shang, Michele Garraffa, Federico Della Croce, Vincent T'kindt |
| 2017 | Odd Multiway Cut in Directed Acyclic Graphs. Karthekeyan Chandrasekaran, Sahand Mozaffari |
| 2017 | On the Parameterized Complexity of Contraction to Generalization of Trees. Akanksha Agrawal, Saket Saurabh, Prafullkumar Tale |
| 2017 | On the Parameterized Complexity of Red-Blue Points Separation. Édouard Bonnet, Panos Giannopoulos, Michael Lampis |
| 2017 | Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
| 2017 | Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. Bart M. P. Jansen, Astrid Pieterse |
| 2017 | Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, Dimitrios M. Thilikos |
| 2017 | Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. Lars Jaffke, O-joung Kwon, Jan Arne Telle |
| 2017 | Relativization and Interactive Proof Systems in Parameterized Complexity Theory. Ralph Bottesch |
| 2017 | Smaller Parameters for Vertex Cover Kernelization. Eva-Maria C. Hols, Stefan Kratsch |
| 2017 | Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. Jean Cardinal, Jerri Nummenpalo, Emo Welzl |
| 2017 | The Dominating Set Problem in Geometric Intersection Graphs. Mark de Berg, Sándor Kisfaludi-Bak, Gerhard J. Woeginger |
| 2017 | The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. Holger Dell, Christian Komusiewicz, Nimrod Talmon, Mathias Weller |
| 2017 | Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. Lech Duraj, Marvin Künnemann, Adam Polak |
| 2017 | Treewidth with a Quantifier Alternation Revisited. Michael Lampis, Valia Mitsou |
| 2017 | Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. Bart M. P. Jansen, Marcin Pilipczuk, Marcin Wrochna |