LEADER 03739nam 2200637Ia 450 001 9910484324703321 005 20200520144314.0 010 $a3-642-11269-2 024 7 $a10.1007/978-3-642-11269-0 035 $a(CKB)1000000000812689 035 $a(SSID)ssj0000355582 035 $a(PQKBManifestationID)11256494 035 $a(PQKBTitleCode)TC0000355582 035 $a(PQKBWorkID)10320801 035 $a(PQKB)11124403 035 $a(DE-He213)978-3-642-11269-0 035 $a(MiAaPQ)EBC3064904 035 $a(PPN)139963073 035 $a(EXLCZ)991000000000812689 100 $a20100209d2009 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aParameterized and exact computation $e4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers /$fJianer Chen, Fedor V. Fomin (Eds.) 205 $a1st ed. 2009. 210 $aBerlin ;$aHeidelberg $cSpringer-Verlag$dc2009 215 $a1 online resource (X, 335 p. 26 illus.) 225 1 $aLecture notes in computer science ;$v5917 300 $aIncludes index. 311 $a3-642-11268-4 327 $aBalanced 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 . 410 0$aLecture notes in computer science ;$v5917. 606 $aParameter estimation$vCongresses 606 $aComputer algorithms$vCongresses 606 $aComputational intelligence$vCongresses 606 $aMachine learning$vCongresses 615 0$aParameter estimation 615 0$aComputer algorithms 615 0$aComputational intelligence 615 0$aMachine learning 676 $a519.544 686 $a004$2sdnb 686 $aDAT 517f$2stub 686 $aSS 4800$2rvk 701 $aChen$b Jianer$01750514 701 $aFomin$b Fedor V$01750515 712 12$aIWPEC 2009 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484324703321 996 $aParameterized and exact computation$94185159 997 $aUNINA