Advertisement

Algorithms and Computation

23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings

  • Kun-Mao Chao
  • Tsan-sheng Hsu
  • Der-Tsai Lee
Conference proceedings ISAAC 2012

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

Table of contents

  1. Front Matter
  2. Invited Talk (I)

  3. Invited Talk (II)

  4. Invited Talk (III)

    1. Erik D. Demaine
      Pages 3-3
  5. Graph Algorithms (I)

    1. Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky
      Pages 4-13
    2. Petr A. Golovach, Daniël Paulusma, Jian Song
      Pages 14-23
    3. Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou
      Pages 34-43
  6. Online and Streaming Algorithms

    1. Prudence W. H. Wong, Fencol C. C. Yung, Mihai Burcea
      Pages 44-53
    2. Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son
      Pages 54-63
    3. Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner
      Pages 75-84
  7. Combinatorial Optimization (I)

    1. Tanja Hartmann, Dorothea Wagner
      Pages 95-105
    2. Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli
      Pages 106-115
    3. Katarzyna Paluch
      Pages 116-125
  8. Computational Complexity (I)

    1. Reza Dorrigiv, Meng He, Norbert Zeh
      Pages 136-145
    2. Andrej Brodnik, Marko Grgurovič
      Pages 156-165
  9. Computational Geometry (I)

    1. Marc van Kreveld, Maarten Löffler, János Pach
      Pages 166-176
    2. Evanthia Papadopoulou, Maksym Zavershynskyi
      Pages 177-186
    3. Evanthia Papadopoulou, Sandeep Kumar Dey
      Pages 187-196
  10. String Algorithms

    1. Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
      Pages 207-216
    2. Riku Saikkonen, Eljas Soisalon-Soininen
      Pages 217-226
  11. Computational Complexity (II)

    1. Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi
      Pages 227-236
    2. René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller
      Pages 247-256
    3. Chinmoy Dutta, Jaikumar Radhakrishnan
      Pages 257-266
  12. Graph Algorithms (II)

    1. Andreas Brandstädt, Arne Leitert, Dieter Rautenbach
      Pages 267-277
    2. Wei Chen, Wenjie Fang, Guangda Hu, Michael W. Mahoney
      Pages 278-288
    3. Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine
      Pages 289-298
    4. Rémy Belmonte, Pim van ’t Hof, Marcin Kamiński
      Pages 299-308
  13. Computational Geometry (II)

    1. Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa
      Pages 309-318
    2. Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala
      Pages 319-331
    3. Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu
      Pages 332-341
  14. Approximation Algorithms

    1. Yamming Huang, Chung-Shou Liao
      Pages 352-361
    2. Wei Yu, Mordecai Golin, Guochuan Zhang
      Pages 362-371
    3. Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno et al.
      Pages 372-381
    4. Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh
      Pages 382-391
  15. Graph Algorithms (III)

    1. Tanja Hartmann, Jonathan Rollin, Ignaz Rutter
      Pages 402-412
    2. Fabrizio Frati, Joachim Gudmundsson, Emo Welzl
      Pages 413-422
    3. Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze et al.
      Pages 423-432
  16. Computational Complexity (III)

    1. Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis
      Pages 433-443
    2. Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh
      Pages 444-454
    3. Danny Hermelin, Romeo Rizzi, Stéphane Vialette
      Pages 465-474

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 23rd International Symposium on Algorithms and Computation, ISAAC 2012, held in Taipei, Taiwan, in December 2012. The 68 revised full papers presented together with three invited talks were carefully reviewed and selected from 174 submissions for inclusion in the book. This volume contains topics such as graph algorithms; online and streaming algorithms; combinatorial optimization; computational complexity; computational geometry; string algorithms; approximation algorithms; graph drawing; data structures; randomized algorithms; and algorithmic game theory.

Keywords

computational geometry decentralized navigation graphs and hypergraphs polynomial algorithms wireless networks

Editors and affiliations

  • Kun-Mao Chao
    • 1
  • Tsan-sheng Hsu
    • 2
  • Der-Tsai Lee
    • 3
  1. 1.Department of Computer Science and Information EngineeringNational Taiwan UniversityTaipeiTaiwan
  2. 2.Institute of Information ScienceAcademia SinicaTaipeiTaiwan
  3. 3.Department of Computer Science and EngineeringNational Chung Hsing UniversityTaichungTaiwan

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-35261-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-35260-7
  • Online ISBN 978-3-642-35261-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Engineering