WALCOM: Algorithms and Computation 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016, Proceedings /

This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016. The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions. The papers cover a wide r...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Kaykobad, Mohammad (Επιμελητής έκδοσης), Petreschi, Rossella (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2016.
Έκδοση:1st ed. 2016.
Σειρά:Lecture Notes in Computer Science, 9627
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02504nam a22005415i 4500
001 978-3-319-30139-6
003 DE-He213
005 20161007175019.0
007 cr nn 008mamaa
008 160330s2016 gw | s |||| 0|eng d
020 |a 9783319301396  |9 978-3-319-30139-6 
024 7 |a 10.1007/978-3-319-30139-6  |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 WALCOM: Algorithms and Computation  |h [electronic resource] :  |b 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016, Proceedings /  |c edited by Mohammad Kaykobad, Rossella Petreschi. 
250 |a 1st ed. 2016. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2016. 
300 |a XIX, 362 p. 82 illus. in color.  |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 9627 
520 |a This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016. The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions. The papers cover a wide range of topics such as approximation algorithms, computational complexity, computational geometry, data structures, graph algorithms, graph coloring, graph exploration, and online algorithms. 
650 0 |a Computer science. 
650 0 |a Algorithms. 
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 Math Applications in Computer Science. 
650 2 4 |a Symbolic and Algebraic Manipulation. 
650 2 4 |a Computer Graphics. 
650 2 4 |a Algorithms. 
700 1 |a Kaykobad, Mohammad.  |e editor. 
700 1 |a Petreschi, Rossella.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783319301389 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 9627 
856 4 0 |u http://dx.doi.org/10.1007/978-3-319-30139-6  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)