Skip to main content
  • Conference proceedings
  • © 2015

Algorithms and Computation

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

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ISAAC: International Symposium on Algorithms and Computation

Conference proceedings info: ISAAC 2015.

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-662-48971-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (65 papers)

  1. Front Matter

    Pages I-XXII
  2. Computational Geometry I

    1. Front Matter

      Pages 1-1
    2. Adaptive Point Location in Planar Convex Subdivisions

      • Siu-Wing Cheng, Man-Kit Lau
      Pages 14-22
    3. Competitive Local Routing with Constraints

      • Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot
      Pages 23-34
    4. Navigating Weighted Regions with Scattered Skinny Tetrahedra

      • Siu-Wing Cheng, Man-Kwun Chiu, Jiongxin Jin, Antoine Vigneron
      Pages 35-45
  3. Data Structures

    1. Front Matter

      Pages 47-47
    2. On the Succinct Representation of Unlabeled Permutations

      • Hicham El-Zein, J. Ian Munro, Siwei Yang
      Pages 49-59
    3. How to Select the Top k Elements from Evolving Data?

      • Qin Huang, Xingwu Liu, Xiaoming Sun, Jialin Zhang
      Pages 60-70
    4. Optimal Search Trees with 2-Way Comparisons

      • Marek Chrobak, Mordecai Golin, J. Ian Munro, Neal E. Young
      Pages 71-82
    5. Multidimensional Range Selection

      • Timothy M. Chan, Gelin Zhou
      Pages 83-92
  4. Combinatorial Optimization and Approximation Algorithms I

    1. Front Matter

      Pages 93-93
    2. On the Minimum Cost Range Assignment Problem

      • Paz Carmi, Lilach Chaitman-Yerushalmi
      Pages 95-105
    3. General Caching Is Hard: Even with Small Pages

      • Lukáš Folwarczný, Jiří Sgall
      Pages 116-126
  5. Randomized Algorithms I

    1. Front Matter

      Pages 127-127
    2. The Secretary Problem with a Choice Function

      • Yasushi Kawase
      Pages 129-139
    3. The Benefit of Recombination in Noisy Evolutionary Search

      • Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Andrew M. Sutton
      Pages 140-150
    4. Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples

      • Matthias Ernst, Maciej Liśkiewicz, Rüdiger Reischuk
      Pages 151-162
  6. Combinatorial Optimization and Approximation Algorithms II

    1. Front Matter

      Pages 163-163

Other Volumes

  1. Algorithms and Computation

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

About this book

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
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Masdar Institute, Abu Dhabi, United Arab Emirates

    Khaled Elbassioni

  • Kyoto University, Kyoto, Japan

    Kazuhisa Makino

Bibliographic Information

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-662-48971-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.99
Price excludes VAT (USA)