Lecture Notes in Computer Science

Computing and Combinatorics

5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999, Proceedings

Editors: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (Eds.)

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-3-540-48686-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $129.00
price for USA
  • ISBN 978-3-540-66200-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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".

Table of contents (7 chapters)

  • The Web as a Graph: Measurements, Models, and Methods

    Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew S. Tomkins

    Pages 1-17

  • An External Memory Data Structure for Shortest Path Queries (Extended Abstract)

    David Hutchinson, Anil Maheshwari, Norbert Zeh

    Pages 51-60

  • Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees

    Wing-Kai Hon, Tak-Wah Lam

    Pages 61-70

  • A New Transference Theorem in the Geometry of Numbers

    Jin-Yi Cai

    Pages 113-122

  • A Combinatorial Algorithm for Pfaffians

    Meena Mahajan, P. R. Subramanya, V. Vinay

    Pages 134-143

Buy this book

eBook $99.00
price for USA (gross)
  • ISBN 978-3-540-48686-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $129.00
price for USA
  • ISBN 978-3-540-66200-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Computing and Combinatorics
Book Subtitle
5th Annual International Conference, COCOON'99, Tokyo, Japan, July 26-28, 1999, Proceedings
Editors
  • Takao Asano
  • Hiroshi Imai
  • D.T. Lee
  • Shin-ichi Nakano
  • Takeshi Tokuyama
Series Title
Lecture Notes in Computer Science
Series Volume
1627
Copyright
1999
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-48686-2
DOI
10.1007/3-540-48686-0
Softcover ISBN
978-3-540-66200-6
Series ISSN
0302-9743
Edition Number
1
Number of Pages
XV, 494
Topics