WALCOM: Algorithms and Computation 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings /

This book constitutes the proceedings of the 5th International Workshop on Algorithms and Computation, WALCOM 2011, held in New Delhi, India, in February 2011. The 20 papers presented in this volume were carefully reviewed and selected from 57 submissions.  The papers are grouped in topical sections...

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

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Katoh, Naoki (Επιμελητής έκδοσης), Kumar, Amit (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Σειρά:Lecture Notes in Computer Science, 6552
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02415nam a22005295i 4500
001 978-3-642-19094-0
003 DE-He213
005 20170120125647.0
007 cr nn 008mamaa
008 110210s2011 gw | s |||| 0|eng d
020 |a 9783642190940  |9 978-3-642-19094-0 
024 7 |a 10.1007/978-3-642-19094-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 WALCOM: Algorithms and Computation  |h [electronic resource] :  |b 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings /  |c edited by Naoki Katoh, Amit Kumar. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2011. 
300 |a XI, 233 p. 41 illus., 4 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 6552 
520 |a This book constitutes the proceedings of the 5th International Workshop on Algorithms and Computation, WALCOM 2011, held in New Delhi, India, in February 2011. The 20 papers presented in this volume were carefully reviewed and selected from 57 submissions.  The papers are grouped in topical sections on approximation algorithms, hardness, algorithm engineering, computational geometry, string algorithms, and graph algorithms. 
650 0 |a Computer science. 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Bioinformatics. 
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 Computational Biology/Bioinformatics. 
650 2 4 |a Algorithms. 
700 1 |a Katoh, Naoki.  |e editor. 
700 1 |a Kumar, Amit.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642190933 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 6552 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-19094-0  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)