LEADER 07541nam 22007815 450 001 9910143857303321 005 20251116234353.0 010 $a3-540-45071-8 024 7 $a10.1007/3-540-45071-8 035 $a(CKB)1000000000212046 035 $a(SSID)ssj0000322170 035 $a(PQKBManifestationID)11234000 035 $a(PQKBTitleCode)TC0000322170 035 $a(PQKBWorkID)10282523 035 $a(PQKB)10383113 035 $a(DE-He213)978-3-540-45071-9 035 $a(MiAaPQ)EBC3071674 035 $a(PPN)155206923 035 $a(BIP)13638275 035 $a(BIP)8789504 035 $a(EXLCZ)991000000000212046 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputing and Combinatorics $e9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings /$fedited by Tandy Warnow, Binhai Zhu 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XIV, 566 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2697 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-40534-8 320 $aIncludes bibliographical references and index. 327 $aInvited Lecture -- LIAR! -- Experiments for Algorithm Engineering -- Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers -- Computational Geometry I -- Cylindrical Hierarchy for Deforming Necklaces -- Geometric Algorithms for Agglomerative Hierarchical Clustering -- Traveling Salesman Problem of Segments -- Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs -- Computational Biology I -- A Space Efficient Algorithm for Sequence Alignment with Inversions -- On the Similarity of Sets of Permutations and Its Applications to Genome Comparison -- On All-Substrings Alignment Problems -- Computational/Complexity Theory I -- The Specker-Blatter Theorem Revisited -- On the Divergence Bounded Computable Real Numbers -- Sparse Parity-Check Matrices over Finite Fields -- Graph Theory/Algorithms I -- On the Full and Bottleneck Full Steiner Tree Problems -- The Structure and Number of Global Roundings of a Graph -- On Even Triangulations of 2-Connected Embedded Graphs -- Automata/Petri Net Theory -- Petri Nets with Simple Circuits -- Automatic Verification of Multi-queue Discrete Timed Automata -- Graph Theory/Algorithms II -- List Total Colorings of Series-Parallel Graphs -- Finding Hidden Independent Sets in Interval Graphs -- Matroid Representation of Clique Complexes -- Complexity Theory II -- On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results -- The Complexity of Boolean Matrix Root Computation -- A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions -- Distributed Computing -- Group Mutual Exclusion Algorithms Based on Ticket Orders -- Distributed Algorithm for Better Approximation of the Maximum Matching -- Efficient Mappings for Parity-Declustered Data Layouts -- Web-Based Computing -- Approximate Rank Aggregation -- Perturbation of the Hyper-Linked Environment -- Fast Construction of Generalized Suffix Trees over a Very Large Alphabet -- Complexity Theory III -- Complexity Theoretic Aspects of Some Cryptographic Functions -- Quantum Sampling for Balanced Allocations -- Graph Theory/Algorithms III -- Fault-Hamiltonicity of Product Graph of Path and Cycle -- How to Obtain the Complete List of Caterpillars -- Randomized Approximation of the Stable Marriage Problem -- Computational Geometry II -- Tetris is Hard, Even to Approximate -- Approximate MST for UDG Locally -- Efficient Construction of Low Weight Bounded Degree Planar Spanner -- Graph Theory/Algorithms IV -- Isoperimetric Inequalities and the Width Parameters of Graphs -- Graph Coloring and the Immersion Order -- Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs -- Scheduling -- Scheduling Broadcasts with Deadlines -- Improved Competitive Algorithms for Online Scheduling with Partial Job Values -- Majority Equilibrium for Public Facility Allocation -- Computational Geometry III -- On Constrained Minimum Pseudotriangulations -- Pairwise Data Clustering and Applications -- Covering a Set of Points with a Minimum Number of Turns -- Graph Drawing -- Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees -- Bounds for Convex Crossing Numbers -- On Spectral Graph Drawing -- Computational Biology II -- On a Conjecture on Wiener Indices in Combinatorial Chemistry -- Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data -- Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences -- Genomic Distances under Deletions and Insertions -- Fixed-Parameter Complexity Theory -- Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. 330 $aThe refereed proceedings of the 9th Annual International Computing and Combinatorics Conference, COCOON 2003, held in Big Sky, MT, USA in July 2003. The 52 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from 114 submissions. The papers are organized in topical sections on computational geometry, computational biology, computability and complexity theory, graph theory and graph algorithms, automata and Petri net theory, distributed computing, Web-based computing, scheduling, graph drawing, and fixed-parameter complexity theory. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2697 606 $aAlgorithms 606 $aComputer networks 606 $aData structures (Computer science) 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aScience, Humanities and Social Sciences, multidisciplinary$3https://scigraph.springernature.com/ontologies/product-market-codes/A11007 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aAlgorithms. 615 0$aComputer networks. 615 0$aData structures (Computer science) 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 14$aAlgorithm Analysis and Problem Complexity. 615 24$aScience, Humanities and Social Sciences, multidisciplinary. 615 24$aComputer Communication Networks. 615 24$aData Structures. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a004 702 $aWarnow$b Tandy$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aZhu$b Binhai$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aCOCOON 2003 906 $aBOOK 912 $a9910143857303321 996 $aComputing and Combinatorics$9772278 997 $aUNINA