LEADER 01456nlm0 22004331i 450 
001 990009251770403321
010   $a9783540316671
035   $a000925177
035   $aFED01000925177
035   $a(Aleph)000925177FED01
035   $a000925177
100   $a20100926d2006----km-y0itay50------ba
101 0 $aeng
102   $aDE
135   $adrnn-008mamaa
200 1 $aGraph Drawing$bRisorsa elettronica$e13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005. Revised Papers$fedited by Patrick Healy, Nikola S. Nikolov
210   $aBerlin ; Heidelberg$cSpringer$d2006
225 1 $aLecture Notes in Computer Science$x0302-9743$v3843
230   $aDocumento elettronico
336   $aTesto
337   $aFormato html, pdf
702  1$aHealy,$bPatrick
702  1$aNikolov,$bNikola S.
801  0$aIT$bUNINA$gREICAT$2UNIMARC
856 4 $zFull text per gli utenti Federico II$uhttp://dx.doi.org/10.1007/11618058
901   $aEB
912   $a990009251770403321
961   $aAlgorithm Analysis and Problem Complexity
961   $aComputational complexity
961   $aComputer graphics
961   $aComputer Graphics
961   $aComputer science
961   $aComputer Science
961   $aComputer software
961   $aData Structures
961   $aData structures (Computer science)
961   $aDiscrete Mathematics in Computer Science
996   $aGraph Drawing$9773153
997   $aUNINA