Parameterized and Exact Computation

Here are the refereed proceedings of the Second International Workshop on Parameterized and Exact Computation, IWPEC 2006, held in the context of the combined conference ALGO 2006. The book presents 23 revised full papers together with 2 invited lectures. Coverage includes research in all aspects of parameterized and exact computation and complexity, including new techniques for the design and analysis of parameterized and exact algorithms, parameterized complexity theory, and more.

Applying Modular Decomposition to Parameterized Bicluster Editing.- The Cluster Editing Problem: Implementations and Experiments.- The Parameterized Complexity of Maximality and Minimality Problems.- Parameterizing MAX SNP Problems Above Guaranteed Values.- Randomized Approximations of Parameterized Counting Problems.- Fixed-Parameter Complexity of Minimum Profile Problems.- On the OBDD Size for Graphs of Bounded Tree- and Clique-Width.- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms.- Fixed-Parameter Approximation: Conceptual Framework and Approximability Results.- On Parameterized Approximability.- Parameterized Approximation Problems.- An Exact Algorithm for the Minimum Dominating Clique Problem.- edge dominating set: Efficient Enumeration-Based Exact Algorithms.- Parameterized Complexity of Independence and Domination on Geometric Graphs.- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs.- On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching.- Finding a Minimum Feedback Vertex Set in Time .- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel.- Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual.- On the Effective Enumerability of NP Problems.- The Parameterized Complexity of Enumerating Frequent Itemsets.- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems.- Towards a Taxonomy of Techniques for Designing Parameterized Algorithms.- Kernels: Annotated, Proper and Induced.- The Lost Continent of Polynomial Time: Preprocessing and Kernelization.- FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard Problems.