Skip to main content
  • Conference proceedings
  • © 2000

Computing and Combinatorics

6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000 Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1858)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (46 papers)

  1. Front Matter

    Pages I-XII
  2. Invited Talks

    1. Theoretical Problems Related to the Internet

      • Christos H. Papadimitriou
      Pages 1-2
  3. Hao Wang Award Paper

    1. Approximating Uniform Triangular Meshes in Polygons

      • Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu
      Pages 23-33
  4. The Best Young Researcher Paper

    1. Maximum Induced Matchings of Random Cubic Graphs

      • William Duckworth, Nicholas C. Wormald, Michele Zito
      Pages 34-43
  5. Computational Geometry 1

    1. On Local Transformation of Polygons with Visibility Properties

      • Carmen Hernando, Michael E. Houle, Ferran Hurtado
      Pages 54-63
  6. Graph Drawing

    1. Embedding Problems for Paths with Direction Constrained Edges

      • Giuseppe Di Battista, Giuseppe Liotta, Anna Lubiw, Sue Whitesides
      Pages 64-73
    2. Characterization of Level Non-planar Graphs by Minimal Patterns

      • Patrick Healy, Ago Kuusik, Sebastian Leipert
      Pages 74-84
    3. Rectangular Drawings of Plane Graphs Without Designated Corners

      • Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki
      Pages 85-94
    4. Computing Optimal Embeddings for Planar Graphs

      • Petra Mutzel, René Weiskircher
      Pages 95-104
  7. Graph Theory and Algorithms 1

    1. Hierarchical Topological Inference on Planar Disc Maps

      • Zhi-Zhong Chen, Xin He
      Pages 115-125
    2. Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs

      • Yaw-Ling Lin, Fang Rong Hsu, Yin-Te Tsai
      Pages 126-136
  8. Complexity, Discrete Mathematics, and Number Theory

    1. Some Results on Tries with Adaptive Branching

      • Yuriy A. Reznik
      Pages 148-158
    2. Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound

      • Ferdinando Cicalese, Daniele Mundici
      Pages 159-169
  9. Graph Theory and Algorithms 2

    1. A Characterization of Graphs with Vertex Cover Six

      • Michael J. Dinneen, Liu Xiong
      Pages 180-192

Editors and Affiliations

  • Department of Computer Science and Engineering, University of Minnesota, Minneapolis, USA

    Ding-Zhu Du

  • Department of Computer Science and Software Engineering, University of Newcastle, Australia

    Peter Eades, Vladimir Estivill-Castro

  • School of Computer Science and Engineering, University of Newcastle, Sydney, Australia

    Xuemin Lin, Arun Sharma

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access