06901nam 22008415 450 991014362690332120200701221354.03-540-44968-X10.1007/3-540-44968-X(CKB)1000000000211273(SSID)ssj0000322167(PQKBManifestationID)11233019(PQKBTitleCode)TC0000322167(PQKBWorkID)10282619(PQKB)11737982(DE-He213)978-3-540-44968-3(MiAaPQ)EBC3072968(PPN)155189387(EXLCZ)99100000000021127320121227d2000 u| 0engurnn|008mamaatxtccrComputing and Combinatorics 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings /edited by Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma1st ed. 2000.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2000.1 online resource (XII, 478 p.) Lecture Notes in Computer Science,0302-9743 ;1858Bibliographic Level Mode of Issuance: Monograph3-540-67787-9 Includes bibliographical references at the end of each chapters and index.Invited Talks -- Theoretical Problems Related to the Internet -- Recent Progress and Prospects for Integer Factorisation Algorithms -- Hao Wang Award Paper -- Approximating Uniform Triangular Meshes in Polygons -- The Best Young Researcher Paper -- Maximum Induced Matchings of Random Cubic Graphs -- Computational Geometry 1 -- A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems -- On Local Transformation of Polygons with Visibility Properties -- Graph Drawing -- Embedding Problems for Paths with Direction Constrained Edges -- Characterization of Level Non-planar Graphs by Minimal Patterns -- Rectangular Drawings of Plane Graphs Without Designated Corners -- Computing Optimal Embeddings for Planar Graphs -- Graph Theory and Algorithms 1 -- Approximation Algorithms for Independent Sets in Map Graphs -- Hierarchical Topological Inference on Planar Disc Maps -- Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs -- Complexity, Discrete Mathematics, and Number Theory -- Parameterized Complexity of Finding Subgraphs with Hereditary Properties -- Some Results on Tries with Adaptive Branching -- Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound -- Closure Properties of Real Number Classes under Limits and Computable Operators -- Graph Theory and Algorithms 2 -- A Characterization of Graphs with Vertex Cover Six -- On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree -- Online Algorithms -- Online Independent Sets -- Two-Dimensional On-Line Bin Packing Problem with Rotatable Items -- Better Bounds on the Accommodating Ratio for the Seat Reservation Problem -- Ordinal On-Line Scheduling on Two Uniform Machines -- Parallel and Distributed Computing -- Agents, Distributed Algorithms, and Stabilization -- A Fast Sorting Algorithm and Its Generalization on Broadcast Communications -- Efficient List Ranking Algorithms on Reconfigurable Mesh -- Computational Geometry 2 -- Tripods Do Not Pack Densely -- An Efficient k Nearest Neighbor Searching Algorithm for a Query Line -- Tetrahedralization of Two Nested Convex Polyhedra -- Efficient Algorithms for Two-Center Problems for a Convex Polygon -- Combinatorial Optimization -- On Computation of Arbitrage for Markets with Friction -- On Some Optimization Problems in Obnoxious Facility Location -- Generating Necklaces and Strings with Forbidden Substrings -- Optimal Labelling of Point Features in the Slider Model -- Data Structures and Computational Biology -- Mappings for Conflict-Free Access of Paths in Elementary Data Structures -- Theory of Trinomial Heaps -- Polyhedral Aspects of the Consecutive Ones Problem -- The Complexity of Physical Mapping with Strict Chimerism -- Learning and Cryptography -- Logical Analysis of Data with Decomposable Structures -- Learning from Approximate Data -- A Combinatorial Approach to Asymmetric Traitor Tracing -- Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs -- Automata and Quantum Computing -- One-Way Probabilistic Reversible and Quantum One-Counter Automata -- Similarity Enrichment in Image Compression through Weighted Finite Automata -- On the Power of Input-Synchronized Alternating Finite Automata -- Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.Lecture Notes in Computer Science,0302-9743 ;1858Computer programmingComputersApplication softwareAlgorithmsComputer science—MathematicsComputer graphicsProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Theory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Computer Applicationshttps://scigraph.springernature.com/ontologies/product-market-codes/I23001Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Computer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Computer programming.Computers.Application software.Algorithms.Computer science—Mathematics.Computer graphics.Programming Techniques.Theory of Computation.Computer Applications.Algorithm Analysis and Problem Complexity.Discrete Mathematics in Computer Science.Computer Graphics.004Du Ding-Zhuedthttp://id.loc.gov/vocabulary/relators/edtEades Peteredthttp://id.loc.gov/vocabulary/relators/edtEstivill-Castro Vladimiredthttp://id.loc.gov/vocabulary/relators/edtLin Xueminedthttp://id.loc.gov/vocabulary/relators/edtSharma Arunedthttp://id.loc.gov/vocabulary/relators/edtCOCOON 2000MiAaPQMiAaPQMiAaPQBOOK9910143626903321Computing and Combinatorics772278UNINA