WALCOM: algorithms and computation: 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
Cham
Springer
[2021]
|
| Schriftenreihe: | Lecture notes in computer science
12635 |
| Schlagworte: | |
| Beschreibung: | xv, 334 Seiten Illustrationen, Diagramme |
| ISBN: | 9783030682101 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV047187124 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 210309s2021 xx a||| |||| 10||| eng d | ||
| 020 | |a 9783030682101 |9 978-3-030-68210-1 | ||
| 035 | |a (OCoLC)1241672211 | ||
| 035 | |a (DE-599)BVBBV047187124 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 111 | 2 | |a WALCOM |n 15. |d 2021 |c Online |j Verfasser |0 (DE-588)1228892636 |4 aut | |
| 245 | 1 | 0 | |a WALCOM: algorithms and computation |b 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |c Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy (eds.) |
| 264 | 1 | |a Cham |b Springer |c [2021] | |
| 300 | |a xv, 334 Seiten |b Illustrationen, 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 12635 | |
| 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 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 Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2021 |z Online |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |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 Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 4 | |5 DE-604 | |
| 700 | 1 | |a Uehara, Ryuhei |0 (DE-588)1205764194 |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-030-68211-8 |
| 830 | 0 | |a Lecture notes in computer science |v 12635 |w (DE-604)BV000000607 |9 12635 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-032592394 | |
Datensatz im Suchindex
| _version_ | 1820875793294688256 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author2 | Uehara, Ryuhei |
| author2_role | edt |
| author2_variant | r u ru |
| author_GND | (DE-588)1205764194 |
| author_corporate | WALCOM Online |
| author_corporate_role | aut |
| author_facet | Uehara, Ryuhei WALCOM Online |
| author_sort | WALCOM Online |
| building | Verbundindex |
| bvnumber | BV047187124 |
| classification_rvk | SS 4800 |
| ctrlnum | (OCoLC)1241672211 (DE-599)BVBBV047187124 |
| discipline | Informatik |
| discipline_str_mv | 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">BV047187124</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">210309s2021 xx a||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783030682101</subfield><subfield code="9">978-3-030-68210-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1241672211</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047187124</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">15.</subfield><subfield code="d">2021</subfield><subfield code="c">Online</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1228892636</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">15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings</subfield><subfield code="c">Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">[2021]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xv, 334 Seiten</subfield><subfield code="b">Illustrationen, 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">12635</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">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">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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">2021</subfield><subfield code="z">Online</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="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="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">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">Uehara, Ryuhei</subfield><subfield code="0">(DE-588)1205764194</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-030-68211-8</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">12635</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">12635</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032592394</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2021 Online gnd-content |
| genre_facet | Konferenzschrift 2021 Online |
| id | DE-604.BV047187124 |
| illustrated | Illustrated |
| index_date | 2024-07-03T16:46:29Z |
| indexdate | 2025-01-10T15:21:17Z |
| institution | BVB |
| institution_GND | (DE-588)1228892636 |
| isbn | 9783030682101 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032592394 |
| oclc_num | 1241672211 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | xv, 334 Seiten Illustrationen, Diagramme |
| publishDate | 2021 |
| publishDateSearch | 2021 |
| publishDateSort | 2021 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | WALCOM 15. 2021 Online Verfasser (DE-588)1228892636 aut WALCOM: algorithms and computation 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy (eds.) Cham Springer [2021] xv, 334 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 12635 Graph (DE-588)4021842-9 gnd rswk-swf Approximationsalgorithmus (DE-588)4500954-5 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Graphenzeichnen (DE-588)4706480-8 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2021 Online gnd-content Algorithmus (DE-588)4001183-5 s Berechnungskomplexität (DE-588)4134751-1 s DE-604 Approximationsalgorithmus (DE-588)4500954-5 s Graphenzeichnen (DE-588)4706480-8 s Graph (DE-588)4021842-9 s Algorithmische Geometrie (DE-588)4130267-9 s Uehara, Ryuhei (DE-588)1205764194 edt Erscheint auch als Online-Ausgabe 978-3-030-68211-8 Lecture notes in computer science 12635 (DE-604)BV000000607 12635 |
| spellingShingle | WALCOM: algorithms and computation 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings Lecture notes in computer science Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4500954-5 (DE-588)4130267-9 (DE-588)4706480-8 (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)1071861417 |
| title | WALCOM: algorithms and computation 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |
| title_auth | WALCOM: algorithms and computation 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |
| title_exact_search | WALCOM: algorithms and computation 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |
| title_exact_search_txtP | WALCOM: algorithms and computation 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |
| title_full | WALCOM: algorithms and computation 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy (eds.) |
| title_fullStr | WALCOM: algorithms and computation 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy (eds.) |
| title_full_unstemmed | WALCOM: algorithms and computation 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy (eds.) |
| title_short | WALCOM: algorithms and computation |
| title_sort | walcom algorithms and computation 15th international conference walcom 2021 yangon myanmar february 28 march 2 2021 proceedings |
| title_sub | 15th international conference, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |
| topic | Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Graph Approximationsalgorithmus Algorithmische Geometrie Graphenzeichnen Berechnungskomplexität Algorithmus Konferenzschrift 2021 Online |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT walcomonline walcomalgorithmsandcomputation15thinternationalconferencewalcom2021yangonmyanmarfebruary28march22021proceedings AT uehararyuhei walcomalgorithmsandcomputation15thinternationalconferencewalcom2021yangonmyanmarfebruary28march22021proceedings |