Parameterized and Exact Computation  4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers /  [electronic resource] : 
edited by Jianer Chen, Fedor V. Fomin. 
 - 1st ed. 2009. 
 - X, 335 p. 26 illus.  online resource. 
 - Theoretical Computer Science and General Issues,  5917  2512-2029 ; .
 - Theoretical Computer Science and General Issues,  5917 .
<br/><br/>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 . 
<br/><br/><label>ISBN: </label>9783642112690 
<br/><br/><label>Standard No.: </label>10.1007/978-3-642-11269-0  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer programming.<br/>Discrete mathematics.<br/>Computer science--Mathematics.<br/>Algorithms.<br/>Programming Techniques.<br/>Discrete Mathematics.<br/>Mathematics of Computing.<br/>Algorithms.<br/>Discrete Mathematics in Computer Science.
<br/><br/><label>LC Class. No.: </label>QA76.6-76.66 
<br/><br/><label>Dewey Class. No.: </label>005.11