Parameterized and Exact Computation Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Bodlaender, Hans L. (Επιμελητής έκδοσης), Langston, Michael A. (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
• Σειρά: Lecture Notes in Computer Science, 4169
• Θέματα: Computer science.; Data structures (Computer science).; Computers.; Algorithms.; Computer science > Mathematics.; Computer Science.; Algorithm Analysis and Problem Complexity.; Computation by Abstract Devices.; Data Structures.; Discrete Mathematics in Computer Science.

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 B...

Πίνακας περιεχομένων:

• 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.