This book constitutes the refereed proceedings of the 24th International Symposium on Algorithms and Computation, ISAAC 2013, held in Hong Kong, China in December 2013. The 67 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 177 submissions for inclusion in the book. The focus of the volume in on the following topics: computation geometry, pattern matching, computational complexity, internet and social network algorithms, graph theory and algorithms, scheduling algorithms, fixed-parameter tractable algorithms, algorithms and data structures, algorithmic game theory, approximation algorithms and network algorithms.
| ISBN: | 9783642450297 |
| Publication date: | 22nd November 2013 |
| Author: | ISAAC Symposium |
| Publisher: | Springer an imprint of Springer Berlin Heidelberg |
| Format: | Paperback |
| Pagination: | 747 pages |
| Series: | Lecture Notes in Computer Science |
| Genres: |
Algorithms and data structures Maths for computer scientists Discrete mathematics Graphics programming Databases Computer science |
This book constitutes the refereed proceedings of the 24th International Symposium on Algorithms and Computation, ISAAC 2013, held in Hong Kong, China in December 2013. The 67 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 177 submissions for inclusion in the book. The focus of the volume in on the following topics: computation geometry, pattern matching, computational complexity, internet and social network algorithms, graph theory and algorithms, scheduling algorithms, fixed-parameter tractable algorithms, algorithms and data structures, algorithmic game theory, approximation algorithms and network algorithms.
Algorithms and Computation features in the following genres: Algorithms and data structures, Maths for computer scientists, Discrete mathematics, Graphics programming, Databases, Computer science
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 747 pages
Yes it is part of Lecture Notes in Computer Science series