Algorithms and Computation [electronic resource] : 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings /

Contributor(s):

Material type: Text

TextSeries: Theoretical Computer Science and General Issues ; 9472Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015Edition: 1st ed. 2015Description: XXII, 793 p. 131 illus. online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783662489710

Subject(s):

Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:

518.1 23

LOC classification:

QA76.9.A43

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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

No physical items for this record

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 on this title.

to post a comment.