Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selecte by Jianer ChenParameterized and Exact Computation: 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selecte by Jianer Chen

Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009, Copenhagen, Denmark…

byJianer ChenEditorFedor V. Fomin

Paperback | January 8, 2010

Pricing and Purchase Info

$113.12 online 
$124.50 list price save 9%
Earn 566 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed best selected papers of the 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009, held in Copenhagen, Denmark, in September 2009.The 25 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 52 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized and exact computation, implementation issues of parameterized and exact algorithms, high-performance computing and fixed-parameter tractability.
Title:Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009, Copenhagen, Denmark…Format:PaperbackDimensions:335 pagesPublished:January 8, 2010Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642112684

ISBN - 13:9783642112683

Look for similar items by category:

Reviews

Table of Contents

Balanced Hashing, Color Coding and Approximate Counting.- Kernelization: New Upper and Lower Bound Techniques.- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams.- Planar Capacitated Dominating Set Is W[1]-Hard.- Boolean-Width of Graphs.- The Complexity of Satisfiability of Small Depth Circuits.- On Finding Directed Trees with Many Leaves.- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms.- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover.- What Makes Equitable Connected Partition Easy.- Improved Induced Matchings in Sparse Graphs.- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs.- An Exact Algorithm for the Maximum Leaf Spanning Tree Problem.- An Exponential Time 2-Approximation Algorithm for Bandwidth.- On Digraph Width Measures in Parameterized Algorithmics.- The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension.- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms.- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs.- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds.- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor.- Partitioning into Sets of Bounded Cardinality.- Two Edge Modification Problems without Polynomial Kernels.- On the Directed Degree-Preserving Spanning Tree Problem.- Even Faster Algorithm for Set Splitting!.- Stable Assignment with Couples: Parameterized Complexity and Local Search.- Improved Parameterized Algorithms for the Kemeny Aggregation Problem.- Computing Pathwidth Faster Than 2 n .