WALCOM: algorithms and computation: 13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : proceedings
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere beteiligte Personen: | |
| Format: | Tagungsbericht Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Cham
Springer
[2019]
|
| Schriftenreihe: | Lecture notes in computer science
11355 |
| Schlagwörter: | |
| Umfang: | XV, 420 Seiten Diagramme |
| ISBN: | 9783030105631 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV045427519 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 190128s2019 xx |||| |||| 10||| eng d | ||
| 020 | |a 9783030105631 |9 978-3-030-10563-1 | ||
| 035 | |a (OCoLC)1083874029 | ||
| 035 | |a (DE-599)BVBBV045427519 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-83 | ||
| 111 | 2 | |a WALCOM |n 13. |d 2019 |c Gauhati |j Verfasser |0 (DE-588)1176442570 |4 aut | |
| 245 | 1 | 0 | |a WALCOM: algorithms and computation |b 13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : proceedings |c Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano (eds.) |
| 264 | 1 | |a Cham |b Springer |c [2019] | |
| 300 | |a XV, 420 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 11355 | |
| 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 2019 |z Gauhati |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 Das, Gautam Kumar |4 edt | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-3-030-10564-8 |
| 830 | 0 | |a Lecture notes in computer science |v 11355 |w (DE-604)BV000000607 |9 11355 | |
| 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-030813268 | |
Datensatz im Suchindex
| _version_ | 1820980703206047744 |
|---|---|
| adam_text | |
| any_adam_object | |
| author2 | Das, Gautam Kumar |
| author2_role | edt |
| author2_variant | g k d gk gkd |
| author_corporate | WALCOM Gauhati |
| author_corporate_role | aut |
| author_facet | Das, Gautam Kumar WALCOM Gauhati |
| author_sort | WALCOM Gauhati |
| building | Verbundindex |
| bvnumber | BV045427519 |
| classification_rvk | SS 4800 |
| ctrlnum | (OCoLC)1083874029 (DE-599)BVBBV045427519 |
| 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">BV045427519</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">190128s2019 xx |||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783030105631</subfield><subfield code="9">978-3-030-10563-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1083874029</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045427519</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">13.</subfield><subfield code="d">2019</subfield><subfield code="c">Gauhati</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1176442570</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">13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : proceedings</subfield><subfield code="c">Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">[2019]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 420 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">11355</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">2019</subfield><subfield code="z">Gauhati</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">Das, Gautam Kumar</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-10564-8</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">11355</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">11355</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-030813268</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2019 Gauhati gnd-content |
| genre_facet | Konferenzschrift 2019 Gauhati |
| id | DE-604.BV045427519 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-11T19:08:47Z |
| institution | BVB |
| institution_GND | (DE-588)1176442570 |
| isbn | 9783030105631 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030813268 |
| oclc_num | 1083874029 |
| open_access_boolean | |
| owner | DE-83 |
| owner_facet | DE-83 |
| physical | XV, 420 Seiten Diagramme |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | WALCOM 13. 2019 Gauhati Verfasser (DE-588)1176442570 aut WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : proceedings Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano (eds.) Cham Springer [2019] XV, 420 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 11355 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 2019 Gauhati 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 Das, Gautam Kumar edt Erscheint auch als Online-Ausgabe 978-3-030-10564-8 Lecture notes in computer science 11355 (DE-604)BV000000607 11355 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : 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 13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : proceedings |
| title_auth | WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : proceedings |
| title_exact_search | WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : proceedings |
| title_full | WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : proceedings Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano (eds.) |
| title_fullStr | WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : proceedings Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano (eds.) |
| title_full_unstemmed | WALCOM: algorithms and computation 13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : proceedings Gautam K. Das, Partha S. Mandal, Krishnendu Mukhopadhyaya, Shin-ichi Nakano (eds.) |
| title_short | WALCOM: algorithms and computation |
| title_sort | walcom algorithms and computation 13th international conference walcom 2019 guwahati india february 27 march 2 2019 proceedings |
| title_sub | 13th international conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019 : 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 2019 Gauhati |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT walcomgauhati walcomalgorithmsandcomputation13thinternationalconferencewalcom2019guwahatiindiafebruary27march22019proceedings AT dasgautamkumar walcomalgorithmsandcomputation13thinternationalconferencewalcom2019guwahatiindiafebruary27march22019proceedings |