Computing and Combinatorics

5th Annual International Conference, COCOON’99 Tokyo, Japan, July 26–28, 1999 Proceedings

  • Takano Asano
  • Hideki Imai
  • D. T. Lee
  • Shin-ichi Nakano
  • Takeshi Tokuyama
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1627)

Table of contents

  1. Front Matter
    Pages I-XIV
  2. Invited Talks

    1. Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew S. Tomkins
      Pages 1-17
  3. Hao Wang Award Paper

  4. Data Structures

    1. Tadao Takaoka
      Pages 41-50
    2. David Hutchinson, Anil Maheshwari, Norbert Zeh
      Pages 51-60
  5. Computational Biology

  6. Graph Drawing

    1. Atsuko Yamaguchi, Akihiro Sugimoto
      Pages 81-91
    2. Josep Díaz, Mathew D. Penrose, Jordi Petit, María Serna
      Pages 103-112
  7. Discrete Mathematics

    1. Carsten Damm, Ki Hang Kim, Fred Roush
      Pages 123-133
    2. Meena Mahajan, P. R. Subramanya, V. Vinay
      Pages 134-143
  8. Graph Algorithms 1

    1. Enrico Nardelli, Guido Proietti, Peter Widmayer
      Pages 144-153
    2. S. L. Bezrukov, R. Elsässer, U. -P. Schroeder
      Pages 154-163
    3. Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
      Pages 164-173
  9. Automata and Language

    1. Andris Ambainis, Richard Bonner, Rūsiņš Freivalds, Arnolds Ķikusts
      Pages 174-183
    2. Lance Fortnow, A. Pavan, Alan L. Selman
      Pages 184-193
    3. Pierre McKenzie, Klaus Reinhardt, V. Vinay
      Pages 194-203

About these proceedings

Introduction

The abstracts and papers in this volume were presented at the Fifth Annual International Computing and Combinatorics Conference (COCOON ’99), which was held in Tokyo, Japan from July 26 to 28, 1999. The topics cover most aspects of theoretical computer science and combinatorics pertaining to computing. In response to the call for papers, 88 high-quality extended abstracts were submitted internationally, of which 46 were selected for presentation by the p- gram committee. Every submitted paper was reviewed by at least three program committee members. Many of these papers represent reports on continuing - search, and it is expected that most of them will appear in a more polished and complete form in scienti c journals. In addition to the regular papers, this v- ume contains abstracts of two invited plenary talks by Prabhakar Raghavan and Seinosuke Toda. The conference also included a special talk by Kurt Mehlhorn on LEDA (Library of E cient Data types and Algorithms). The Hao Wang Award (inaugurated at COCOON ’97) is given to honor the paper judged by the program committee to have the greatest scienti c merit. The recipients of the Hao Wang Award 1999 were Hiroshi Nagamochi and Tos- hide Ibaraki for their paper \An Approximation for Finding a Smallest 2-Edge- Connected Subgraph Containing a Speci ed Spanning Tree".

Keywords

Automat algorithms automata combinatorial optimization combinatorics complexity complexity theory computational geometry data structures distributed computing number theory online optimization routing

Editors and affiliations

  • Takano Asano
    • 1
  • Hideki Imai
    • 2
  • D. T. Lee
    • 3
  • Shin-ichi Nakano
    • 4
  • Takeshi Tokuyama
    • 5
  1. 1.Department of Information and System Engineering Faculty of Science and EngineeringChuo UniversityTokyoJapan
  2. 2.Department of Information ScienceUniversity of TokyoTokyoJapan
  3. 3.Academia SinicaInstitute of Information ScienceNankang, TaipeiTaiwan
  4. 4.Department of Computer Science Faculty of EngineeringGunma UniversityGunmaJapan
  5. 5.IBM Tokyo Research LaboratoryYamato KanagawaJapan

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-48686-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 1999
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-66200-6
  • Online ISBN 978-3-540-48686-2
  • Series Print ISSN 0302-9743
  • About this book