Computing and combinatorics

the long version

Computing and Combinatorics: 6th Annual International Conference, COCOON 2000 Sydney, Australia, July 26–28, 2000 Proceedings<br />Author: Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-67787-1<br /> DOI: 10.1007/3-540-44968-X<br /><br />Table of Contents:<p></p><ul><li>Theoretical Problems Related to the Internet </li><li>Recent Progress and Prospects for Integer Factorisation Algorithms </li><li>Approximating Uniform Triangular Meshes in Polygons </li><li>Maximum Induced Matchings of Random Cubic Graphs </li><li>A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems </li><li>On Local Transformation of Polygons with Visibility Properties </li><li>Embedding Problems for Paths with Direction Constrained Edges </li><li>Characterization of Level Non-planar Graphs by Minimal Patterns </li><li>Rectangular Drawings of Plane Graphs Without Designated Corners </li><li>Computing Optimal Embeddings for Planar Graphs </li><li>Approximation Algorithms for Independent Sets in Map Graphs </li><li>Hierarchical Topological Inference on Planar Disc Maps </li><li>Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs </li><li>Parameterized Complexity of Finding Subgraphs with Hereditary Properties </li><li>Some Results on Tries with Adaptive Branching </li><li>Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound </li><li>Closure Properties of Real Number Classes under Limits and Computable Operators </li><li>A Characterization of Graphs with Vertex Cover Six </li><li>On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree </li><li>Online Independent Sets</li></ul>