WALCOM: algorithms and computation: 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Elektronisch Tagungsbericht E-Book |
| Sprache: | English |
| Veröffentlicht: |
[Cham]
Springer
[2017]
|
| Schriftenreihe: | Lecture Notes in Computer Science
10167 |
| Schlagworte: | |
| Online-Zugang: | BTU01 FHA01 FHI01 FHM01 FHN01 FHR01 FKE01 FLA01 FRO01 FWS01 FWS02 HTW01 TUM01 UBA01 UBG01 UBM01 UBR01 UBT01 UBW01 UBY01 UER01 UPA01 Volltext |
| Beschreibung: | 1 Online-Ressource XXII, 474 Seiten Illustrationen, Diagramme |
| ISBN: | 9783319539256 |
| ISSN: | 0302-9743 |
| DOI: | 10.1007/978-3-319-53925-6 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV044206286 | ||
| 003 | DE-604 | ||
| 005 | 20211215 | ||
| 006 | a |||| 10||| | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 170302s2017 |||| o||u| ||||||eng d | ||
| 020 | |a 9783319539256 |c Online |9 978-3-319-53925-6 | ||
| 024 | 7 | |a 10.1007/978-3-319-53925-6 |2 doi | |
| 035 | |a (OCoLC)975065692 | ||
| 035 | |a (DE-599)BVBBV044206286 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-860 |a DE-91 |a DE-Aug4 |a DE-898 |a DE-861 |a DE-523 |a DE-859 |a DE-473 |a DE-29 |a DE-863 |a DE-20 |a DE-862 |a DE-92 |a DE-573 |a DE-M347 |a DE-703 |a DE-706 |a DE-739 |a DE-634 |a DE-384 |a DE-355 |a DE-188 |a DE-19 | ||
| 082 | 0 | |a 005.1 |2 23 | |
| 084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
| 084 | |a DAT 530f |2 stub | ||
| 084 | |a DAT 000 |2 stub | ||
| 111 | 2 | |a WALCOM |n 11. |d 2017 |c Hsinchu |j Verfasser |0 (DE-588)1127539612 |4 aut | |
| 245 | 1 | 0 | |a WALCOM: algorithms and computation |b 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings |c Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen (Eds.) |
| 264 | 1 | |a [Cham] |b Springer |c [2017] | |
| 264 | 4 | |c © 2017 | |
| 300 | |a 1 Online-Ressource XXII, 474 Seiten |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 Volume 10167 |x 0302-9743 | |
| 650 | 4 | |a Computer science | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer Science | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Informatik | |
| 650 | 0 | 7 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphenzeichnen |0 (DE-588)4706480-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |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 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 |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2016 |z Xinzhu |2 gnd-content | |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 29.03.2017-31.03.2017 |z Hsinchu |2 gnd-content | |
| 689 | 0 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | 1 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | 3 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 0 | 4 | |a Graphenzeichnen |0 (DE-588)4706480-8 |D s |
| 689 | 0 | 5 | |a Graph |0 (DE-588)4021842-9 |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 | 2 | |a Approximationsalgorithmus |0 (DE-588)4500954-5 |D s |
| 689 | 1 | 3 | |a Graphenzeichnen |0 (DE-588)4706480-8 |D s |
| 689 | 1 | 4 | |a Algorithmische Geometrie |0 (DE-588)4130267-9 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Poon, Sheung-Hung |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783319539249 |
| 830 | 0 | |a Lecture Notes in Computer Science |v 10167 |w (DE-604)BV014880109 |9 10167 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-319-53925-6 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SCS |a ZDB-2-LNC | ||
| 940 | 1 | |q ZDB-2-SCS_2017 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029612680 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l BTU01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l FHA01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l FHI01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l FHM01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l FHN01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l FHR01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l FKE01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l FLA01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l FRO01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l FWS01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l FWS02 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l HTW01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l TUM01 |p ZDB-2-LNC |q ZDB-2-LNC_2017 |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l UBA01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l UBG01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l UBM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l UBR01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l UBT01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l UBW01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l UBY01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l UER01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-53925-6 |l UPA01 |p ZDB-2-LNC |x Verlag |3 Volltext | |
Datensatz im Suchindex
| DE-BY-FWS_katkey | 639282 |
|---|---|
| _version_ | 1806180890204700672 |
| any_adam_object | |
| author2 | Poon, Sheung-Hung |
| author2_role | edt |
| author2_variant | s h p shp |
| author_corporate | WALCOM Hsinchu |
| author_corporate_role | aut |
| author_facet | Poon, Sheung-Hung WALCOM Hsinchu |
| author_sort | WALCOM Hsinchu |
| building | Verbundindex |
| bvnumber | BV044206286 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 530f DAT 000 |
| collection | ZDB-2-SCS ZDB-2-LNC |
| ctrlnum | (OCoLC)975065692 (DE-599)BVBBV044206286 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-3-319-53925-6 |
| format | Electronic Conference Proceeding eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05422nmm a2201021zcb4500</leader><controlfield tag="001">BV044206286</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20211215 </controlfield><controlfield tag="006">a |||| 10||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">170302s2017 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319539256</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-319-53925-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-319-53925-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)975065692</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044206286</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-91</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-92</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-384</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-19</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</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 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">11.</subfield><subfield code="d">2017</subfield><subfield code="c">Hsinchu</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1127539612</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">11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings</subfield><subfield code="c">Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen (Eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[Cham]</subfield><subfield code="b">Springer</subfield><subfield code="c">[2017]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2017</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource XXII, 474 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">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">Volume 10167</subfield><subfield code="x">0302-9743</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</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">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">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">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">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">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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2016</subfield><subfield code="z">Xinzhu</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">29.03.2017-31.03.2017</subfield><subfield code="z">Hsinchu</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="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="2"><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="3"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" 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="0" 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="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="2"><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="3"><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="4"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-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="700" ind1="1" ind2=" "><subfield code="a">Poon, Sheung-Hung</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">9783319539249</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture Notes in Computer Science</subfield><subfield code="v">10167</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">10167</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-319-53925-6</subfield><subfield code="x">Verlag</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_2017</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029612680</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="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-53925-6</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-319-53925-6</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-319-53925-6</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-319-53925-6</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-319-53925-6</subfield><subfield code="l">FHN01</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-319-53925-6</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-319-53925-6</subfield><subfield code="l">FKE01</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-319-53925-6</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-319-53925-6</subfield><subfield code="l">FRO01</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-319-53925-6</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-319-53925-6</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-319-53925-6</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-319-53925-6</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="q">ZDB-2-LNC_2017</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-319-53925-6</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-319-53925-6</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-319-53925-6</subfield><subfield code="l">UBM01</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-319-53925-6</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-319-53925-6</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-319-53925-6</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-319-53925-6</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-319-53925-6</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-319-53925-6</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 2016 Xinzhu gnd-content (DE-588)1071861417 Konferenzschrift 29.03.2017-31.03.2017 Hsinchu gnd-content |
| genre_facet | Konferenzschrift 2016 Xinzhu Konferenzschrift 29.03.2017-31.03.2017 Hsinchu |
| id | DE-604.BV044206286 |
| illustrated | Not Illustrated |
| indexdate | 2024-08-01T12:32:05Z |
| institution | BVB |
| institution_GND | (DE-588)1127539612 |
| isbn | 9783319539256 |
| issn | 0302-9743 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029612680 |
| oclc_num | 975065692 |
| open_access_boolean | |
| owner | DE-860 DE-91 DE-BY-TUM DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-523 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-20 DE-862 DE-BY-FWS DE-92 DE-573 DE-M347 DE-703 DE-706 DE-739 DE-634 DE-384 DE-355 DE-BY-UBR DE-188 DE-19 DE-BY-UBM |
| owner_facet | DE-860 DE-91 DE-BY-TUM DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-523 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-20 DE-862 DE-BY-FWS DE-92 DE-573 DE-M347 DE-703 DE-706 DE-739 DE-634 DE-384 DE-355 DE-BY-UBR DE-188 DE-19 DE-BY-UBM |
| physical | 1 Online-Ressource XXII, 474 Seiten Illustrationen, Diagramme |
| psigel | ZDB-2-SCS ZDB-2-LNC ZDB-2-SCS_2017 ZDB-2-LNC ZDB-2-LNC_2017 |
| publishDate | 2017 |
| publishDateSearch | 2017 |
| publishDateSort | 2017 |
| publisher | Springer |
| record_format | marc |
| series | Lecture Notes in Computer Science |
| series2 | Lecture Notes in Computer Science |
| spellingShingle | WALCOM: algorithms and computation 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings Lecture Notes in Computer Science Computer science Algorithms Computer Science Algorithm Analysis and Problem Complexity Informatik Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmus (DE-588)4001183-5 gnd Graphenzeichnen (DE-588)4706480-8 gnd Graph (DE-588)4021842-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Informatik (DE-588)4026894-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd |
| subject_GND | (DE-588)4500954-5 (DE-588)4001183-5 (DE-588)4706480-8 (DE-588)4021842-9 (DE-588)4134751-1 (DE-588)4026894-9 (DE-588)4130267-9 (DE-588)1071861417 |
| title | WALCOM: algorithms and computation 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings |
| title_auth | WALCOM: algorithms and computation 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings |
| title_exact_search | WALCOM: algorithms and computation 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings |
| title_full | WALCOM: algorithms and computation 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen (Eds.) |
| title_fullStr | WALCOM: algorithms and computation 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen (Eds.) |
| title_full_unstemmed | WALCOM: algorithms and computation 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen (Eds.) |
| title_short | WALCOM: algorithms and computation |
| title_sort | walcom algorithms and computation 11th international conference and workshops walcom 2017 hsinchu taiwan march 29 31 2017 proceedings |
| title_sub | 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings |
| topic | Computer science Algorithms Computer Science Algorithm Analysis and Problem Complexity Informatik Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmus (DE-588)4001183-5 gnd Graphenzeichnen (DE-588)4706480-8 gnd Graph (DE-588)4021842-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Informatik (DE-588)4026894-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd |
| topic_facet | Computer science Algorithms Computer Science Algorithm Analysis and Problem Complexity Informatik Approximationsalgorithmus Algorithmus Graphenzeichnen Graph Berechnungskomplexität Algorithmische Geometrie Konferenzschrift 2016 Xinzhu Konferenzschrift 29.03.2017-31.03.2017 Hsinchu |
| url | https://doi.org/10.1007/978-3-319-53925-6 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT walcomhsinchu walcomalgorithmsandcomputation11thinternationalconferenceandworkshopswalcom2017hsinchutaiwanmarch29312017proceedings AT poonsheunghung walcomalgorithmsandcomputation11thinternationalconferenceandworkshopswalcom2017hsinchutaiwanmarch29312017proceedings |