Algorithms and Computation : 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings / edited by Khaled Elbassioni, Kazuhisa Makino.

Contributor(s):

Material type: Text

TextLanguage: İngilizce Series: Theoretical Computer Science and General Issues ; 9472Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015Description: 1 online resourceContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9783662489710

Subject(s):

LOC classification:

QA76.9.A43

Online resources:

Springer eBooks Online access link to the resource

Summary: 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)

Holdings
Item type	Current library	Home library	Collection	Call number	Status	Notes	Date due	Barcode
E-Book	Merkez Kütüphane	Merkez Kütüphane	E-Kitap Koleksiyonu	QA76.9.A43EBK (Browse shelf(Opens below))	Geçerli değil-e-Kitap / Not applicable-e-Book			EBK00089

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.