WALCOM: Algorithm and Computation: 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Elektronisch Tagungsbericht E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2012
|
| Schriftenreihe: | Lecture notes in computer science
7157 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | 1 Online-Ressource (XV, 240 S.) graph. Darst. |
| ISBN: | 9783642280764 |
| DOI: | 10.1007/978-3-642-28076-4 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV039924902 | ||
| 003 | DE-604 | ||
| 005 | 20120504 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 120229s2012 xx d||| o|||| 10||| eng d | ||
| 020 | |a 9783642280764 |c eISBN |9 978-3-642-28076-4 | ||
| 024 | 7 | |a 10.1007/978-3-642-28076-4 |2 doi | |
| 035 | |a (OCoLC)873895743 | ||
| 035 | |a (DE-599)BVBBV039924902 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 |a DE-19 |a DE-91 |a DE-739 |a DE-384 |a DE-M347 |a DE-20 |a DE-703 |a DE-355 |a DE-92 |a DE-Aug4 |a DE-859 |a DE-634 |a DE-706 | ||
| 084 | |a DAT 000 |2 stub | ||
| 111 | 2 | |a WALCOM |n 6 |d 2012 |c Dhaka |j Verfasser |0 (DE-588)16339045-9 |4 aut | |
| 245 | 1 | 0 | |a WALCOM: Algorithm and Computation |b 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings |c Md. Saidur Rahman ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2012 | |
| 300 | |a 1 Online-Ressource (XV, 240 S.) |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 7157 | |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphenzeichnen |0 (DE-588)4706480-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 653 | |a Paperback / softback | ||
| 653 | |a Research | ||
| 653 | |a computational complexity | ||
| 653 | |a elliptic curve cryptography | ||
| 653 | |a multidimensional assignment | ||
| 653 | |a parameterized complexity | ||
| 653 | |a perfect graphs | ||
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2012 |z Dhaka |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Graphenzeichnen |0 (DE-588)4706480-8 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 3 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 3 | |5 DE-604 | |
| 689 | 4 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 4 | |5 DE-604 | |
| 700 | 1 | |a Rahman, Md. Saidur |d 1966- |e Sonstige |0 (DE-588)140356304 |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 978-3-642-28075-7 |
| 830 | 0 | |a Lecture notes in computer science |v 7157 |w (DE-604)BV014880109 |9 7157 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-28076-4 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-LNC | ||
| 912 | |a ZDB-2-SCS | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024783310 | |
Datensatz im Suchindex
| _version_ | 1820875375017721856 |
|---|---|
| adam_text | |
| any_adam_object | |
| author_GND | (DE-588)140356304 |
| author_corporate | WALCOM Dhaka |
| author_corporate_role | aut |
| author_facet | WALCOM Dhaka |
| author_sort | WALCOM Dhaka |
| building | Verbundindex |
| bvnumber | BV039924902 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 000 |
| collection | ZDB-2-LNC ZDB-2-SCS |
| ctrlnum | (OCoLC)873895743 (DE-599)BVBBV039924902 |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-3-642-28076-4 |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV039924902</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120504</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">120229s2012 xx d||| o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642280764</subfield><subfield code="c">eISBN</subfield><subfield code="9">978-3-642-28076-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-28076-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)873895743</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039924902</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">6</subfield><subfield code="d">2012</subfield><subfield code="c">Dhaka</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)16339045-9</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">WALCOM: Algorithm and Computation</subfield><subfield code="b">6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings</subfield><subfield code="c">Md. Saidur Rahman ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XV, 240 S.)</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7157</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Paperback / softback</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Research</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">elliptic curve cryptography</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">multidimensional assignment</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">parameterized complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">perfect graphs</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2012</subfield><subfield code="z">Dhaka</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rahman, Md. Saidur</subfield><subfield code="d">1966-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)140356304</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">978-3-642-28075-7</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7157</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">7157</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-28076-4</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024783310</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2012 Dhaka gnd-content |
| genre_facet | Konferenzschrift 2012 Dhaka |
| id | DE-604.BV039924902 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:14:36Z |
| institution | BVB |
| institution_GND | (DE-588)16339045-9 |
| isbn | 9783642280764 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024783310 |
| oclc_num | 873895743 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 DE-M347 DE-20 DE-703 DE-355 DE-BY-UBR DE-92 DE-Aug4 DE-859 DE-634 DE-706 |
| owner_facet | DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 DE-M347 DE-20 DE-703 DE-355 DE-BY-UBR DE-92 DE-Aug4 DE-859 DE-634 DE-706 |
| physical | 1 Online-Ressource (XV, 240 S.) graph. Darst. |
| psigel | ZDB-2-LNC ZDB-2-SCS |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | WALCOM 6 2012 Dhaka Verfasser (DE-588)16339045-9 aut WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings Md. Saidur Rahman ... (eds.) Berlin [u.a.] Springer 2012 1 Online-Ressource (XV, 240 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 7157 Graph (DE-588)4021842-9 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Graphenzeichnen (DE-588)4706480-8 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Paperback / softback Research computational complexity elliptic curve cryptography multidimensional assignment parameterized complexity perfect graphs (DE-588)1071861417 Konferenzschrift 2012 Dhaka gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Approximationsalgorithmus (DE-588)4500954-5 s Graphenzeichnen (DE-588)4706480-8 s Graph (DE-588)4021842-9 s Berechnungskomplexität (DE-588)4134751-1 s Rahman, Md. Saidur 1966- Sonstige (DE-588)140356304 oth Erscheint auch als Druck-Ausgabe, Paperback 978-3-642-28075-7 Lecture notes in computer science 7157 (DE-604)BV014880109 7157 https://doi.org/10.1007/978-3-642-28076-4 Verlag Volltext |
| spellingShingle | WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings Lecture notes in computer science Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4500954-5 (DE-588)4134751-1 (DE-588)4706480-8 (DE-588)4001183-5 (DE-588)1071861417 |
| title | WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings |
| title_auth | WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings |
| title_exact_search | WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings |
| title_full | WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings Md. Saidur Rahman ... (eds.) |
| title_fullStr | WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings Md. Saidur Rahman ... (eds.) |
| title_full_unstemmed | WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings Md. Saidur Rahman ... (eds.) |
| title_short | WALCOM: Algorithm and Computation |
| title_sort | walcom algorithm and computation 6th international workshop walcom 2012 dhaka bangladesh february 15 17 2012 proceedings |
| title_sub | 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings |
| topic | Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Graph Approximationsalgorithmus Berechnungskomplexität Graphenzeichnen Algorithmus Konferenzschrift 2012 Dhaka |
| url | https://doi.org/10.1007/978-3-642-28076-4 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT walcomdhaka walcomalgorithmandcomputation6thinternationalworkshopwalcom2012dhakabangladeshfebruary15172012proceedings AT rahmanmdsaidur walcomalgorithmandcomputation6thinternationalworkshopwalcom2012dhakabangladeshfebruary15172012proceedings |