WALCOM: algorithms and computation: 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , , |
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
Cham
Springer
[2023]
|
| Schriftenreihe: | Lecture notes in computer science
13973 |
| Schlagworte: | |
| Beschreibung: | xiii, 398 Seiten Illustrationen |
| ISBN: | 9783031270505 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV048865239 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 230317s2023 xx a||| |||| 10||| eng d | ||
| 020 | |a 9783031270505 |9 978-3-031-27050-5 | ||
| 035 | |a (OCoLC)1373392639 | ||
| 035 | |a (DE-599)BVBBV048865239 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 111 | 2 | |a International Conference and Workshops on Algorithms and Computation |n 17. |d 2023 |c Hsinchu |j Verfasser |0 (DE-588)1283675919 |4 aut | |
| 245 | 1 | 0 | |a WALCOM: algorithms and computation |b 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings |c Petra Mutzel, Md. Saidur Rahman, Slamin (eds.) |
| 264 | 1 | |a Cham |b Springer |c [2023] | |
| 264 | 4 | |c © 2023 | |
| 300 | |a xiii, 398 Seiten |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 13973 | |
| 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 2023 |z Hsinchu |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 Lin, Chun-Cheng |4 edt | |
| 700 | 1 | |a Lin, Bertrand M. T. |0 (DE-588)1225818834 |4 edt | |
| 700 | 1 | |a Liotta, Giuseppe |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-031-27051-2 |
| 830 | 0 | |a Lecture notes in computer science |v 13973 |w (DE-604)BV000000607 |9 13973 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-034130282 | |
Datensatz im Suchindex
| _version_ | 1820875816559443968 |
|---|---|
| adam_text | |
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author2 | Lin, Chun-Cheng Lin, Bertrand M. T. Liotta, Giuseppe |
| author2_role | edt edt edt |
| author2_variant | c c l ccl b m t l bmt bmtl g l gl |
| author_GND | (DE-588)1225818834 |
| author_corporate | International Conference and Workshops on Algorithms and Computation Hsinchu |
| author_corporate_role | aut |
| author_facet | Lin, Chun-Cheng Lin, Bertrand M. T. Liotta, Giuseppe International Conference and Workshops on Algorithms and Computation Hsinchu |
| author_sort | International Conference and Workshops on Algorithms and Computation Hsinchu |
| building | Verbundindex |
| bvnumber | BV048865239 |
| classification_rvk | SS 4800 |
| ctrlnum | (OCoLC)1373392639 (DE-599)BVBBV048865239 |
| 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">BV048865239</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">230317s2023 xx a||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783031270505</subfield><subfield code="9">978-3-031-27050-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1373392639</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV048865239</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">International Conference and Workshops on Algorithms and Computation</subfield><subfield code="n">17.</subfield><subfield code="d">2023</subfield><subfield code="c">Hsinchu</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1283675919</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">17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings</subfield><subfield code="c">Petra Mutzel, Md. Saidur Rahman, Slamin (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">[2023]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2023</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xiii, 398 Seiten</subfield><subfield code="b">Illustrationen</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">13973</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">2023</subfield><subfield code="z">Hsinchu</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">Lin, Chun-Cheng</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lin, Bertrand M. T.</subfield><subfield code="0">(DE-588)1225818834</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Liotta, Giuseppe</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-031-27051-2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">13973</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">13973</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034130282</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2023 Hsinchu gnd-content |
| genre_facet | Konferenzschrift 2023 Hsinchu |
| id | DE-604.BV048865239 |
| illustrated | Illustrated |
| index_date | 2024-07-03T21:43:07Z |
| indexdate | 2025-01-10T15:21:39Z |
| institution | BVB |
| institution_GND | (DE-588)1283675919 |
| isbn | 9783031270505 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034130282 |
| oclc_num | 1373392639 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | xiii, 398 Seiten Illustrationen |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | International Conference and Workshops on Algorithms and Computation 17. 2023 Hsinchu Verfasser (DE-588)1283675919 aut WALCOM: algorithms and computation 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings Petra Mutzel, Md. Saidur Rahman, Slamin (eds.) Cham Springer [2023] © 2023 xiii, 398 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 13973 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 2023 Hsinchu 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 Lin, Chun-Cheng edt Lin, Bertrand M. T. (DE-588)1225818834 edt Liotta, Giuseppe edt Erscheint auch als Online-Ausgabe 978-3-031-27051-2 Lecture notes in computer science 13973 (DE-604)BV000000607 13973 |
| spellingShingle | WALCOM: algorithms and computation 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : 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 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings |
| title_auth | WALCOM: algorithms and computation 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings |
| title_exact_search | WALCOM: algorithms and computation 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings |
| title_exact_search_txtP | WALCOM: algorithms and computation 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings |
| title_full | WALCOM: algorithms and computation 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings Petra Mutzel, Md. Saidur Rahman, Slamin (eds.) |
| title_fullStr | WALCOM: algorithms and computation 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings Petra Mutzel, Md. Saidur Rahman, Slamin (eds.) |
| title_full_unstemmed | WALCOM: algorithms and computation 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : proceedings Petra Mutzel, Md. Saidur Rahman, Slamin (eds.) |
| title_short | WALCOM: algorithms and computation |
| title_sort | walcom algorithms and computation 17th international conference and workshops walcom 2023 hsinchu taiwan march 22 24 2023 proceedings |
| title_sub | 17th international conference and workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023 : 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 2023 Hsinchu |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT internationalconferenceandworkshopsonalgorithmsandcomputationhsinchu walcomalgorithmsandcomputation17thinternationalconferenceandworkshopswalcom2023hsinchutaiwanmarch22242023proceedings AT linchuncheng walcomalgorithmsandcomputation17thinternationalconferenceandworkshopswalcom2023hsinchutaiwanmarch22242023proceedings AT linbertrandmt walcomalgorithmsandcomputation17thinternationalconferenceandworkshopswalcom2023hsinchutaiwanmarch22242023proceedings AT liottagiuseppe walcomalgorithmsandcomputation17thinternationalconferenceandworkshopswalcom2023hsinchutaiwanmarch22242023proceedings |