|
|
|
|
LEADER |
02655nam a22005535i 4500 |
001 |
978-3-662-48971-0 |
003 |
DE-He213 |
005 |
20151128191309.0 |
007 |
cr nn 008mamaa |
008 |
151126s2015 gw | s |||| 0|eng d |
020 |
|
|
|a 9783662489710
|9 978-3-662-48971-0
|
024 |
7 |
|
|a 10.1007/978-3-662-48971-0
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.9.A43
|
072 |
|
7 |
|a UMB
|2 bicssc
|
072 |
|
7 |
|a COM051300
|2 bisacsh
|
082 |
0 |
4 |
|a 005.1
|2 23
|
245 |
1 |
0 |
|a Algorithms and Computation
|h [electronic resource] :
|b 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings /
|c edited by Khaled Elbassioni, Kazuhisa Makino.
|
250 |
|
|
|a 1st ed. 2015.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2015.
|
300 |
|
|
|a XXII, 793 p. 131 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 9472
|
520 |
|
|
|a 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.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Numerical analysis.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
|
0 |
|a Computer graphics.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Computer Graphics.
|
650 |
2 |
4 |
|a Data Structures.
|
650 |
2 |
4 |
|a Numeric Computing.
|
700 |
1 |
|
|a Elbassioni, Khaled.
|e editor.
|
700 |
1 |
|
|a Makino, Kazuhisa.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662489703
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 9472
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-662-48971-0
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|