LEADER 06091nam 22007935 450 001 9910484999503321 005 20230406032431.0 010 $a3-642-10217-4 024 7 $a10.1007/978-3-642-10217-2 035 $a(CKB)1000000000804418 035 $a(SSID)ssj0000355456 035 $a(PQKBManifestationID)11294236 035 $a(PQKBTitleCode)TC0000355456 035 $a(PQKBWorkID)10340889 035 $a(PQKB)11159030 035 $a(DE-He213)978-3-642-10217-2 035 $a(MiAaPQ)EBC3064769 035 $a(PPN)139962557 035 $a(EXLCZ)991000000000804418 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Algorithms$b[electronic resource] $e20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28--July 2, 2009, Revised Selected Papers /$fedited by Jiri Fiala, Jan Kratochvil, Mirka Miller 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XII, 480 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5874 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-10216-6 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- Branching Systems -- Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology -- Succinct Representations of Trees -- Kt Minors in Large t-Connected Graphs -- Intractability in Graph Drawing and Geometry: FPT Approaches -- Contributed Talks -- Evaluation of Recoverable-Robust Timetables on Tree Networks -- Weighted LCS -- Integrality Properties of Certain Special Balanceable Families -- Forbidden Subgraph Colorings and the Oriented Chromatic Number -- Polynomial Kernels for 3-Leaf Power Graph Modification Problems -- Approximating the Max Edge-Coloring Problem -- Three Complexity Results on Coloring P k -Free Graphs -- Fully Decomposable Split Graphs -- Feedback Vertex Set on Graphs of Low Cliquewidth -- Note on Decomposition of K n,n into (0,j)-prisms -- Edge-Simple Circuits through 10 Ordered Vertices in Square Grids -- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search -- LPF Computation Revisited -- Limiting Distribution for Distances in k-Trees -- Gray Code Compression -- Embedded Trees and the Support of the ISE -- Combinatorial Models for Cooperation Networks -- Polar Permutation Graphs -- A New Algorithm for Efficient Pattern Matching with Swaps -- The Height and Range of Watermelons without Wall -- Fast Convolutions and Their Applications in Approximate String Matching -- Better Polynomial Algorithms on Graphs of Bounded Rank-Width -- Minimax Trees in Linear Time with Applications -- Planar Biconnectivity Augmentation with Fixed Embedding -- Trivially-Perfect Width -- Lightweight Parameterized Suffix Array Construction -- On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices -- Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees -- On the Maximal Number of Cubic Subwords in a String -- Solution of Peter Winkler?s Pizza Problem -- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs -- Simpler Parameterized Algorithm for OCT -- Bipartite Graphs of Large Clique-Width -- Kernel in Oriented Circulant Graphs -- Randomized Postoptimization of Covering Arrays -- New Word-Based Adaptive Dense Compressors -- Rainbow Connection in Graphs with Minimum Degree Three -- The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree -- Computability of Width of Submodular Partition Functions -- The Guarding Problem ? Complexity and Approximation -- Antibandwidth of d-Dimensional Meshes. 330 $aThis book constitutes the revised selected papers of the 20th International Workshop on Combinatorial Algorithms, held in June/July 2009 in the castle of Hradec nad Moravicí, Czech Republic. The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5874 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aMachine theory 606 $aCoding theory 606 $aInformation theory 606 $aDiscrete Mathematics in Computer Science 606 $aDiscrete Mathematics 606 $aAlgorithms 606 $aFormal Languages and Automata Theory 606 $aCoding and Information Theory 606 $aSymbolic and Algebraic Manipulation 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aCoding theory. 615 0$aInformation theory. 615 14$aDiscrete Mathematics in Computer Science. 615 24$aDiscrete Mathematics. 615 24$aAlgorithms. 615 24$aFormal Languages and Automata Theory. 615 24$aCoding and Information Theory. 615 24$aSymbolic and Algebraic Manipulation. 676 $a005.1 702 $aFiala$b Jiri$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKratochvil$b Jan$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMiller$b Mirka$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Workshop on Combinatorial Algorithms 906 $aBOOK 912 $a9910484999503321 996 $aCombinatorial Algorithms$92868813 997 $aUNINA