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.
| ISBN: | 9783662489703 |
| Publication date: | 27th November 2015 |
| Author: | ISAAC Symposium |
| Publisher: | Springer an imprint of Springer Berlin Heidelberg |
| Format: | Paperback |
| Pagination: | 793 pages |
| Series: | Lecture Notes in Computer Science |
| Genres: |
Algorithms and data structures Numerical analysis Maths for computer scientists Discrete mathematics Graphics programming Databases |
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.
Algorithms and Computation features in the following genres: Algorithms and data structures, Numerical analysis, Maths for computer scientists, Discrete mathematics, Graphics programming, Databases
Algorithms and Computation is available in Paperback
Algorithms and Computation was written by ISAAC Symposium and published by Springer an imprint of Springer Berlin Heidelberg
Algorithms and Computation has 793 pages
Yes it is part of Lecture Notes in Computer Science series