Parameterized and Exact Computation: Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings (Lecture Notes in Computer Science, 4169)

✍ Scribed by Hans L. Bodlaender

• Publisher: Springer
• Year: 2006
• Tongue: English
• Leaves: 289
• Category: Library

✦ Synopsis

The Second International Workshop on Parameterized and Exact Computation (IWPEC) was held in Zu ¨rich, Switzerland, during September 13–15, 2006. It th was organized as a component of ALGO 2006, which also hosted the 14 - th nual European Symposium on Algorithms, the 6 Workshop on Algorithms in th Bioinformatics, the 4 Workshop on Approximation and Online Algorithms, th and the 6 Workshop on Algorithmic Methods and Models for Optimization of Railways. This meeting was the second in the IWPEC series, with the ?rst having been held in Bergen, Norway, during September 14–16, 2004. The ?eld continues to experience rapid growth, in part due to its appeal as an alternative to tra- tional complexity theory, and in part due to the powerful practical applications it has spawned. IWPEC events are intended to cover research in all aspects of parameterizedand exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact al- rithms, parameterized complexity theory, relationships between parameterized complexity and traditional complexity, applications of parameterized and exact computation, implementation issues and high-performance computing. A major goal is to disseminate the latest research results, including signi?cant work-- progress, and to identify, de?ne and explore directions for future study. The papers accepted for presentation and printed in these proceedings rep- sent a diverse spectrum of the latest developments on parameterized and exact algorithm design, analysis, application and implementation.

✦ Table of Contents

Frontmatter
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
{\sc 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 {\itshape d}-Dimensional Point Set Pattern Matching
Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
The Undirected Feedback Vertex Set Problem Has a Poly({\itshape 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
Backmatter