LEADER 05839nam 22006975 450 001 996466007703316 005 20230406064256.0 010 $a3-540-39101-0 024 7 $a10.1007/11847250 035 $a(CKB)1000000000283957 035 $a(SSID)ssj0000319340 035 $a(PQKBManifestationID)11265240 035 $a(PQKBTitleCode)TC0000319340 035 $a(PQKBWorkID)10354357 035 $a(PQKB)10710016 035 $a(DE-He213)978-3-540-39101-2 035 $a(MiAaPQ)EBC3068259 035 $a(PPN)123138000 035 $a(EXLCZ)991000000000283957 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aParameterized and Exact Computation$b[electronic resource] $eSecond International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings /$fedited by Hans L. Bodlaender, Michael A. Langston 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XI, 279 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4169 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-39098-7 320 $aIncludes bibliographical references and index. 327 $aApplying Modular Decomposition to Parameterized Bicluster Editing -- The Cluster Editing Problem: Implementations and Experiments -- The Parameterized Complexity of Maximality and Minimality Problems -- Parameterizing MAX SNP Problems Above Guaranteed Values -- Randomized Approximations of Parameterized Counting Problems -- Fixed-Parameter Complexity of Minimum Profile Problems -- On the OBDD Size for Graphs of Bounded Tree- and Clique-Width -- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms -- Fixed-Parameter Approximation: Conceptual Framework and Approximability Results -- On Parameterized Approximability -- Parameterized Approximation Problems -- An Exact Algorithm for the Minimum Dominating Clique Problem -- edge dominating set: Efficient Enumeration-Based Exact Algorithms -- Parameterized Complexity of Independence and Domination on Geometric Graphs -- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs -- On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching -- Finding a Minimum Feedback Vertex Set in Time -- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel -- Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual -- On the Effective Enumerability of NP Problems -- The Parameterized Complexity of Enumerating Frequent Itemsets -- Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems -- Towards a Taxonomy of Techniques for Designing Parameterized Algorithms -- Kernels: Annotated, Proper and Induced -- The Lost Continent of Polynomial Time: Preprocessing and Kernelization -- FPT at Work: Using Fixed Parameter Tractability to Solve Larger Instances of Hard Problems. 330 $aThe Second International Workshop on Parameterized and Exact Computation (IWPEC) was held in Zu ¨rich, Switzerland, during September 13?15, 2006. It th was organized as a component of ALGO 2006, which also hosted the 14 - th nual European Symposium on Algorithms, the 6 Workshop on Algorithms in th Bioinformatics, the 4 Workshop on Approximation and Online Algorithms, th and the 6 Workshop on Algorithmic Methods and Models for Optimization of Railways. This meeting was the second in the IWPEC series, with the ?rst having been held in Bergen, Norway, during September 14?16, 2004. The ?eld continues to experience rapid growth, in part due to its appeal as an alternative to tra- tional complexity theory, and in part due to the powerful practical applications it has spawned. IWPEC events are intended to cover research in all aspects of parameterizedand exact computation and complexity, including but not limited to new techniques for the design and analysis of parameterized and exact al- rithms, parameterized complexity theory, relationships between parameterized complexity and traditional complexity, applications of parameterized and exact computation, implementation issues and high-performance computing. A major goal is to disseminate the latest research results, including signi?cant work-- progress, and to identify, de?ne and explore directions for future study. The papers accepted for presentation and printed in these proceedings rep- sent a diverse spectrum of the latest developments on parameterized and exact algorithm design, analysis, application and implementation. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4169 606 $aAlgorithms 606 $aComputer science 606 $aArtificial intelligence?Data processing 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aTheory of Computation 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 615 0$aAlgorithms. 615 0$aComputer science. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aAlgorithms. 615 24$aTheory of Computation. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 676 $a519.5/44 702 $aBodlaender$b Hans L$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLangston$b Michael A$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466007703316 996 $aParameterized and Exact Computation$9772030 997 $aUNISA