Algorithms and Computation

18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings

  • Editors
  • Takeshi Tokuyama

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

Table of contents

  1. Front Matter
  2. Invited Talk

    1. Zdeněk Dvořák, Daniel Král’, Robin Thomas
      Pages 2-4
  3. Best Paper Award Presentation

    1. M. Ziaur Rahman, J. Ian Munro
      Pages 5-16
  4. 1A Graph Algorithms I

    1. Hiroshi Nagamochi
      Pages 17-28
    2. Emeric Gioan, Christophe Paul
      Pages 41-51
    3. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
      Pages 52-64
  5. 1B Computational Geometry I

    1. Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin
      Pages 65-74
    2. Yang Yang, Yongding Zhu, Jinhui Xu, Naoki Katoh
      Pages 75-87
    3. Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Michiel Smid, Yajun Wang
      Pages 88-99
  6. 2A Complexity I

    1. Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Shigeru Yamashita
      Pages 100-111
    2. Rahul Tripathi
      Pages 137-147
  7. 2B Graph Drawing

    1. Petr Hliněný, Gelasio Salazar
      Pages 148-159
    2. Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, Hsu-Chun Yen
      Pages 160-171
    3. F. Giordano, G. Liotta, T. Mchedlidze, A. Symvonis
      Pages 172-183
    4. Markus Chimani, Carsten Gutwenger
      Pages 184-195
  8. 3A Distributed Algorithms

About these proceedings

Keywords

Algorithms algorithm complexity computational geometry data structure database game theory optimization

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-77120-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-77118-0
  • Online ISBN 978-3-540-77120-3
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book