Algorithms and Computation [electronic resource] : 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings / edited by Khaled Elbassioni, Kazuhisa Makino.
Contributor(s): Elbassioni, Khaled [editor.]
| Makino, Kazuhisa [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 9472Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015Edition: 1st ed. 2015.Description: XXII, 793 p. 131 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783662489710.Subject(s): Algorithms | Computer science -- Mathematics | Discrete mathematics | Computer graphics | Artificial intelligence -- Data processing | Numerical analysis | Algorithms | Discrete Mathematics in Computer Science | Computer Graphics | Data Science | Numerical AnalysisAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 518.1 Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
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.
There are no comments for this item.