03739nam 2200637Ia 450 991048432470332120200520144314.03-642-11269-210.1007/978-3-642-11269-0(CKB)1000000000812689(SSID)ssj0000355582(PQKBManifestationID)11256494(PQKBTitleCode)TC0000355582(PQKBWorkID)10320801(PQKB)11124403(DE-He213)978-3-642-11269-0(MiAaPQ)EBC3064904(PPN)139963073(EXLCZ)99100000000081268920100209d2009 uy 0engurnn|008mamaatxtccrParameterized and exact computation 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers /Jianer Chen, Fedor V. Fomin (Eds.)1st ed. 2009.Berlin ;Heidelberg Springer-Verlagc20091 online resource (X, 335 p. 26 illus.) Lecture notes in computer science ;5917Includes index.3-642-11268-4 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 .Lecture notes in computer science ;5917.Parameter estimationCongressesComputer algorithmsCongressesComputational intelligenceCongressesMachine learningCongressesParameter estimationComputer algorithmsComputational intelligenceMachine learning519.544004sdnbDAT 517fstubSS 4800rvkChen Jianer1750514Fomin Fedor V1750515IWPEC 2009MiAaPQMiAaPQMiAaPQBOOK9910484324703321Parameterized and exact computation4185159UNINA