Advertisement

Algorithms and Computation

26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings

  • Khaled Elbassioni
  • Kazuhisa Makino

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9472)

Table of contents

  1. Front Matter
    Pages I-XXII
  2. Computational Geometry I

    1. Front Matter
      Pages 1-1
    2. Siu-Wing Cheng, Man-Kit Lau
      Pages 14-22
    3. Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
      Pages 23-34
    4. Siu-Wing Cheng, Man-Kwun Chiu, Jiongxin Jin, Antoine Vigneron
      Pages 35-45
  3. Data Structures

    1. Front Matter
      Pages 47-47
    2. Hicham El-Zein, J. Ian Munro, Siwei Yang
      Pages 49-59
    3. Qin Huang, Xingwu Liu, Xiaoming Sun, Jialin Zhang
      Pages 60-70
    4. Marek Chrobak, Mordecai Golin, J. Ian Munro, Neal E. Young
      Pages 71-82
    5. Timothy M. Chan, Gelin Zhou
      Pages 83-92
  4. Combinatorial Optimization and Approximation Algorithms I

    1. Front Matter
      Pages 93-93
    2. Paz Carmi, Lilach Chaitman-Yerushalmi
      Pages 95-105
    3. Lukáš Folwarczný, Jiří Sgall
      Pages 116-126
  5. Randomized Algorithms I

    1. Front Matter
      Pages 127-127
    2. Yasushi Kawase
      Pages 129-139
    3. Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
      Pages 140-150
    4. Matthias Ernst, Maciej Liśkiewicz, Rüdiger Reischuk
      Pages 151-162
  6. Combinatorial Optimization and Approximation Algorithms II

    1. Front Matter
      Pages 163-163
    2. Guillaume Fertin, Irena Rusu, Stéphane Vialette
      Pages 165-175
    3. Ashwin Arulselvan, Ágnes Cseh, Martin Groß, David F. Manlove, Jannik Matuschke
      Pages 176-187 Open Access
    4. Haitao Wang, Xiao Zhang
      Pages 188-198
  7. Randomized Algorithms II

    1. Front Matter
      Pages 199-199
    2. Dmitry Itsykson, Alexander Knop, Dmitry Sokolov
      Pages 201-211
    3. Tobias Friedrich, Maximilian Katzmann, Anton Krohmer
      Pages 212-222
    4. Aline Saettler, Eduardo Laber, Ferdinando Cicalese
      Pages 223-234
  8. Graph Algorithms and FPT I

    1. Front Matter
      Pages 235-235
    2. Eli Fox-Epstein, Duc A. Hoang, Yota Otachi, Ryuhei Uehara
      Pages 237-247
    3. Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve H. Sæther, Yngve Villanger
      Pages 248-258
    4. Pradeesha Ashok, Aditi Dudeja, Sudeshna Kolay
      Pages 271-282
  9. Computational Geometry II

    1. Front Matter
      Pages 283-283
    2. Sang Duk Yoon, Min-Gyu Kim, Wanbin Son, Hee-Kap Ahn
      Pages 285-295
    3. Sándor P. Fekete, Robert T. Schweller, Andrew Winslow
      Pages 296-306
    4. Eunjin Oh, Jean-Lou De Carufel, Hee-Kap Ahn
      Pages 307-317
    5. Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S. B. Mitchell et al.
      Pages 318-328
  10. Graph Algorithms and FPT II

    1. Front Matter
      Pages 329-329
    2. Matteo Pontecorvi, Vijaya Ramachandran
      Pages 331-342
    3. Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Danny Krizanc, Najmeh Taleb
      Pages 343-354
    4. Tomáš Gavenčiak, Przemysław Gordinowicz, Vít Jelínek, Pavel Klavík, Jan Kratochvíl
      Pages 355-366
    5. Eric Angel, Evripidis Bampis, Vincent Chau, Alexander Kononov
      Pages 367-377
  11. Computational Geometry III

    1. Front Matter
      Pages 379-379
    2. Chih-Hung Liu, Sandro Montanari
      Pages 381-392
    3. Maike Buchin, Stef Sijben
      Pages 393-403
    4. Yi-Jun Chang, Hsu-Chun Yen
      Pages 415-425
  12. Combinatorial Optimization and Approximation Algorithms III

    1. Front Matter
      Pages 427-427
    2. Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff
      Pages 429-441

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 26th International Symposium on Algorithms and Computation, ISAAC 2015, held in Nagoya, Japan, in December 2015.

The 65 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 180 submissions for inclusion in the book. The focus of the volume is on the following topics: computational geometry; data structures; combinatorial optimization and approximation algorithms; randomized algorithms; graph algorithms and FPT; computational complexity; graph drawing and planar graphs; online and streaming algorithms; and string and DNA algorithms.

Keywords

combinatorial optimization cryptography online algorithms parallel algorithms quantum computing algorithmic game theory algorithms approximation approximation algorithms computational biology computational complexity computational geometry data structures distributed algorithms experimental algorithms graph algorithms graph drawing internet algorithms polynomial time randomized algorithms

Editors and affiliations

  • Khaled Elbassioni
    • 1
  • Kazuhisa Makino
    • 2
  1. 1.Masdar InstituteAbu DhabiUnited Arab Emirates
  2. 2.Kyoto UniversityKyotoJapan

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-48971-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2015
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-48970-3
  • Online ISBN 978-3-662-48971-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site