[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Computing and Combinatorics

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

  • Conference proceedings
  • © 2000

Overview

Editors:
  1. Ding-Zhu Du

    1. Department of Computer Science and Engineering, University of Minnesota, Minneapolis, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Peter Eades

    1. Department of Computer Science and Software Engineering, University of Newcastle, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Vladimir Estivill-Castro

    1. Department of Computer Science and Software Engineering, University of Newcastle, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Xuemin Lin

    1. School of Computer Science and Engineering, University of Newcastle, Sydney, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  5. Arun Sharma

    1. School of Computer Science and Engineering, University of Newcastle, Sydney, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook GBP 35.99
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book GBP 44.99
Price includes VAT (United Kingdom)
  • 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

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (46 papers)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Invited Talks

    1. Theoretical Problems Related to the Internet

      • Christos H. Papadimitriou
      Pages 1-2

    2. Recent Progress and Prospects for Integer Factorisation Algorithms

      • Richard P. Brent
      Pages 3-22

  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. A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems

      • Gill Barequet
      Pages 44-53

    2. 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. Approximation Algorithms for Independent Sets in Map Graphs

      • Zhi-Zhong Chen
      Pages 105-114

    2. Hierarchical Topological Inference on Planar Disc Maps

      • Zhi-Zhong Chen, Xin He
      Pages 115-125

    3. 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. Parameterized Complexity of Finding Subgraphs with Hereditary Properties

      • Subhash Khot, Venkatesh Raman
      Pages 137-147

    2. Some Results on Tries with Adaptive Branching

      • Yuriy A. Reznik
      Pages 148-158

    3. Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound

      • Ferdinando Cicalese, Daniele Mundici
      Pages 159-169

    4. Closure Properties of Real Number Classes under Limits and Computable Operators

      • Xizhong Zheng
      Pages 170-179

  9. Graph Theory and Algorithms 2

    1. A Characterization of Graphs with Vertex Cover Six

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

    2. On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree

      • Mirka Miller, Slamin
      Pages 193-201
Back to top

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

Publish with us

Policies and ethics

Back to top

Search

Navigation