Abstract is missing.
- Lower Bounds for KernelizationHans L. Bodlaender. 1-14 [doi]
- On the Parameterized Complexity of Associative and Commutative UnificationTatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura. 15-27 [doi]
- H -free Edge DeletionN. R. Aravind, R. B. Sandeep, Naveen Sivadasan. 28-38 [doi]
- Solving Linear Equations Parameterized by Hamming WeightVikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán. 39-50 [doi]
- The Parameterized Complexity of Geometric Graph IsomorphismVikraman Arvind, Gaurav Rattan. 51-62 [doi]
- The Role of Planarity in Connectivity Problems Parameterized by TreewidthJulien Baste, Ignasi Sau. 63-74 [doi]
- Parameterized Inapproximability of Degree AnonymizationCristina Bazgan, André Nichterlein. 75-84 [doi]
- The k -Distinct Language: Parameterized Automata ConstructionsRan Ben-Basat, Ariel Gabizon, Meirav Zehavi. 85-96 [doi]
- A 14k -Kernel for Planar Feedback Vertex Set via Region DecompositionMarthe Bonamy, Lukasz Kowalik. 97-109 [doi]
- The Complexity of Bounded Length Graph Recoloring and CSP ReconfigurationPaul Bonsma, Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman. 110-121 [doi]
- Quantified Conjunctive Queries on Partially Ordered SetsSimone Bova, Robert Ganian, Stefan Szeider. 122-134 [doi]
- Graph Isomorphism Parameterized by Elimination Distance to Bounded DegreeJannis Bulian, Anuj Dawar. 135-146 [doi]
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum SizeMathieu Chapelle, Manfred Cochefert, Dieter Kratsch, Romain Letourneur, Mathieu Liedloff. 147-158 [doi]
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)Rajesh Hemant Chitnis, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Saeed Seddighin. 159-171 [doi]
- The Firefighter Problem: A Structural AnalysisJanka Chlebíková, Morgan Chopin. 172-183 [doi]
- AND-compression of NP-complete Problems: Streamlined Proof and Minor ObservationsHolger Dell. 184-195 [doi]
- Editing to a Graph of Given DegreesPetr A. Golovach. 196-207 [doi]
- Polynomial Kernels and User Reductions for the Workflow Satisfiability ProblemGregory Gutin, Stefan Kratsch, Magnus Wahlström. 208-220 [doi]
- Finding Shortest Paths Between Graph ColouringsMatthew Johnson 0002, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma. 221-233 [doi]
- Shortest Paths in Nearly Conservative DigraphsZoltán Király. 234-245 [doi]
- Reconfiguration over Tree DecompositionsAmer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna. 246-257 [doi]
- Finite Integer Index of Pathwidth and TreewidthJakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sanchez Villaamil, Somnath Sikdar. 258-269 [doi]
- A Parameterized Study of Maximum Generalized Pattern Matching ProblemsSebastian Ordyniak, Alexandru Popa. 270-281 [doi]
- Improved FPT Algorithms for Weighted Independent Set in Bull-Free GraphsHenri Perret du Cray, Ignasi Sau. 282-293 [doi]
- Improved Parameterized Algorithms for Network Query ProblemsRon Y. Pinter, Hadas Shachnai, Meirav Zehavi. 294-306 [doi]
- On Kernels for Covering and Packing ILPs with Small CoefficientsStefan Kratsch, Vuong Anh Quyen. 307-318 [doi]
- No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded TreewidthIgor Razgon. 319-331 [doi]
- The Relative Exponential Time Complexity of Approximate Counting Satisfying AssignmentsPatrick Traxler. 332-341 [doi]