|
|
|
|
| LEADER |
01766nom a2200433 u 4500 |
| 001 |
10092901 |
| 003 |
upatras |
| 005 |
20210924092955.0 |
| 008 |
110802s2010 eng |
| 020 |
|
|
|a 9783642114090
|
| 040 |
|
|
|a GR-PaULI
|c GR-PaULI
|
| 041 |
0 |
|
|a eng
|
| 100 |
1 |
|
|a Paul, Christophe
|9 98724
|
| 245 |
1 |
0 |
|a Graph-Theoretic Concepts in Computer Science
|h [electronic resource]
|b 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers
|c edited by Christophe Paul, Michel Habib
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer-Verlag Berlin Heidelberg
|c 2010
|
| 300 |
|
|
|b v.: digital
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|v 5911
|x 0302-9743
|
| 650 |
|
4 |
|a Computer science
|9 13995
|
| 650 |
|
4 |
|a Data structures (Computer science)
|9 20006
|
| 650 |
|
4 |
|a Computer software
|9 24488
|
| 650 |
|
4 |
|a Computational complexity
|9 20484
|
| 650 |
|
4 |
|a Algebra
|x Data processing
|9 66998
|
| 650 |
|
4 |
|a Algorithms
|9 12256
|
| 650 |
|
4 |
|a Geometry
|9 65258
|
| 650 |
|
4 |
|a Computer Science
|9 64565
|
| 650 |
|
4 |
|a Discrete Mathematics in Computer Science
|9 64594
|
| 650 |
|
4 |
|a Geometry
|9 65258
|
| 650 |
|
4 |
|a Algorithms
|9 12256
|
| 650 |
|
4 |
|a Άλγεβρα
|x Ηλεκτρονικοί υπολογιστές
|x Προγράμματα
|9 112864
|
| 650 |
|
4 |
|a Algorithm Analysis and Problem Complexity
|9 64576
|
| 650 |
|
4 |
|a Data Structures
|9 20006
|
| 700 |
1 |
|
|a Habib, M.
|q (Michel)
|9 98725
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|9 68735
|
| 760 |
1 |
|
|a Lecture notes in computer science
|g 5911
|x 0302-9743
|
| 852 |
|
|
|a GR-PaULI
|b ΠΑΤΡΑ
|b ΒΚΠ
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-11409-0
|
| 942 |
|
|
|2 ddc
|
| 952 |
|
|
|0 0
|1 0
|4 0
|7 0
|9 100815
|a LISP
|b LISP
|d 2016-04-24
|l 0
|r 2016-04-24 00:00:00
|w 2016-04-24
|y ERS
|
| 999 |
|
|
|c 68601
|d 68601
|
