WALCOM: algorithms and computation: 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings
Gespeichert in:
Körperschaft: | |
---|---|
Weitere Verfasser: | , , |
Format: | Elektronisch Tagungsbericht E-Book |
Sprache: | English |
Veröffentlicht: |
Cham, Switzerland
Springer
[2021]
|
Schriftenreihe: | Theoretical computer science and general issues
12635 |
Schlagworte: | |
Online-Zugang: | BTU01 FCO01 FHA01 FHD01 FHI01 FHM01 FHN01 FHR01 FLA01 FRO01 FWS01 FWS02 HTW01 TUM01 UBA01 UBG01 UBM01 UBR01 UBT01 UBW01 UBY01 UER01 UPA01 Volltext |
Beschreibung: | 1 Online-Ressource Illustrationen, Diagramme |
ISBN: | 9783030682118 |
DOI: | 10.1007/978-3-030-68211-8 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV047175088 | ||
003 | DE-604 | ||
005 | 20221124 | ||
006 | a |||| 10||| | ||
007 | cr|uuu---uuuuu | ||
008 | 210304s2021 |||| o||u| ||||||eng d | ||
020 | |a 9783030682118 |c Online |9 978-3-030-68211-8 | ||
024 | 7 | |a 10.1007/978-3-030-68211-8 |2 doi | |
035 | |a (ZDB-2-SCS)9783030682118 | ||
035 | |a (ZDB-2-LNC)9783030682118 | ||
035 | |a (OCoLC)1241674172 | ||
035 | |a (DE-599)BVBBV047175088 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-860 |a DE-19 |a DE-858 |a DE-Aug4 |a DE-898 |a DE-188 |a DE-523 |a DE-473 |a DE-29 |a DE-863 |a DE-1050 |a DE-20 |a DE-862 |a DE-384 |a DE-573 |a DE-M347 |a DE-703 |a DE-706 |a DE-739 |a DE-634 |a DE-92 |a DE-861 |a DE-91 |a DE-355 | ||
082 | 0 | |a 004.0151 |2 23 | |
084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
084 | |a DAT 000 |2 stub | ||
084 | |a DAT 530 |2 stub | ||
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 and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |c Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy (eds.) |
264 | 1 | |a Cham, Switzerland |b Springer |c [2021] | |
300 | |a 1 Online-Ressource |b Illustrationen, Diagramme | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 12635 |a Theoretical computer science and general issues | |
650 | 4 | |a Theory of Computation | |
650 | 4 | |a Data Structures | |
650 | 4 | |a Discrete Mathematics in Computer Science | |
650 | 4 | |a Computer Graphics | |
650 | 4 | |a Information Systems Applications (incl. Internet) | |
650 | 4 | |a Computers | |
650 | 4 | |a Data structures (Computer science) | |
650 | 4 | |a Computer science—Mathematics | |
650 | 4 | |a Computer graphics | |
650 | 4 | |a Application software | |
650 | 0 | 7 | |a Algorithmische Geometrie |0 (DE-588)4130267-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 |
650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2021 |z Online |2 gnd-content | |
689 | 0 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 1 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |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 Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
689 | 3 | |5 DE-604 | |
689 | 4 | 0 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
689 | 4 | |5 DE-604 | |
700 | 1 | |a Uehara, Ryuhei |0 (DE-588)1205764194 |4 edt | |
700 | 1 | |a Hong, Seok-hee |0 (DE-588)134184351 |4 edt | |
700 | 1 | |a Nandy, Subhas Chandra |d 1959- |0 (DE-588)1023900726 |4 edt | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-030-68210-1 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-030-68212-5 |
830 | 0 | |a Theoretical computer science and general issues |v 12635 |w (DE-604)BV014880109 |9 12635 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-3-030-68211-8 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-2-SCS |a ZDB-2-LNC | ||
940 | 1 | |q ZDB-2-SCS_2021 | |
940 | 1 | |q ZDB-2-LNC_2021 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-032580474 | ||
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l BTU01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l FCO01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l FHA01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l FHD01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l FHI01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l FHM01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l FHN01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l FHR01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l FLA01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l FRO01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l FWS01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l FWS02 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l HTW01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l TUM01 |p ZDB-2-LNC |q ZDB-2-LNC_2021 |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l UBA01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l UBG01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l UBM01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l UBR01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l UBT01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l UBW01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l UBY01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l UER01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1007/978-3-030-68211-8 |l UPA01 |p ZDB-2-LNC |x Verlag |3 Volltext |
Datensatz im Suchindex
DE-BY-FWS_katkey | 874650 |
---|---|
_version_ | 1806194320718430208 |
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author2 | Uehara, Ryuhei Hong, Seok-hee Nandy, Subhas Chandra 1959- |
author2_role | edt edt edt |
author2_variant | r u ru s h h shh s c n sc scn |
author_GND | (DE-588)1205764194 (DE-588)134184351 (DE-588)1023900726 |
author_corporate | WALCOM Online |
author_corporate_role | aut |
author_facet | Uehara, Ryuhei Hong, Seok-hee Nandy, Subhas Chandra 1959- WALCOM Online |
author_sort | WALCOM Online |
building | Verbundindex |
bvnumber | BV047175088 |
classification_rvk | SS 4800 |
classification_tum | DAT 000 DAT 530 |
collection | ZDB-2-SCS ZDB-2-LNC |
ctrlnum | (ZDB-2-SCS)9783030682118 (ZDB-2-LNC)9783030682118 (OCoLC)1241674172 (DE-599)BVBBV047175088 |
dewey-full | 004.0151 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 004 - Computer science |
dewey-raw | 004.0151 |
dewey-search | 004.0151 |
dewey-sort | 14.0151 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
discipline_str_mv | Informatik |
doi_str_mv | 10.1007/978-3-030-68211-8 |
format | Electronic Conference Proceeding eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05741nmm a2201105zcb4500</leader><controlfield tag="001">BV047175088</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20221124 </controlfield><controlfield tag="006">a |||| 10||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210304s2021 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783030682118</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-030-68211-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-030-68211-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)9783030682118</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-LNC)9783030682118</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1241674172</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047175088</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-860</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-858</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-1050</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4800</subfield><subfield code="0">(DE-625)143528:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530</subfield><subfield code="2">stub</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 and Workshops, 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, Switzerland</subfield><subfield code="b">Springer</subfield><subfield code="c">[2021]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource</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">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">12635</subfield><subfield code="a">Theoretical computer science and general issues</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Graphics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information Systems Applications (incl. Internet)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science—Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer graphics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Application software</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">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="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="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">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="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=" "><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">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</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="700" ind1="1" ind2=" "><subfield code="a">Hong, Seok-hee</subfield><subfield code="0">(DE-588)134184351</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nandy, Subhas Chandra</subfield><subfield code="d">1959-</subfield><subfield code="0">(DE-588)1023900726</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-030-68210-1</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-030-68212-5</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Theoretical computer science and general issues</subfield><subfield code="v">12635</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">12635</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2021</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-LNC_2021</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032580474</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">FCO01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">FHD01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">FHI01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">FHM01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">FHR01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">FLA01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">FWS01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">FWS02</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">HTW01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="q">ZDB-2-LNC_2021</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">UBA01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-68211-8</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2021 Online gnd-content |
genre_facet | Konferenzschrift 2021 Online |
id | DE-604.BV047175088 |
illustrated | Not Illustrated |
index_date | 2024-07-03T16:44:21Z |
indexdate | 2024-08-01T16:05:33Z |
institution | BVB |
institution_GND | (DE-588)1228892636 |
isbn | 9783030682118 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032580474 |
oclc_num | 1241674172 |
open_access_boolean | |
owner | DE-860 DE-19 DE-BY-UBM DE-858 DE-Aug4 DE-898 DE-BY-UBR DE-188 DE-523 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-1050 DE-20 DE-862 DE-BY-FWS DE-384 DE-573 DE-M347 DE-703 DE-706 DE-739 DE-634 DE-92 DE-861 DE-91 DE-BY-TUM DE-355 DE-BY-UBR |
owner_facet | DE-860 DE-19 DE-BY-UBM DE-858 DE-Aug4 DE-898 DE-BY-UBR DE-188 DE-523 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-1050 DE-20 DE-862 DE-BY-FWS DE-384 DE-573 DE-M347 DE-703 DE-706 DE-739 DE-634 DE-92 DE-861 DE-91 DE-BY-TUM DE-355 DE-BY-UBR |
physical | 1 Online-Ressource Illustrationen, Diagramme |
psigel | ZDB-2-SCS ZDB-2-LNC ZDB-2-SCS_2021 ZDB-2-LNC_2021 ZDB-2-LNC ZDB-2-LNC_2021 |
publishDate | 2021 |
publishDateSearch | 2021 |
publishDateSort | 2021 |
publisher | Springer |
record_format | marc |
series | Theoretical computer science and general issues |
series2 | Lecture notes in computer science Theoretical computer science and general issues |
spellingShingle | WALCOM: algorithms and computation 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings Theoretical computer science and general issues Theory of Computation Data Structures Discrete Mathematics in Computer Science Computer Graphics Information Systems Applications (incl. Internet) Computers Data structures (Computer science) Computer science—Mathematics Computer graphics Application software Algorithmische Geometrie (DE-588)4130267-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 Graph (DE-588)4021842-9 gnd |
subject_GND | (DE-588)4130267-9 (DE-588)4500954-5 (DE-588)4134751-1 (DE-588)4706480-8 (DE-588)4001183-5 (DE-588)4021842-9 (DE-588)1071861417 |
title | WALCOM: algorithms and computation 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |
title_auth | WALCOM: algorithms and computation 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |
title_exact_search | WALCOM: algorithms and computation 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |
title_exact_search_txtP | WALCOM: algorithms and computation 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |
title_full | WALCOM: algorithms and computation 15th International Conference and Workshops, 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 and Workshops, 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 and Workshops, 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 and workshops walcom 2021 yangon myanmar february 28 march 2 2021 proceedings |
title_sub | 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021 : proceedings |
topic | Theory of Computation Data Structures Discrete Mathematics in Computer Science Computer Graphics Information Systems Applications (incl. Internet) Computers Data structures (Computer science) Computer science—Mathematics Computer graphics Application software Algorithmische Geometrie (DE-588)4130267-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 Graph (DE-588)4021842-9 gnd |
topic_facet | Theory of Computation Data Structures Discrete Mathematics in Computer Science Computer Graphics Information Systems Applications (incl. Internet) Computers Data structures (Computer science) Computer science—Mathematics Computer graphics Application software Algorithmische Geometrie Approximationsalgorithmus Berechnungskomplexität Graphenzeichnen Algorithmus Graph Konferenzschrift 2021 Online |
url | https://doi.org/10.1007/978-3-030-68211-8 |
volume_link | (DE-604)BV014880109 |
work_keys_str_mv | AT walcomonline walcomalgorithmsandcomputation15thinternationalconferenceandworkshopswalcom2021yangonmyanmarfebruary28march22021proceedings AT uehararyuhei walcomalgorithmsandcomputation15thinternationalconferenceandworkshopswalcom2021yangonmyanmarfebruary28march22021proceedings AT hongseokhee walcomalgorithmsandcomputation15thinternationalconferenceandworkshopswalcom2021yangonmyanmarfebruary28march22021proceedings AT nandysubhaschandra walcomalgorithmsandcomputation15thinternationalconferenceandworkshopswalcom2021yangonmyanmarfebruary28march22021proceedings |