000 03982nam a22005535i 4500
001 978-3-540-79723-4
003 DE-He213
005 20160624102119.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 _a9783540797234
_9978-3-540-79723-4
024 7 _a10.1007/978-3-540-79723-4
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aParameterized and Exact Computation
_h[electronic resource] :
_bThird International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings /
_cedited by Martin Grohe, Rolf Niedermeier.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2008.
300 _bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5018
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aAlgorithms.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aData Structures.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aAlgorithms.
700 1 _aGrohe, Martin.
_eeditor.
700 1 _aNiedermeier, Rolf.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540797227
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5018
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-540-79723-4
942 _2EBK8098
_cEBK
999 _c37392
_d37392