Abstract is missing.
- Exact Complexity and Satisfiability - (Invited Talk)Russell Impagliazzo, Ramamohan Paturi. 1-3 [doi]
- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation GroupsVikraman Arvind. 4-15 [doi]
- Parameterized Complexity of Two Edge Contraction Problems with Degree ConstraintsRémy Belmonte, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma. 16-27 [doi]
- Declarative Dynamic Programming as an Alternative Realization of Courcelle's TheoremBernhard Bliem, Reinhard Pichler, Stefan Woltran. 28-40 [doi]
- The Fine Details of Fast Dynamic Programming over Tree DecompositionsHans L. Bodlaender, Paul Bonsma, Daniel Lokshtanov. 41-53 [doi]
- On Subexponential and FPT-Time InapproximabilityEdouard Bonnet, Bruno Escoffier, Eun Jung Kim 0002, Vangelis Th. Paschos. 54-65 [doi]
- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for ParameterizationEdouard Bonnet, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire. 66-77 [doi]
- Chain Minors Are FPTJaroslaw Blasiok, Marcin Kaminski. 78-83 [doi]
- Incompressibility of H-Free Edge ModificationLeizhen Cai, Yufei Cai. 84-96 [doi]
- Contracting Few Edges to Remove Forbidden Induced SubgraphsLeizhen Cai, Chengwei Guo. 97-109 [doi]
- Fixed-Parameter and Approximation Algorithms: A New LookRajesh Hemant Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz. 110-122 [doi]
- Subgraphs Satisfying MSO Properties on z-Topologically Orderable DigraphsMateus de Oliveira Oliveira. 123-136 [doi]
- Computing Tree-Depth Faster Than 2 nFedor V. Fomin, Archontia C. Giannopoulou, Michal Pilipczuk. 137-149 [doi]
- Faster Exact Algorithms for Some Terminal Set ProblemsRajesh Hemant Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh. 150-162 [doi]
- Parameterized Algorithms for Modular-WidthJakub Gajarský, Michael Lampis, Sebastian Ordyniak. 163-176 [doi]
- A Faster FPT Algorithm for Bipartite ContractionSylvain Guillemot, Dániel Marx. 177-188 [doi]
- On the Ordered List Subgraph Embedding ProblemsOlawale Hassan, Iyad A. Kanj, Daniel Lokshtanov, Ljubomir Perkovic. 189-201 [doi]
- A Completeness Theory for Polynomial (Turing) KernelizationDanny Hermelin, Stefan Kratsch, Karolina Soltys, Magnus Wahlström, Xi Wu. 202-215 [doi]
- On Sparsification for Computing TreewidthBart M. P. Jansen. 216-229 [doi]
- The Jump Number Problem: Exact and ParameterizedDieter Kratsch, Stefan Kratsch. 230-242 [doi]
- On the Hardness of Eliminating Small Induced Subgraphs by Contracting EdgesDaniel Lokshtanov, Neeldhara Misra, Saket Saurabh. 243-254 [doi]
- Hardness of r-dominating set on Graphs of Diameter (r + 1)Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, M. S. Ramanujan, Saket Saurabh. 255-267 [doi]
- Amalgam Width of MatroidsLukás Mach, Tomas Toufar. 268-280 [doi]
- On the Parameterized Complexity of Reconfiguration ProblemsAmer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki. 281-294 [doi]
- FPT Algorithms for Consecutive Ones Submatrix ProblemsN. S. Narayanaswamy, R. Subashini. 295-307 [doi]
- Upper Bounds on Boolean-Width with Applications to Exact AlgorithmsYuri Rabinovich, Jan Arne Telle, Martin Vatshelle. 308-320 [doi]
- Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree DecompositionsStefan Fafianie, Hans L. Bodlaender, Jesper Nederlof. 321-334 [doi]
- Completeness Results for Parameterized Space ClassesChristoph Stockhusen, Till Tantau. 335-347 [doi]
- Treewidth and Pure Nash EquilibriaAntonis Thomas, Jan van Leeuwen. 348-360 [doi]
- Algorithms for k-Internal Out-BranchingMeirav Zehavi. 361-373 [doi]