Abstract is missing.
- On Multiway Cut Parameterized above Lower BoundsMarek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk. 1-12 [doi]
- Parameterized Complexity of Firefighting RevisitedMarek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen. 13-26 [doi]
- Parameterized Complexity in Multiple-Interval Graphs: DominationMinghui Jiang, Yong Zhang. 27-40 [doi]
- A Faster Algorithm for Dominating Set Analyzed by the Potential MethodYoichi Iwata. 41-54 [doi]
- Contracting Graphs to Paths and TreesPinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul. 55-66 [doi]
- Increasing the Minimum Degree of a Graph by ContractionsPetr A. Golovach, Marcin Kaminski, Daniël Paulusma, Dimitrios M. Thilikos. 67-79 [doi]
- Planar Disjoint-Paths CompletionIsolde Adler, Stavros G. Kolliopoulos, Dimitrios M. Thilikos. 80-93 [doi]
- Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group TestingPeter Damaschke. 94-105 [doi]
- New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable DegreeAlexander Golovnev. 106-117 [doi]
- Improved Parameterized Algorithms for above Average Constraint SatisfactionEun Jung Kim 0002, Ryan Williams. 118-131 [doi]
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle TransversalBart M. P. Jansen, Stefan Kratsch. 132-144 [doi]
- Kernel Bounds for Path and Cycle ProblemsHans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch. 145-158 [doi]
- On the Hardness of Losing WidthMarek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh. 159-168 [doi]
- Safe Approximation and Its Relation to KernelizationJiong Guo, Iyad A. Kanj, Stefan Kratsch. 169-180 [doi]
- Simpler Linear-Time Kernelization for Planar Dominating SetTorben Hagerup. 181-193 [doi]
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar GraphsRené van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, Mathias Weller. 194-206 [doi]
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-WidthHajo Broersma, Petr A. Golovach, Viresh Patel. 207-218 [doi]
- Finding Good Decompositions for Dynamic Programming on Dense GraphsEivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, Martin Vatshelle. 219-231 [doi]
- Parameterized Maximum Path ColoringMichael Lampis. 232-245 [doi]
- On Cutwidth Parameterized by Vertex CoverMarek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh. 246-258 [doi]
- Twin-Cover: Beyond Vertex Cover in Parameterized AlgorithmicsRobert Ganian. 259-271 [doi]