Algorithms and Computation

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

  • Seok-Hee Hong
  • Hiroshi Nagamochi
  • Takuro Fukunaga

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

About these proceedings

Introduction

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.

Keywords

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 https://doi.org/10.1007/978-3-540-92182-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-92181-3
  • Online ISBN 978-3-540-92182-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book