WALCOM: algorithms and computation: 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : proceedings
Saved in:
| Corporate Author: | |
|---|---|
| Other Authors: | |
| Format: | Conference Proceeding Book |
| Language: | English |
| Published: |
Cham
Springer
[2018]
|
| Series: | Lecture notes in computer science
10755 |
| Subjects: | |
| Physical Description: | XX, 264 Seiten Diagramme |
| ISBN: | 9783319751719 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV044762928 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 180216s2018 xx |||| |||| 10||| eng d | ||
| 020 | |a 9783319751719 |9 978-3-319-75171-9 | ||
| 035 | |a (OCoLC)1024121191 | ||
| 035 | |a (DE-599)BVBBV044762928 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 111 | 2 | |a WALCOM |n 12. |d 2018 |c Dhaka |j Verfasser |0 (DE-588)1152446215 |4 aut | |
| 245 | 1 | 0 | |a WALCOM: algorithms and computation |b 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : proceedings |c M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara (eds.) |
| 264 | 1 | |a Cham |b Springer |c [2018] | |
| 300 | |a XX, 264 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 10755 | |
| 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 2018 |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 |0 (DE-588)1067082484 |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-319-75172-6 |
| 830 | 0 | |a Lecture notes in computer science |v 10755 |w (DE-604)BV000000607 |9 10755 | |
| 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-030158286 | |
Record in the Search Index
| _version_ | 1820875713516929024 |
|---|---|
| adam_text | |
| any_adam_object | |
| author2 | Rahman, M. Sohel |
| author2_role | edt |
| author2_variant | m s r ms msr |
| author_GND | (DE-588)1067082484 |
| author_corporate | WALCOM Dhaka |
| author_corporate_role | aut |
| author_facet | Rahman, M. Sohel WALCOM Dhaka |
| author_sort | WALCOM Dhaka |
| building | Verbundindex |
| bvnumber | BV044762928 |
| classification_rvk | SS 4800 |
| ctrlnum | (OCoLC)1024121191 (DE-599)BVBBV044762928 |
| 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">BV044762928</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">180216s2018 xx |||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319751719</subfield><subfield code="9">978-3-319-75171-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1024121191</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044762928</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</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></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">12.</subfield><subfield code="d">2018</subfield><subfield code="c">Dhaka</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1152446215</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">12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : proceedings</subfield><subfield code="c">M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">[2018]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XX, 264 Seiten</subfield><subfield code="b">Diagramme</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">10755</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">2018</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="0">(DE-588)1067082484</subfield><subfield code="4">edt</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-75172-6</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">10755</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">10755</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-030158286</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2018 Dhaka gnd-content |
| genre_facet | Konferenzschrift 2018 Dhaka |
| id | DE-604.BV044762928 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T15:20:01Z |
| institution | BVB |
| institution_GND | (DE-588)1152446215 |
| isbn | 9783319751719 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030158286 |
| oclc_num | 1024121191 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | XX, 264 Seiten Diagramme |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | WALCOM 12. 2018 Dhaka Verfasser (DE-588)1152446215 aut WALCOM: algorithms and computation 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : proceedings M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara (eds.) Cham Springer [2018] XX, 264 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 10755 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 2018 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 (DE-588)1067082484 edt Erscheint auch als Online-Ausgabe 978-3-319-75172-6 Lecture notes in computer science 10755 (DE-604)BV000000607 10755 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | WALCOM: algorithms and computation 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : 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 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : proceedings |
| title_auth | WALCOM: algorithms and computation 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : proceedings |
| title_exact_search | WALCOM: algorithms and computation 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : proceedings |
| title_full | WALCOM: algorithms and computation 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : proceedings M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara (eds.) |
| title_fullStr | WALCOM: algorithms and computation 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : proceedings M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara (eds.) |
| title_full_unstemmed | WALCOM: algorithms and computation 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : proceedings M. Sohel Rahman, Wing-Kin Sung, Ryuhei Uehara (eds.) |
| title_short | WALCOM: algorithms and computation |
| title_sort | walcom algorithms and computation 12th international conference walcom 2018 dhaka bangladesh march 3 5 2018 proceedings |
| title_sub | 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3-5, 2018 : 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 2018 Dhaka |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT walcomdhaka walcomalgorithmsandcomputation12thinternationalconferencewalcom2018dhakabangladeshmarch352018proceedings AT rahmanmsohel walcomalgorithmsandcomputation12thinternationalconferencewalcom2018dhakabangladeshmarch352018proceedings |