Algorithms and Computation

14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003. Proceedings

  • Toshihide Ibaraki
  • Naoki Katoh
  • Hirotaka Ono

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

Table of contents

  1. Front Matter
  2. Invited Talk

    1. Andrew Chi-Chih Yao
      Pages 1-1
    2. Takao Nishizeki
      Pages 2-5
  3. 1A Computational Geometry I

    1. Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama
      Pages 6-15
    2. Anil Maheshwari, Michiel Smid
      Pages 16-25
    3. Tetsushi Nishida, Kokichi Sugihara
      Pages 26-35
    4. Ovidiu Daescu, Ningfang Mi
      Pages 36-46
  4. 1B Graph and Combinatorial Algorithms I

    1. Anne Berry, Pinar Heggernes, Yngve Villanger
      Pages 47-57
    2. Ori Gerstel, Shay Kutten, Rachel Matichin, David Peleg
      Pages 68-77
    3. Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao
      Pages 78-87
  5. 2A Computational Complexity I

    1. Bodo Manthey, Rüdiger Reischuk
      Pages 88-97
    2. Richard Beigel, Lance Fortnow, Frank Stephan
      Pages 98-107
  6. 2B Graph and Combinatorial Algorithms II

  7. 3A Quantum Computation

About these proceedings

Introduction

This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15–17 December 2003. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), and Vancouver (2002). ISAACisanannualinternationalsymposiumthatcoverstheverywiderange of topics in algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in algorithms and the theory of computation where they can exchange ideas in this active research community. In response to our call for papers, we received unexpectedly many subm- sions, 207 papers. The task of selecting the papers in this volume was done by our program committee and referees. After a thorough review process, the committee selected 73 papers. The selection was done on the basis of originality and relevance to the ?eld of algorithms and computation. We hope all accepted papers will eventally appear in scienti?c journals in more polished forms. The best paper award was given for “On the Geometric Dilation of Finite Point Sets” to Annette Ebbers-Baumann, Ansgar Grune ¨ and Rolf Klein. Two eminent invited speakers, Prof. Andrew Chi-Chih Yao of Princeton University and Prof. Takao Nishizeki of Tohoku University, contributed to this proceedings.

Keywords

AAC algorithms combinatorial optimization complexity computational geometry data structures game theory optimization scheduling

Editors and affiliations

  • Toshihide Ibaraki
    • 1
  • Naoki Katoh
    • 2
  • Hirotaka Ono
    • 3
  1. 1.School of Science and TechnologyKwansei Gakuin UniversitySandaJapan
  2. 2.Department of Architecture and Architectural EngineeringKyoto UniversityNishikyo-kuJapan
  3. 3.Department of Computer Science and Communication EngineeringKyushu UniversityFukuokaJapan

Bibliographic information

  • DOI https://doi.org/10.1007/b94771
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-20695-8
  • Online ISBN 978-3-540-24587-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book