| 2013 | A Completeness Theory for Polynomial (Turing) Kernelization. Danny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu |
| 2013 | A Faster FPT Algorithm for Bipartite Contraction. Sylvain Guillemot, Dániel Marx |
| 2013 | Algorithms for k-Internal Out-Branching. Meirav Zehavi |
| 2013 | Amalgam Width of Matroids. Lukás Mach, Tomas Toufar |
| 2013 | Chain Minors Are FPT. Jaroslaw Blasiok, Marcin Kaminski |
| 2013 | Completeness Results for Parameterized Space Classes. Christoph Stockhusen, Till Tantau |
| 2013 | Computing Tree-Depth Faster Than 2 n. Fedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk |
| 2013 | Contracting Few Edges to Remove Forbidden Induced Subgraphs. Leizhen Cai, Chengwei Guo |
| 2013 | Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. Bernhard Bliem, Reinhard Pichler, Stefan Woltran |
| 2013 | Exact Complexity and Satisfiability - (Invited Talk). Russell Impagliazzo, Ramamohan Paturi |
| 2013 | FPT Algorithms for Consecutive Ones Submatrix Problems. N. S. Narayanaswamy, R. Subashini |
| 2013 | Faster Exact Algorithms for Some Terminal Set Problems. Rajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh |
| 2013 | Fixed-Parameter and Approximation Algorithms: A New Look. Rajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz |
| 2013 | Hardness of r-dominating set on Graphs of Diameter (r + 1). Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh |
| 2013 | Incompressibility of H-Free Edge Modification. Leizhen Cai, Yufei Cai |
| 2013 | Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization. Edouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire |
| 2013 | On Sparsification for Computing Treewidth. Bart M. P. Jansen |
| 2013 | On Subexponential and FPT-Time Inapproximability. Edouard Bonnet, Bruno Escoffier, Eun Jung Kim, Vangelis Th. Paschos |
| 2013 | On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges. Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh |
| 2013 | On the Ordered List Subgraph Embedding Problems. Olawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic |
| 2013 | On the Parameterized Complexity of Reconfiguration Problems. Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki |
| 2013 | Parameterized Algorithms for Modular-Width. Jakub Gajarský, Michael Lampis, Sebastian Ordyniak |
| 2013 | Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. Rémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma |
| 2013 | Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers Gregory Z. Gutin, Stefan Szeider |
| 2013 | Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof |
| 2013 | Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs. Mateus de Oliveira Oliveira |
| 2013 | The Fine Details of Fast Dynamic Programming over Tree Decompositions. Hans L. Bodlaender, Paul S. Bonsma, Daniel Lokshtanov |
| 2013 | The Jump Number Problem: Exact and Parameterized. Dieter Kratsch, Stefan Kratsch |
| 2013 | The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups. Vikraman Arvind |
| 2013 | Treewidth and Pure Nash Equilibria. Antonis Thomas, Jan van Leeuwen |
| 2013 | Upper Bounds on Boolean-Width with Applications to Exact Algorithms. Yuri Rabinovich, Jan Arne Telle, Martin Vatshelle |