Parameterized and Exact Computation [electronic resource] : 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers / edited by Jianer Chen, Fedor V. Fomin.
- 1st ed. 2009.
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
- Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues SL 1, 5917
Theoretical Computer Science and General Issues ; 5917
1 online resource (X, 335 pages) : 26 illustrations
- Computer programming.
- Local subjects:
- Programming Techniques. (search)
Discrete Mathematics. (search)
Mathematics of Computing. (search)
Algorithm Analysis and Problem Complexity. (search)
Discrete Mathematics in Computer Science. (search)
- System Details:
- text file PDF
- 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-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 .
- Chen, Jianer. editor., Editor,
Fomin, Fedor V. editor., Editor,
SpringerLink (Online service)
- Contained In:
- Springer eBooks
- Other format:
- Printed edition:
- Publisher Number:
- 10.1007/978-3-642-11269-0 doi
- Access Restriction:
- Restricted for use by site license.
|Location||Notes||Your Loan Policy|
|Description||Status||Barcode||Your Loan Policy|