Parameterized and Exact Computation [electronic resource] : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 1011, 2009, Revised Selected Papers / edited by Jianer Chen, Fedor V. Fomin.
 Edition:
 1st ed. 2009.
 Publication:
 Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
 Series:
 Computer Science (Springer11645)
LNCS sublibrary. Theoretical computer science and general issues SL 1, 5917
Theoretical Computer Science and General Issues ; 5917  Format/Description:
 Book
1 online resource (X, 335 pages) : 26 illustrations  Subjects:
 Computer programming.
Discrete mathematics.
Computer scienceMathematics.
Algorithms.  Local subjects:
 Programming Techniques. (search)
Discrete Mathematics. (search)
Mathematics of Computing. (search)
Algorithm Analysis and Problem Complexity. (search)
Algorithms. (search)
Discrete Mathematics in Computer Science. (search)  System Details:
 text file PDF
 Contents:
 Balanced Hashing, Color Coding and Approximate Counting
Kernelization: New Upper and Lower Bound Techniques
A Faster FixedParameter Approach to Drawing Binary Tanglegrams
Planar Capacitated Dominating Set Is W[1]Hard
BooleanWidth of Graphs
The Complexity of Satisfiability of Small Depth Circuits
On Finding Directed Trees with Many Leaves
BoundedDegree Techniques Accelerate Some Parameterized Graph Algorithms
Pareto Complexity of TwoParameter FPT Problems: A Case Study for Partial Vertex Cover
What Makes Equitable Connected Partition Easy
Improved Induced Matchings in Sparse Graphs
WellQuasiOrders in Subclasses of Bounded Treewidth Graphs
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
An Exponential Time 2Approximation 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
FixedParameter 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 DegreePreserving 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 .  Contributor:
 Chen, Jianer. editor., Editor,
Fomin, Fedor V. editor., Editor,
SpringerLink (Online service)  Contained In:
 Springer eBooks
 Other format:
 Printed edition:
Printed edition:  ISBN:
 9783642112690
9783642112690  Publisher Number:
 10.1007/9783642112690 doi
 Access Restriction:
 Restricted for use by site license.

Loading...
Location  Notes  Your Loan Policy 

Description  Status  Barcode  Your Loan Policy 
