| Record ID | marc_loc_2016/BooksAll.2016.part37.utf8:94790116:1826 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part37.utf8:94790116:1826?format=raw |
LEADER: 01826cam a22004817a 4500
001 2009920096
003 DLC
005 20130619074642.0
008 090105s2009 gw a b 101 0 eng d
010 $a 2009920096
020 $a9783642002014 (pbk. : alk. paper)
020 $a3642002013 (pbk. : alk. paper)
035 $a(OCoLC)ocn302315741
040 $aOHX$cOHX$dBTCTA$dYDXCP$dIXA$dGBVCP$dDEBBG$dDLC
042 $alccopycat
050 00 $aQA76.9.A43$bW34 2009
072 7 $aQA$2lcco
082 00 $a005.1$223
084 $aDAT 530f$2stub
084 $aSS 4800$2rvk
111 2 $aWALCOM (Workshop)$n(3rd :$d2009 :$cKolkata, India)
245 10 $aWALCOM: algorithms and computation :$bthird international workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009 : proceedings /$cSandip Das, Ryuhei Uehara (eds.).
260 $aBerlin ;$aNew York :$bSpringer,$cc2009.
300 $axiii, 408 p. :$bill. ;$c24 cm.
490 0 $aLecture notes in computer science,$x0302-9743 ;$v5431
504 $aIncludes bibliographical references and index.
650 0 $aComputer algorithms$vCongresses.
650 0 $aData structures (Computer science)$vCongresses.
650 0 $aGraph theory$vCongresses.
650 4 $aAlgorithmische Geometrie$vKongress$zKalkutta <2009>
650 4 $aAlgorithmus$vKongress$zKalkutta <2009>
650 4 $aBerechnungskomplexität$vKongress$zKalkutta <2009>
650 4 $aGraph$xAlgorithmus$vKongress$zKalkutta <2009>
650 4 $aGraphenzeichnen$vKongress$zKalkutta <2009>
655 7 $aKalkutta (2009)$2swd
655 7 $aKongress.$2swd
650 07 $aAlgorithmische Geometrie.$2swd
650 07 $aAlgorithmus.$2swd
650 07 $aBerechnungskomplexität.$2swd
650 07 $aGraph.$2swd
650 07 $aGraphenzeichnen.$2swd
700 1 $aDas, Sandip.
700 1 $aUehara, Ryuhei.