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

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
  • About this book