Abstract is missing.
- Balanced Hashing, Color Coding and Approximate CountingNoga Alon, Shai Gutner. 1-16 [doi]
- Kernelization: New Upper and Lower Bound TechniquesHans L. Bodlaender. 17-37 [doi]
- A Faster Fixed-Parameter Approach to Drawing Binary TanglegramsSebastian Böcker, Falk Hüffner, Anke Truß, Magnus Wahlström. 38-49 [doi]
- Planar Capacitated Dominating Set Is ::::W::::[1]-HardHans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx. 50-60 [doi]
- Boolean-Width of GraphsBinh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle. 61-74 [doi]
- The Complexity of Satisfiability of Small Depth CircuitsChris Calabro, Russell Impagliazzo, Ramamohan Paturi. 75-85 [doi]
- On Finding Directed Trees with Many LeavesJean Daligault, Stéphan Thomassé. 86-97 [doi]
- Bounded-Degree Techniques Accelerate Some Parameterized Graph AlgorithmsPeter Damaschke. 98-109 [doi]
- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex CoverPeter Damaschke. 110-121 [doi]
- What Makes Equitable Connected Partition EasyRosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý. 122-133 [doi]
- Improved Induced Matchings in Sparse GraphsRok Erman, Lukasz Kowalik, Matjaz Krnc, Tomasz Walen. 134-148 [doi]
- Well-Quasi-Orders in Subclasses of Bounded Treewidth GraphsMichael R. Fellows, Danny Hermelin, Frances A. Rosamond. 149-160 [doi]
- An Exact Algorithm for the Maximum Leaf Spanning Tree ProblemHenning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Daniel Raible, Peter Rossmanith. 161-172 [doi]
- An Exponential Time 2-Approximation Algorithm for BandwidthMartin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan. 173-184 [doi]
- On Digraph Width Measures in Parameterized AlgorithmicsRobert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith. 185-197 [doi]
- The Parameterized Complexity of Some Geometric Problems in Unbounded DimensionPanos Giannopoulos, Christian Knauer, Günter Rote. 198-209 [doi]
- Paths of Bounded Length and Their Cuts: Parameterized Complexity and AlgorithmsPetr A. Golovach, Dimitrios M. Thilikos. 210-221 [doi]
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear ProgramsGregory Gutin, Daniel Karapetyan, Igor Razgon. 222-233 [doi]
- A Probabilistic Approach to Problems Parameterized above or below Tight BoundsGregory Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo. 234-245 [doi]
- Partitioning into Sets of Bounded CardinalityMikko Koivisto. 258-263 [doi]
- Two Edge Modification Problems without Polynomial KernelsStefan Kratsch, Magnus Wahlström. 264-275 [doi]
- On the Directed Degree-Preserving Spanning Tree ProblemDaniel Lokshtanov, Venkatesh Raman, Saket Saurabh, Somnath Sikdar. 276-287 [doi]
- Even Faster Algorithm for Set Splitting!Daniel Lokshtanov, Saket Saurabh. 288-299 [doi]
- Stable Assignment with Couples: Parameterized Complexity and Local SearchDániel Marx, Ildikó Schlotter. 300-311 [doi]
- Improved Parameterized Algorithms for the Kemeny Aggregation ProblemNarges Simjour. 312-323 [doi]
- Computing Pathwidth Faster Than 2:::::::n:::::::Karol Suchan, Yngve Villanger. 324-335 [doi]