Algorithms and Computation

11th International Conference, ISAAC 2000 Taipei, Taiwan, December 18–20, 2000 Proceedings

  • Gerhard Goos
  • Juris Hartmanis
  • Jan van Leeuwen
  • D. T. Lee
  • Shang-Hua Teng
Conference proceedings ISAAC 2000

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

Table of contents

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

  3. Algorithms and Data Structures (I)

    1. Prosenjit Bose, Jurek Czyzowicz, Leszek Gąsieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc et al.
      Pages 23-34
    2. Ching Law, Charles E. Leiserson
      Pages 35-46
    3. Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz et al.
      Pages 47-59
  4. Combinatorial Optimization

  5. Algorithms and Data Structures (II)

    1. Ferdinando Cicalese, Ugo Vaccaro
      Pages 96-107
    2. Takashi Horiyama, Toshihide Ibaraki
      Pages 120-131
  6. Approximation and Randomized Algorithms (I)

    1. Xiaotie Deng, Guojun Li, Wenan Zang, Yi Zhou
      Pages 144-155
  7. Algorithms and Data Structures (III)

    1. Xiao Zhou, Takao Nishizeki
      Pages 168-179
    2. Rolf Niedermeier, Peter Rossmanith
      Pages 180-191
    3. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
      Pages 192-203
  8. Approximation and Randomized Algorithms (II)

    1. Takao Asano, Magnús M. Halldórsson, Kazuo Iwama, Takeshi Matsuda
      Pages 204-215
    2. Norihiro Kubo, Katsuhiro Muramoto, Shinichi Shimozono
      Pages 216-227

About these proceedings


The papers in this volume were selected for presentation at the Eleventh Annual International Symposium on Algorithms and Computation (ISAAC 2000), held on 18{20 December, 2000 at the Institute of Information Science, Academia Sinica, Taipei, Taiwan. Previous meetings were held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), and Chennai (1999). Submissions to the conference this year were conducted entirely electro- cally. Thanks to the excellent software developed by the Institute of Information Science, Academia Sinica, we were able to carry out virtually all communication via the World Wide Web. In response to the call for papers, a total of 87 extended abstracts were submitted from 25 countries. Each submitted paper was handled by at least three program committee members, with the assistance of a number of external reviewers, as indicated by the referee list found in the proceedings. There were many more acceptable papers than there was space available in the symposium program, which made the program committee’s task extremely di cult. Finally 46 papers were selected for presentation at the Symposium. In addition to these contributed papers, the conference also included two invited presentations by Dr. Jean-Daniel Boissonnat, INRIA Sophia-Antipolis, France and Professor Jin-Yi Cai, University of Wisconsin at Madison, Wisconsin, USA. It is expected that most of the accepted papers will appear in a more complete form in scienti c journals.


AAC Automat algorithms automata combinatorial optimization complexity complexity theory computational geometry data structures optimization

Editors and affiliations

  • Gerhard Goos
    • 1
  • Juris Hartmanis
    • 2
  • Jan van Leeuwen
    • 3
  • D. T. Lee
    • 4
  • Shang-Hua Teng
    • 5
  1. 1.Karlsruhe UniversityGermany
  2. 2.Cornell UniversityUSA
  3. 3.Utrecht UniversityThe Netherlands
  4. 4.Academia SinicaInstitute of Information ScienceTaipeiTaiwan, R.O.C.
  5. 5.Department of Computer Science and Akamai TechnologiesUniversity of Illinois at Urbana ChampaignCambridgeUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-41255-7
  • Online ISBN 978-3-540-40996-0
  • Series Print ISSN 0302-9743
  • About this book
Industry Sectors