Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers
Saved in:
| Format: | Electronic Conference Proceeding eBook |
|---|---|
| Language: | English |
| Published: |
Berlin [u.a.]
Springer
2011
|
| Series: | Lecture Notes in Computer Science
6460 |
| Subjects: | |
| Online Access: | Volltext |
| Physical Description: | 1 Online-Ressource (XI, 418 S.) graph. Darst. |
| ISBN: | 9783642192227 |
| DOI: | 10.1007/978-3-642-19222-7 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV037322406 | ||
| 003 | DE-604 | ||
| 005 | 20110504 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 110406s2011 xx d||| o|||| 10||| eng d | ||
| 020 | |a 9783642192227 |c Online |9 978-3-642-19222-7 | ||
| 024 | 7 | |a 10.1007/978-3-642-19222-7 |2 doi | |
| 035 | |a (OCoLC)837978538 | ||
| 035 | |a (DE-599)BVBBV037322406 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-473 |a DE-19 |a DE-91 |a DE-739 |a DE-384 |a DE-M347 |a DE-20 |a DE-703 |a DE-355 |a DE-92 |a DE-Aug4 |a DE-859 |a DE-706 |a DE-634 | ||
| 084 | |a DAT 537f |2 stub | ||
| 084 | |a DAT 000 |2 stub | ||
| 245 | 1 | 0 | |a Combinatorial Algorithms |b 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers |c Costas S. Iliopoulos |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
| 300 | |a 1 Online-Ressource (XI, 418 S.) |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture Notes in Computer Science |v 6460 | |
| 650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 653 | |a Paperback / softback | ||
| 653 | |a Professional/practitioner | ||
| 653 | |a combinatorial enumeration | ||
| 653 | |a computational complexity | ||
| 653 | |a graph coloring | ||
| 653 | |a graph labeling | ||
| 653 | |a hypergraphs | ||
| 653 | |a matrix computation | ||
| 653 | |a network routing alorithms | ||
| 653 | |a parameterized algorithms | ||
| 653 | |a parameterized complexity | ||
| 653 | |a problem complexity | ||
| 653 | |a shortest path computation | ||
| 653 | |a string matching | ||
| 653 | |a tree matching | ||
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2010 |z London |2 gnd-content | |
| 689 | 0 | 0 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Iliopoulos, Costas S. |e Sonstige |4 oth | |
| 711 | 2 | |a IWOCA |n 21 |d 2010 |c London |j Sonstige |0 (DE-588)16105096-7 |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 978-3-642-19221-0 |
| 830 | 0 | |a Lecture Notes in Computer Science |v 6460 |w (DE-604)BV014880109 |9 6460 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-19222-7 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-LNC | ||
| 912 | |a ZDB-2-SCS | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-022476572 | |
Record in the Search Index
| _version_ | 1820875298027077632 |
|---|---|
| adam_text | |
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV037322406 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 537f DAT 000 |
| collection | ZDB-2-LNC ZDB-2-SCS |
| ctrlnum | (OCoLC)837978538 (DE-599)BVBBV037322406 |
| discipline | Informatik |
| doi_str_mv | 10.1007/978-3-642-19222-7 |
| format | Electronic Conference Proceeding eBook |
| 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">BV037322406</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110504</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">110406s2011 xx d||| o|||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642192227</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-642-19222-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-19222-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)837978538</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV037322406</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</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="245" ind1="1" ind2="0"><subfield code="a">Combinatorial Algorithms</subfield><subfield code="b">21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers</subfield><subfield code="c">Costas S. Iliopoulos</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XI, 418 S.)</subfield><subfield code="b">graph. Darst.</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">6460</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</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="653" ind1=" " ind2=" "><subfield code="a">Paperback / softback</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Professional/practitioner</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">combinatorial enumeration</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graph coloring</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graph labeling</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">hypergraphs</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">matrix computation</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">network routing alorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">parameterized algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">parameterized complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">problem complexity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">shortest path computation</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">string matching</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">tree matching</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2010</subfield><subfield code="z">London</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</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="700" ind1="1" ind2=" "><subfield code="a">Iliopoulos, Costas S.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">IWOCA</subfield><subfield code="n">21</subfield><subfield code="d">2010</subfield><subfield code="c">London</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16105096-7</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">978-3-642-19221-0</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture Notes in Computer Science</subfield><subfield code="v">6460</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">6460</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-19222-7</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-022476572</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2010 London gnd-content |
| genre_facet | Konferenzschrift 2010 London |
| id | DE-604.BV037322406 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:13:25Z |
| institution | BVB |
| institution_GND | (DE-588)16105096-7 |
| isbn | 9783642192227 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-022476572 |
| oclc_num | 837978538 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 DE-M347 DE-20 DE-703 DE-355 DE-BY-UBR DE-92 DE-Aug4 DE-859 DE-706 DE-634 |
| owner_facet | DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-91 DE-BY-TUM DE-739 DE-384 DE-M347 DE-20 DE-703 DE-355 DE-BY-UBR DE-92 DE-Aug4 DE-859 DE-706 DE-634 |
| physical | 1 Online-Ressource (XI, 418 S.) graph. Darst. |
| psigel | ZDB-2-LNC ZDB-2-SCS |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Springer |
| record_format | marc |
| series | Lecture Notes in Computer Science |
| series2 | Lecture Notes in Computer Science |
| spelling | Combinatorial Algorithms 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers Costas S. Iliopoulos Berlin [u.a.] Springer 2011 1 Online-Ressource (XI, 418 S.) graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Computer Science 6460 Kombinatorik (DE-588)4031824-2 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Paperback / softback Professional/practitioner combinatorial enumeration computational complexity graph coloring graph labeling hypergraphs matrix computation network routing alorithms parameterized algorithms parameterized complexity problem complexity shortest path computation string matching tree matching (DE-588)1071861417 Konferenzschrift 2010 London gnd-content Kombinatorik (DE-588)4031824-2 s Algorithmus (DE-588)4001183-5 s DE-604 Iliopoulos, Costas S. Sonstige oth IWOCA 21 2010 London Sonstige (DE-588)16105096-7 oth Erscheint auch als Druck-Ausgabe, Paperback 978-3-642-19221-0 Lecture Notes in Computer Science 6460 (DE-604)BV014880109 6460 https://doi.org/10.1007/978-3-642-19222-7 Verlag Volltext |
| spellingShingle | Combinatorial Algorithms 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers Lecture Notes in Computer Science Kombinatorik (DE-588)4031824-2 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4031824-2 (DE-588)4001183-5 (DE-588)1071861417 |
| title | Combinatorial Algorithms 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers |
| title_auth | Combinatorial Algorithms 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers |
| title_exact_search | Combinatorial Algorithms 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers |
| title_full | Combinatorial Algorithms 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers Costas S. Iliopoulos |
| title_fullStr | Combinatorial Algorithms 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers Costas S. Iliopoulos |
| title_full_unstemmed | Combinatorial Algorithms 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers Costas S. Iliopoulos |
| title_short | Combinatorial Algorithms |
| title_sort | combinatorial algorithms 21st international workshop iwoca 2010 london uk july 26 28 2010 revised selected papers |
| title_sub | 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers |
| topic | Kombinatorik (DE-588)4031824-2 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Kombinatorik Algorithmus Konferenzschrift 2010 London |
| url | https://doi.org/10.1007/978-3-642-19222-7 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT iliopouloscostass combinatorialalgorithms21stinternationalworkshopiwoca2010londonukjuly26282010revisedselectedpapers AT iwocalondon combinatorialalgorithms21stinternationalworkshopiwoca2010londonukjuly26282010revisedselectedpapers |