Computing and Combinatorics: 6th Annual International Conference, COCOON 2000 Sydney, Australia, July 26–28, 2000 Proceedings
Author: Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-67787-1
DOI: 10.1007/3-540-44968-X

Table of Contents:

• Theoretical Problems Related to the Internet
  
• Recent Progress and Prospects for Integer Factorisation Algorithms
  
• Approximating Uniform Triangular Meshes in Polygons
  
• Maximum Induced Matchings of Random Cubic Graphs
  
• A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems
  
• On Local Transformation of Polygons with Visibility Properties
  
• 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
  
• 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
  
• 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
  
• A Characterization of Graphs with Vertex Cover Six
  
• On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree
  
• Online Independent Sets