| 2015 | 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, Patras, Greece, September 16-18, 2015 Thore Husfeldt, Iyad A. Kanj |
| 2015 | A Polynomial Kernel for Block Graph Deletion. Eun Jung Kim, O-joung Kwon |
| 2015 | An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion. Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon, Christophe Paul |
| 2015 | B-Chromatic Number: Beyond NP-Hardness. Fahad Panolan, Geevarghese Philip, Saket Saurabh |
| 2015 | Bidimensionality and Parameterized Algorithms (Invited Talk). Dimitrios M. Thilikos |
| 2015 | Complexity and Approximability of Parameterized MAX-CSPs. Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke |
| 2015 | Definability Equals Recognizability for k-Outerplanar Graphs. Lars Jaffke, Hans L. Bodlaender |
| 2015 | Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch |
| 2015 | Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices. Ondrej Suchý |
| 2015 | Fast Biclustering by Dual Parameterization. Pål Grønås Drange, Felix Reidl, Fernando Sánchez Villaamil, Somnath Sikdar |
| 2015 | Fast Parallel Fixed-parameter Algorithms via Color Coding. Max Bannach, Christoph Stockhusen, Till Tantau |
| 2015 | Fixed-parameter Tractable Distances to Sparse Graph Classes. Jannis Bulian, Anuj Dawar |
| 2015 | Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors. |
| 2015 | Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk). Virginia Vassilevska Williams |
| 2015 | Improved Exact Algorithms for Mildly Sparse Instances of Max SAT. Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama |
| 2015 | Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators. Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh |
| 2015 | Linear Kernels for Outbranching Problems in Sparse Digraphs. Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala |
| 2015 | Maximum Matching Width: New Characterizations and a Fast Algorithm for Dominating Set. Jisu Jeong, Sigve Hortemo Sæther, Jan Arne Telle |
| 2015 | Meta-kernelization using Well-structured Modulators. Eduard Eiben, Robert Ganian, Stefan Szeider |
| 2015 | On Kernelization and Approximation for the Vector Connectivity Problem. Stefan Kratsch, Manuel Sorge |
| 2015 | On the Workflow Satisfiability Problem with Class-independent Constraints. Jason Crampton, Andrei V. Gagarin, Gregory Z. Gutin, Mark Jones |
| 2015 | Parameter Compilation. Hubie Chen |
| 2015 | Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism. Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos |
| 2015 | Parameterized Complexity of Critical Node Cuts. Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon |
| 2015 | Parameterized Complexity of Graph Constraint Logic. Tom C. van der Zanden |
| 2015 | Parameterized Complexity of Sparse Linear Complementarity Problems. Hanna Sumita, Naonori Kakimura, Kazuhisa Makino |
| 2015 | Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion. R. B. Sandeep, Naveen Sivadasan |
| 2015 | Parameterized and Approximation Algorithms for the Load Coloring Problem. Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng |
| 2015 | Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs. Archontia C. Giannopoulou, George B. Mertzios, Rolf Niedermeier |
| 2015 | Practical Algorithms for Linear Boolean-width. Chiel B. Ten Brinke, Frank J. P. van Houten, Hans L. Bodlaender |
| 2015 | Quick but Odd Growth of Cacti. Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh |
| 2015 | Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs. Danny Hermelin, Judith-Madeleine Kubitza, Dvir Shabtay, Nimrod Talmon, Gerhard J. Woeginger |
| 2015 | Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT. Bart M. P. Jansen, Astrid Pieterse |
| 2015 | Strong ETH and Resolution via Games and the Multiplicity of Strategies. Ilario Bonacina, Navid Talebanfard |
| 2015 | The Graph Motif Problem Parameterized by the Structure of the Input Graph. Edouard Bonnet, Florian Sikora |
| 2015 | Variants of Plane Diameter Completion. Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos |