Abstract is missing.
- Applying Modular Decomposition to Parameterized Bicluster EditingFábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter. 1-12 [doi]
- The Cluster Editing Problem: Implementations and ExperimentsFrank K. H. A. Dehne, Michael A. Langston, Xuemei Luo, Sylvain Pitre, Peter Shaw, Yun Zhang. 13-24 [doi]
- The Parameterized Complexity of Maximality and Minimality ProblemsYijia Chen, Jörg Flum. 25-37 [doi]
- Parameterizing MAX SNP Problems Above Guaranteed ValuesMeena Mahajan, Venkatesh Raman, Somnath Sikdar. 38-49 [doi]
- Randomized Approximations of Parameterized Counting ProblemsMoritz Müller. 50-59 [doi]
- Fixed-Parameter Complexity of Minimum Profile ProblemsGregory Gutin, Stefan Szeider, Anders Yeo. 60-71 [doi]
- On the OBDD Size for Graphs of Bounded Tree- and Clique-WidthKlaus Meer, Dieter Rautenbach. 72-83 [doi]
- Greedy Localization and Color-Coding: Improved Matching and Packing AlgorithmsYang Liu 0002, Songjian Lu, Jianer Chen, Sing-Hoi Sze. 84-95 [doi]
- Fixed-Parameter Approximation: Conceptual Framework and Approximability ResultsLiming Cai, Xiuzhen Huang. 96-108 [doi]
- On Parameterized ApproximabilityYijia Chen, Martin Grohe, Magdalena Grüber. 109-120 [doi]
- Parameterized Approximation ProblemsRodney G. Downey, Michael R. Fellows, Catherine McCartin. 121-129 [doi]
- An Exact Algorithm for the Minimum Dominating Clique ProblemDieter Kratsch, Mathieu Liedloff. 130-141 [doi]
- edge dominating set: Efficient Enumeration-Based Exact AlgorithmsHenning Fernau. 142-153 [doi]
- Parameterized Complexity of Independence and Domination on Geometric GraphsDániel Marx. 154-165 [doi]
- Fixed Parameter Tractability of Independent Set in Segment Intersection GraphsJan Kára, Jan Kratochvíl. 166-174 [doi]
- On the Parameterized Complexity of ::::d::::-Dimensional Point Set Pattern MatchingSergio Cabello, Panos Giannopoulos, Christian Knauer. 175-183 [doi]
- Finding a Minimum Feedback Vertex Set in Time ::::O:::: (1.7548:::::::n:::::::)Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin. 184-191 [doi]
- The Undirected Feedback Vertex Set Problem Has a Poly(::::k::::) KernelKevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond. 192-202 [doi]
- Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its DualJiong Guo, Rolf Niedermeier, Sebastian Wernicke. 203-214 [doi]
- On the Effective Enumerability of NP ProblemsJianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang. 215-226 [doi]
- The Parameterized Complexity of Enumerating Frequent ItemsetsMatthew Hamilton, Rhonda Chaytor, Todd Wareham. 227-238 [doi]
- Random Separation: A New Method for Solving Fixed-Cardinality Optimization ProblemsLeizhen Cai, Siu Man Chan, Siu On Chan. 239-250 [doi]
- Towards a Taxonomy of Techniques for Designing Parameterized AlgorithmsChristian Sloper, Jan Arne Telle. 251-263 [doi]
- Kernels: Annotated, Proper and InducedFaisal N. Abu-Khzam, Henning Fernau. 264-275 [doi]
- The Lost Continent of Polynomial Time: Preprocessing and KernelizationMichael R. Fellows. 276-277 [doi]
- FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard ProblemsFrank K. H. A. Dehne. 278 [doi]