| 000 | 01788nam a22004455a 4500 | ||
|---|---|---|---|
| 005 | 20250914164842.0 | ||
| 006 | m q d | ||
| 007 | cr nn 008maaau | ||
| 008 | 090212s2006 gw q j eng d | ||
| 020 | _a9783540316671 (electronic bk.) | ||
| 020 | _a9783540314257 (paper) | ||
| 035 | _a(Springer)978-3-540-31425-7 | ||
| 039 | 9 |
_a200902121948 _bmuhaimin _y04-04-2008 _zmuhaimin |
|
| 050 | 0 | 0 |
_aT385 _b.S884 2005 |
| 082 | 0 | 0 |
_a511.5 _222 |
| 090 |
_aT385 _b.S989 2005 |
||
| 111 | 2 |
_aSymposium on Graph Drawing _n(13th : _d2005 : _cLimerick, Ireland) |
|
| 245 | 1 | 0 |
_aGraph Drawing (vol. # 3843) _h[electronic resource] : _b13 th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers / _cedited by Patrick Healy, Nikola S. Nikolov. |
| 260 |
_aBerlin Heidelberg : _bSpringer-Verlag GmbH., _c2006 |
||
| 300 |
_axvii, 536 p. : _bill., digital ; _c24 cm. |
||
| 440 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v3843 |
|
| 650 | 0 |
_aComputer graphics _vCongresses. |
|
| 650 | 0 |
_aGraph theory _vCongresses. |
|
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | _aComputer Graphics. |
| 650 | 2 | 4 | _aData Structures. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 700 | 1 | _aHealy, Patrick. | |
| 700 | 1 | _aNikolov, Nikola S. | |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer e-books | |
| 856 | 4 | 0 | _uhttps://eresourcesptsl.ukm.remotexs.co/user/login?url=http://dx.doi.org/10.1007/11618058 |
| 907 |
_a.b14142892 _b2024-10-01 _c2019-11-12 |
||
| 942 |
_n0 _kT385 .S989 2005 |
||
| 914 | _avtls003371852 | ||
| 998 |
_ae0001 _b2008-04-04 _cm _dz _feng _ggw _y0 _z.b14142892 |
||
| 999 |
_c410269 _d410269 |
||