Advertisement

Algorithms and Computation

25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings

  • Hee-Kap Ahn
  • Chan-Su Shin

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

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

Table of contents

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

    1. Front Matter
      Pages 1-1
    2. Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr
      Pages 15-26
    3. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi
      Pages 27-37
  3. Combinatorial Optimization

    1. Front Matter
      Pages 39-39
    2. Ken Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan
      Pages 41-52
    3. Leszek Gąsieniec, Christos Levcopoulos, Andrzej Lingas
      Pages 53-64
    4. Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu
      Pages 65-78
  4. Graph Algorithms: Enumeration

    1. Front Matter
      Pages 79-79
    2. Andre Droschinsky, Bernhard Heinemann, Nils Kriege, Petra Mutzel
      Pages 81-93
    3. Kunihiro Wasa, Hiroki Arimura, Takeaki Uno
      Pages 94-102
  5. Matching and Assignment

    1. Front Matter
      Pages 115-115
    2. Therese Biedl, Stefan Huber, Peter Palfrader
      Pages 117-127
    3. Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart
      Pages 141-153
  6. Data Structures and Algorithms

    1. Front Matter
      Pages 155-155
    2. Alberto Policriti, Nicola Prezza
      Pages 157-168
    3. J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan
      Pages 169-180
    4. Presenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman
      Pages 181-192
  7. Fixed-Parameter Tractable Algorithms

    1. Front Matter
      Pages 193-193
    2. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto
      Pages 195-207
    3. Takehiro Ito, Marcin Kamiński, Hirotaka Ono
      Pages 208-219
    4. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
      Pages 220-232
  8. Scheduling Algorithms

    1. Front Matter
      Pages 233-233
    2. Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu
      Pages 235-246
    3. Eric Angel, Evripidis Bampis, Vincent Chau, Nguyen Kim Thang
      Pages 247-258
    4. Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli
      Pages 259-269
  9. Computational Complexity

    1. Front Matter
      Pages 271-271
    2. Daniel M. Kane, Osamu Watanabe
      Pages 273-284
    3. Pål Grønås Drange, Markus Sortland Dregi, Pim van ’t Hof
      Pages 285-297
    4. Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier
      Pages 298-309
  10. Computational Geometry

    1. Front Matter
      Pages 311-311
    2. Prosenjit Bose, Pat Morin, André van Renssen
      Pages 313-325
    3. Jian Li, Haitao Wang
      Pages 326-337
    4. Subhash Suri, Kevin Verbeek
      Pages 338-350
  11. Approximation Algorithms

  12. Graph Theory and Algorithms

    1. Front Matter
      Pages 387-387
    2. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono et al.
      Pages 389-400
    3. Pavel Klavík, Maria Saumell
      Pages 401-413
    4. Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu
      Pages 414-425
  13. Fixed-Parameter Tractable Algorithms

    1. Front Matter
      Pages 427-427
    2. Jakub Gajarský, Petr Hliněný, Jan Obdržálek, Sebastian Ordyniak
      Pages 441-451
    3. Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman
      Pages 452-463
  14. Graph Algorithms: Approximation

    1. Front Matter
      Pages 465-465

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 25th International Symposium on Algorithms and Computation, ISAAC 2014, held in Jeonju, Korea, in December 2014.
The 60 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 171 submissions for inclusion in the book. The focus of the volume in on the following topics: computational geometry, combinatorial optimization, graph algorithms: enumeration, matching and assignment, data structures and algorithms, fixed-parameter tractable algorithms, scheduling algorithms, computational complexity, computational complexity, approximation algorithms, graph theory and algorithms, online and approximation algorithms, and network and scheduling algorithms.

Keywords

Algorithmic Game Theory Algorithms Approximation Approximation Algorithms Combinatorial Optimization Computational Biology Computational Complexity Computational Geometry Cryptography Data Structures Distributed Algorithms Experimental Algorithms Graph Algorithms Graph Drawing Internet Algorithms Online Algorithms Parallel Algorithms Polynomial Time Quantum Computing Randomized Algorithms

Editors and affiliations

  • Hee-Kap Ahn
    • 1
  • Chan-Su Shin
    • 2
  1. 1.Pohang University of Science and TechnologyPohangKorea, Republic of (South Korea)
  2. 2.Hankuk University of Foreign StudiesYongin-siKorea, Republic of (South Korea)

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-13075-0
  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-13074-3
  • Online ISBN 978-3-319-13075-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site