WALCOM: algorithms and computation: 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings
Gespeichert in:
Körperschaft: | |
---|---|
Format: | Tagungsbericht Buch |
Sprache: | English |
Veröffentlicht: |
Cham [u.a.]
Springer
2015
|
Schriftenreihe: | Lecture notes in computer science
8973 |
Schlagworte: | |
Beschreibung: | XXIII, 336 S. graph. Darst. |
ISBN: | 9783319156118 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV042363926 | ||
003 | DE-604 | ||
005 | 20170313 | ||
007 | t| | ||
008 | 150216s2015 xx d||| |||| 00||| eng d | ||
020 | |a 9783319156118 |9 978-3-319-15611-8 | ||
035 | |a (OCoLC)915572930 | ||
035 | |a (DE-599)BVBBV042363926 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-83 |a DE-11 | ||
111 | 2 | |a WALCOM |n 9. |d 2015 |c Dhaka |j Verfasser |0 (DE-588)1067079599 |4 aut | |
245 | 1 | 0 | |a WALCOM: algorithms and computation |b 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings |c M. Sohel Rahman ... (eds.) |
264 | 1 | |a Cham [u.a.] |b Springer |c 2015 | |
300 | |a XXIII, 336 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 8973 | |
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 Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |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 |
650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2015 |z Dhaka |2 gnd-content | |
689 | 0 | 0 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
689 | 1 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
689 | 1 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 1 | 3 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
689 | 1 | 4 | |a Graphenzeichnen |0 (DE-588)4706480-8 |D s |
689 | 1 | 5 | |a Graph |0 (DE-588)4021842-9 |D s |
689 | 1 | |8 1\p |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 Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
689 | 4 | |5 DE-604 | |
700 | 1 | |a Rahman, M. Sohel |e Sonstige |0 (DE-588)1067082484 |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-319-15612-5 |
830 | 0 | |a Lecture notes in computer science |v 8973 |w (DE-604)BV000000607 |9 8973 | |
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-027800460 |
Datensatz im Suchindex
_version_ | 1820875649537015808 |
---|---|
adam_text | |
any_adam_object | |
author_GND | (DE-588)1067082484 |
author_corporate | WALCOM Dhaka |
author_corporate_role | aut |
author_facet | WALCOM Dhaka |
author_sort | WALCOM Dhaka |
building | Verbundindex |
bvnumber | BV042363926 |
classification_rvk | SS 4800 |
ctrlnum | (OCoLC)915572930 (DE-599)BVBBV042363926 |
discipline | Informatik |
format | Conference Proceeding Book |
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">BV042363926</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20170313</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">150216s2015 xx d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319156118</subfield><subfield code="9">978-3-319-15611-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)915572930</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042363926</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">9.</subfield><subfield code="d">2015</subfield><subfield code="c">Dhaka</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1067079599</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">WALCOM: algorithms and computation</subfield><subfield code="b">9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings</subfield><subfield code="c">M. Sohel Rahman ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXIII, 336 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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</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">8973</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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="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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2015</subfield><subfield code="z">Dhaka</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><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="4"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="5"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><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">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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, M. Sohel</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1067082484</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-3-319-15612-5</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">8973</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">8973</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027800460</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2015 Dhaka gnd-content |
genre_facet | Konferenzschrift 2015 Dhaka |
id | DE-604.BV042363926 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:19:00Z |
institution | BVB |
institution_GND | (DE-588)1067079599 |
isbn | 9783319156118 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027800460 |
oclc_num | 915572930 |
open_access_boolean | |
owner | DE-83 DE-11 |
owner_facet | DE-83 DE-11 |
physical | XXIII, 336 S. graph. Darst. |
publishDate | 2015 |
publishDateSearch | 2015 |
publishDateSort | 2015 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | WALCOM 9. 2015 Dhaka Verfasser (DE-588)1067079599 aut WALCOM: algorithms and computation 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings M. Sohel Rahman ... (eds.) Cham [u.a.] Springer 2015 XXIII, 336 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 8973 Graph (DE-588)4021842-9 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Graphenzeichnen (DE-588)4706480-8 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2015 Dhaka gnd-content Algorithmische Geometrie (DE-588)4130267-9 s DE-604 Informatik (DE-588)4026894-9 s Berechnungskomplexität (DE-588)4134751-1 s Algorithmus (DE-588)4001183-5 s Approximationsalgorithmus (DE-588)4500954-5 s Graphenzeichnen (DE-588)4706480-8 s Graph (DE-588)4021842-9 s 1\p DE-604 Rahman, M. Sohel Sonstige (DE-588)1067082484 oth Erscheint auch als Online-Ausgabe 978-3-319-15612-5 Lecture notes in computer science 8973 (DE-604)BV000000607 8973 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | WALCOM: algorithms and computation 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings Lecture notes in computer science Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Informatik (DE-588)4026894-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
subject_GND | (DE-588)4021842-9 (DE-588)4500954-5 (DE-588)4026894-9 (DE-588)4130267-9 (DE-588)4706480-8 (DE-588)4001183-5 (DE-588)4134751-1 (DE-588)1071861417 |
title | WALCOM: algorithms and computation 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings |
title_auth | WALCOM: algorithms and computation 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings |
title_exact_search | WALCOM: algorithms and computation 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings |
title_full | WALCOM: algorithms and computation 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings M. Sohel Rahman ... (eds.) |
title_fullStr | WALCOM: algorithms and computation 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings M. Sohel Rahman ... (eds.) |
title_full_unstemmed | WALCOM: algorithms and computation 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings M. Sohel Rahman ... (eds.) |
title_short | WALCOM: algorithms and computation |
title_sort | walcom algorithms and computation 9th international workshop walcom 2015 dhaka bangladesh february 26 28 2015 proceedings |
title_sub | 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26 - 28, 2015 ; proceedings |
topic | Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Informatik (DE-588)4026894-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
topic_facet | Graph Approximationsalgorithmus Informatik Algorithmische Geometrie Graphenzeichnen Algorithmus Berechnungskomplexität Konferenzschrift 2015 Dhaka |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT walcomdhaka walcomalgorithmsandcomputation9thinternationalworkshopwalcom2015dhakabangladeshfebruary26282015proceedings AT rahmanmsohel walcomalgorithmsandcomputation9thinternationalworkshopwalcom2015dhakabangladeshfebruary26282015proceedings |