| 2017 | 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, Aarhus, Denmark, August 24-26, 2016 Jiong Guo, Danny Hermelin |
| 2016 | A 2lk Kernel for l-Component Order Connectivity. Mithilesh Kumar, Daniel Lokshtanov |
| 2016 | A Fast Parameterized Algorithm for Co-Path Set. Blair D. Sullivan, Andrew van der Poel |
| 2016 | A Faster Parameterized Algorithm for Pseudoforest Deletion. Hans L. Bodlaender, Hirotaka Ono, Yota Otachi |
| 2016 | A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, Rolf Niedermeier |
| 2016 | Backdoors for Linear Temporal Logic. Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, Irena Schindler |
| 2016 | Clifford Algebras Meet Tree Decompositions. Michal Wlodarczyk |
| 2016 | Computing Graph Distances Parameterized by Treewidth and Diameter. Thore Husfeldt |
| 2016 | Cut and Count and Representative Sets on Branch Decompositions. Willem J. A. Pino, Hans L. Bodlaender, Johan M. M. van Rooij |
| 2016 | Cutwidth: Obstructions and Algorithmic Aspects. Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna |
| 2016 | Determinant Sums for Hamiltonicity (Invited Talk). Andreas Björklund |
| 2016 | Dynamic Parameterized Problems. R. Krithika, Abhishek Sahu, Prafullkumar Tale |
| 2016 | Edge Bipartization Faster Than 2^k. Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna |
| 2016 | Exact Algorithms for List-Coloring of Intersecting Hypergraphs. Khaled M. Elbassioni |
| 2016 | Finding Secluded Places of Special Interest in Graphs. René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý |
| 2016 | Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. Cornelius Brand, Holger Dell, Marc Roth |
| 2016 | Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors. |
| 2016 | Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth. Mateus de Oliveira Oliveira |
| 2016 | H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms. Gábor Bacsó, Dániel Marx, Zsolt Tuza |
| 2016 | Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma |
| 2016 | Improved Bounds for Minimal Feedback Vertex Sets in Tournaments. Matthias Mnich, Eva-Lotta Teutrine |
| 2016 | Lower Bounds for Protrusion Replacement by Counting Equivalence Classes. Bart M. P. Jansen, Jules J. H. M. Wulms |
| 2016 | On Satisfiability Problems with a Linear Structure. Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle |
| 2016 | On the Parameterized Complexity of Biclique Cover and Partition. L. Sunil Chandran, Davis Issac, Andreas Karrenbauer |
| 2016 | Optimal Dynamic Program for r-Domination Problems over Tree Decompositions. Glencora Borradaile, Hung Le |
| 2016 | Parallel Multivariate Meta-Theorems. Max Bannach, Till Tantau |
| 2016 | Randomised Enumeration of Small Witnesses Using a Decision Oracle. Kitty Meeks |
| 2016 | Structural Parameterizations of Feedback Vertex Set. Diptapriyo Majumdar |
| 2016 | The First Parameterized Algorithms and Computational Experiments Challenge. Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, Frances A. Rosamond |
| 2016 | The Parameterized Complexity of Dependency Detection in Relational Databases. Thomas Bläsius, Tobias Friedrich, Martin Schirneck |
| 2016 | Treedepth Parameterized by Vertex Cover Number. Yasuaki Kobayashi, Hisao Tamaki |
| 2016 | Turbocharging Treewidth Heuristics. Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele |