Algorithms and Computation

19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings

  • Seok-Hee Hong
  • Hiroshi Nagamochi
  • Takuro Fukunaga
Conference proceedings ISAAC 2008

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

Table of contents

  1. Front Matter
  2. Invited Talk

  3. 1A Approximation Algorithm I

    1. Frank Kammer, Torsten Tholey
      Pages 16-27
    2. Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara et al.
      Pages 28-39
    3. Christian Glaßer, Christian Reitwießner, Heinz Schmitz
      Pages 40-51
  4. 1B Online Algorithm

    1. Sumit Ganguly
      Pages 52-63
    2. Weiwei Wu, Minming Li, Enhong Chen
      Pages 77-88
    3. Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai
      Pages 89-99
  5. 2A Data Structure and Algorithm

    1. Gerth Stølting Brodal, Allan Grønlund Jørgensen
      Pages 100-111
    2. Craig Dillabaugh, Meng He, Anil Maheshwari
      Pages 112-123
    3. Simon J. Puglisi, Andrew Turpin
      Pages 124-135
  6. 2B Game Theory

    1. Yingchao Zhao, Wei Chen, Shang-Hua Teng
      Pages 148-158
    2. Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika
      Pages 159-170
    3. Shankar Kalyanaraman, Christopher Umans
      Pages 171-182
    4. Panagiota N. Panagopoulou, Paul G. Spirakis
      Pages 183-195
  7. 3A Graph Algorithm I

    1. Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki
      Pages 196-207
    2. Michael Lampis, Georgia Kaouri, Valia Mitsou
      Pages 220-231
    3. Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
      Pages 246-257
  8. 3B Fixed Parameter Tractability

    1. Joachim Kneis, Alexander Langer, Peter Rossmanith
      Pages 270-281
    2. Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger
      Pages 282-293
    3. Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh
      Pages 294-305
    4. Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan
      Pages 306-317
  9. 4A Distributed Algorithm

    1. Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matúš Mihalák, Elias Vicari, Peter Widmayer
      Pages 318-329
    2. Paola Flocchini, Bernard Mans, Nicola Santoro
      Pages 330-341
    3. Greg Aloupis, Sébastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristán, Stefanie Wuhrer
      Pages 342-353
    4. Yoann Dieudonné, Franck Petit
      Pages 354-365
  10. 4B Database

    1. Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh
      Pages 366-377
    2. Ferdinando Cicalese, Martin Milanič
      Pages 378-389
    3. Kazuhisa Makino, Hirotaka Ono
      Pages 390-401
    4. Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle
      Pages 402-413
  11. 5A Approximation Algorithm II

    1. Naveen Garg, Amit Kumar, V. N. Muralidhara
      Pages 424-435
    2. Christian Glaßer
      Pages 448-459
  12. 5B Computational Biology

    1. Cheng-Wei Luo, Hsiao-Fei Liu, Peng-An Chen, Kun-Mao Chao
      Pages 460-471
    2. Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
      Pages 484-495
  13. 6A Computational Geometry I

    1. Ludmila Scharf, Marc Scherfenberg
      Pages 507-519
    2. Danny Z. Chen, Ewa Misiołek
      Pages 520-531
    3. Marc van Kreveld, Maarten Löffler, Joseph S. B. Mitchell
      Pages 544-555

About these proceedings


This book constitutes the refereed proceedings of the 19th International Symposium on Algorithms and Computation, ISAAC 2008, held in Gold Coast, Australia in December 2008.

The 78 revised full papers together with 3 invited talks presented were carefully reviewed and selected from 229 submissions for inclusion in the book. The papers are organized in topical sections on approximation algorithms, online algorithms, data structure and algorithms, game theory, graph algorithms, fixed parameter tractability, distributed algorithms, database, approximation algorithms, computational biology, computational geometry, complexity, networks, optimization as well as routing.


AAC algorithms complexity computational geometry data structure database game theory optimization

Editors and affiliations

  • Seok-Hee Hong
    • 1
  • Hiroshi Nagamochi
    • 2
  • Takuro Fukunaga
    • 3
  1. 1.School of Information TechnologiesUniversity of SydneyAustralia
  2. 2.Graduate School of InformaticsKyoto UniversityKyotoJapan
  3. 3.Graduate School of InformaticsKyoto UniversityJapan

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-540-92181-3
  • Online ISBN 978-3-540-92182-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software