LEADER 04632nam 22008175 450 001 996465319103316 005 20230406052645.0 010 $a3-540-79723-8 024 7 $a10.1007/978-3-540-79723-4 035 $a(CKB)1000000000440627 035 $a(SSID)ssj0000319341 035 $a(PQKBManifestationID)11256974 035 $a(PQKBTitleCode)TC0000319341 035 $a(PQKBWorkID)10338406 035 $a(PQKB)10244623 035 $a(DE-He213)978-3-540-79723-4 035 $a(MiAaPQ)EBC4975642 035 $a(MiAaPQ)EBC5577216 035 $a(MiAaPQ)EBC6511694 035 $a(Au-PeEL)EBL4975642 035 $a(CaONFJC)MIL185524 035 $a(OCoLC)1024244816 035 $a(Au-PeEL)EBL5577216 035 $a(OCoLC)272306830 035 $a(Au-PeEL)EBL6511694 035 $a(PPN)127049495 035 $a(EXLCZ)991000000000440627 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aParameterized and Exact Computation$b[electronic resource] $eThird International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008, Proceedings /$fedited by Martin Grohe, Rolf Niedermeier 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (X, 227 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5018 300 $aIncludes index. 311 $a3-540-79722-X 327 $aRandomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters -- Algorithmic Graph Minors and Bidimensionality -- Algorithmic Meta-theorems -- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem -- Fixed Structure Complexity -- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees -- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs -- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem -- Capacitated Domination and Covering: A Parameterized Perspective -- Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems -- A Purely Democratic Characterization of W[1] -- Parameterized Complexity and Approximability of the SLCS Problem -- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs -- Wheel-Free Deletion Is W[2]-Hard -- Parameterized Derandomization -- A Linear Kernel for Planar Feedback Vertex Set -- Parameterized Chess -- The Time Complexity of Constraint Satisfaction -- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances -- Exact Algorithms for Edge Domination. 330 $aThis book constitutes the refereed proceedings of the Third International Workshop on Parameterized and Exact Computation, IWPEC 2008, held in Victoria, Canada, in May 2008 - co-located with the 40th ACM Symposium on Theory of Computing, STOC 2008. The 17 revised full papers presented together with 3 invited lectures were carefully reviewed and selected from 32 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact algorithms, parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications, applications of parameterized computation, implementation and experiments, high-performance computing and fixed-parameter tractability. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5018 606 $aComputer science 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aTheory of Computation 606 $aAlgorithms 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 676 $a530.11 702 $aNiedermeier$b Rolf 702 $aGrohe$b M. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465319103316 996 $aParameterized and Exact Computation$9772030 997 $aUNISA