Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings
Gespeichert in:
Format: | Elektronisch Tagungsbericht E-Book |
---|---|
Sprache: | English |
Veröffentlicht: |
Cham
Springer International Publishing
2015
|
Schriftenreihe: | Lecture Notes in Computer Science
9079 |
Schlagworte: | |
Online-Zugang: | Volltext Inhaltsverzeichnis Abstract |
Beschreibung: | 1 Online-Ressource (XV, 430 p. 81 illus) |
ISBN: | 9783319181738 9783319181721 |
ISSN: | 0302-9743 |
DOI: | 10.1007/978-3-319-18173-8 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV042592256 | ||
003 | DE-604 | ||
005 | 20150709 | ||
006 | a |||| 10||| | ||
007 | cr|uuu---uuuuu | ||
008 | 150602s2015 |||| o||u| ||||||eng d | ||
020 | |a 9783319181738 |c Online |9 978-3-319-18173-8 | ||
020 | |a 9783319181721 |c Print |9 978-3-319-18172-1 | ||
024 | 7 | |a 10.1007/978-3-319-18173-8 |2 doi | |
035 | |a (OCoLC)910749436 | ||
035 | |a (DE-599)BVBBV042592256 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-91 |a DE-19 |a DE-384 |a DE-Aug4 |a DE-M347 |a DE-573 |a DE-859 |a DE-703 |a DE-473 |a DE-29 |a DE-706 |a DE-20 |a DE-739 |a DE-92 |a DE-634 |a DE-860 |a DE-861 |a DE-355 | ||
082 | 0 | |a 005.1 |2 23 | |
084 | |a DAT 000 |2 stub | ||
084 | |a DAT 517f |2 stub | ||
084 | |a DAT 530f |2 stub | ||
245 | 1 | 0 | |a Algorithms and Complexity |b 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings |c edited by Vangelis Th. Paschos, Peter Widmayer |
264 | 1 | |a Cham |b Springer International Publishing |c 2015 | |
300 | |a 1 Online-Ressource (XV, 430 p. 81 illus) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a Lecture Notes in Computer Science |v 9079 |x 0302-9743 | |
650 | 4 | |a Computer science | |
650 | 4 | |a Data structures (Computer science) | |
650 | 4 | |a Computer software | |
650 | 4 | |a Computational complexity | |
650 | 4 | |a Computer Science | |
650 | 4 | |a Algorithm Analysis and Problem Complexity | |
650 | 4 | |a Discrete Mathematics in Computer Science | |
650 | 4 | |a Data Structures | |
650 | 4 | |a Informatik | |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2015 |z Paris |2 gnd-content | |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Paschos, Vangelis Th. |e Sonstige |0 (DE-588)142243124 |4 oth | |
711 | 2 | |a CIAC |n 9. |d 2015 |c Paris |j Sonstige |0 (DE-588)1070409774 |4 oth | |
830 | 0 | |a Lecture Notes in Computer Science |v 9079 |w (DE-604)BV014880109 |9 9079 | |
856 | 4 | 0 | |u https://doi.org/10.1007/978-3-319-18173-8 |x Verlag |3 Volltext |
856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028025468&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
856 | 4 | 2 | |m Springer Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028025468&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |3 Abstract |
912 | |a ZDB-2-SCS |a ZDB-2-LNC | ||
940 | 1 | |q ZDB-2-SCS_2015 | |
940 | 1 | |q ZDB-2-LNC_2015 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-028025468 |
Datensatz im Suchindex
_version_ | 1804174755075457024 |
---|---|
adam_text | ALGORITHMS AND COMPLEXITY
/
: 2015
TABLE OF CONTENTS / INHALTSVERZEICHNIS
COMMUNICATION, DYNAMICS AND RENORMALIZATION
FAST AND POWERFUL HASHING USING TABULATION
GREEN BARRIER COVERAGE WITH MOBILE SENSORS
A REfiNED COMPLEXITY ANALYSIS OF FINDING THE MOST VITAL EDGES FOR
UNDIRECTED SHORTEST PATHS
ORTHOGONAL GRAPH DRAWING WITH INflEXIBLE EDGES
LINEAR TIME CONSTRUCTIONS OF SOME D-RESTRICTION PROBLEMS
EffiCIENTLY TESTING T-INTERVAL CONNECTIVITY IN DYNAMIC GRAPHS
COMPETITIVE STRATEGIES FOR ONLINE CLIQUE CLUSTERING
SCHEDULING WITH GAPS: NEW MODELS AND ALGORITHMS
MINMAX-DISTANCE GATHERING ON GIVEN MEETING POINTS
EVACUATING ROBOTS FROM A DISK USING FACE-TO-FACE COMMUNICATION
PLANARITY OF STREAMED GRAPHS
CLIQUE-WIDTH OF GRAPH CLASSES DEfiNED BY TWO FORBIDDEN INDUCED
SUBGRAPHS
RANDOMIZED ADAPTIVE TEST COVER
CONTRACTION BLOCKERS FOR GRAPHS WITH FORBIDDEN INDUCED PATHS
LABEL PLACEMENT IN ROAD MAPS
DISCRETE STOCHASTIC SUBMODULAR MAXIMIZATION: ADAPTIVE VS. NON-ADAPTIVE
VS. OfflINE
PARAMETERIZED ALGORITHMS AND KERNELS FOR 3-HITTING SET WITH PARITY
CONSTRAINTS
SIMPLE STRATEGIES VERSUS OPTIMAL SCHEDULES IN MULTI-AGENT PATROLLING
SHARING NON-ANONYMOUS COSTS OF MULTIPLE RESOURCES OPTIMALLY
ALGORITHMS SOLVING THE MATCHING CUT PROBLEM
END-VERTICES OF GRAPH SEARCH ALGORITHMS
DECIDING THE ON-LINE CHROMATIC NUMBER OF A GRAPH WITH PRE-COLORING IS
PSPACE-COMPLETE
A LEX-BFS-BASED RECOGNITION ALGORITHM FOR ROBINSONIAN MATRICES
MIXED MAP LABELING
OPTIMAL ONLINE EDGE COLORING OF PLANAR GRAPHS WITH ADVICE
APPROXIMABILITY OF TWO VARIANTS OF MULTIPLE KNAPSACK
BLOCK SORTING IS HARD
AN OPPORTUNISTIC TEXT INDEXING STRUCTURE BASED ON RUN LENGTH ENCODING
PSPACE-COMPLETENESS OF BLOXORZ AND OF GAMES WITH 2-BUTTONS
ADVICE COMPLEXITY OF FINE-GRAINED JOB SHOP SCHEDULING
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
ALGORITHMS AND COMPLEXITY
/
: 2015
ABSTRACT / INHALTSTEXT
THIS BOOK CONSTITUTES THE REFEREED CONFERENCE PROCEEDINGS OF THE 9TH
INTERNATIONAL CONFERENCE ON ALGORITHMS AND COMPLEXITY, CIAC 2015, HELD
IN PARIS, FRANCE, IN MAY 2015. THE 30 REVISED FULL PAPERS PRESENTED WERE
CAREFULLY REVIEWED AND SELECTED FROM 93 SUBMISSIONS AND ARE PRESENTED
TOGETHER WITH 2 INVITED PAPERS. THE PAPERS PRESENT ORIGINAL RESEARCH IN
THE THEORY AND APPLICATIONS OF ALGORITHMS AND COMPUTATIONAL COMPLEXITY
DIESES SCHRIFTSTUECK WURDE MASCHINELL ERZEUGT.
|
any_adam_object | 1 |
author_GND | (DE-588)142243124 |
building | Verbundindex |
bvnumber | BV042592256 |
classification_tum | DAT 000 DAT 517f DAT 530f |
collection | ZDB-2-SCS ZDB-2-LNC |
ctrlnum | (OCoLC)910749436 (DE-599)BVBBV042592256 |
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-18173-8 |
format | Electronic Conference Proceeding eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02890nmm a2200625zcb4500</leader><controlfield tag="001">BV042592256</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150709 </controlfield><controlfield tag="006">a |||| 10||| </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150602s2015 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319181738</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-319-18173-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319181721</subfield><subfield code="c">Print</subfield><subfield code="9">978-3-319-18172-1</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-319-18173-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)910749436</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042592256</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-355</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">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms and Complexity</subfield><subfield code="b">9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings</subfield><subfield code="c">edited by Vangelis Th. Paschos, Peter Widmayer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer International Publishing</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XV, 430 p. 81 illus)</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">9079</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">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</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">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-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">2015</subfield><subfield code="z">Paris</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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">Paschos, Vangelis Th.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)142243124</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">CIAC</subfield><subfield code="n">9.</subfield><subfield code="d">2015</subfield><subfield code="c">Paris</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1070409774</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture Notes in Computer Science</subfield><subfield code="v">9079</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">9079</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-319-18173-8</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028025468&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Springer Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028025468&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Abstract</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_2015</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-LNC_2015</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028025468</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2015 Paris gnd-content |
genre_facet | Konferenzschrift 2015 Paris |
id | DE-604.BV042592256 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:05:26Z |
institution | BVB |
institution_GND | (DE-588)1070409774 |
isbn | 9783319181738 9783319181721 |
issn | 0302-9743 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028025468 |
oclc_num | 910749436 |
open_access_boolean | |
owner | DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-384 DE-Aug4 DE-M347 DE-573 DE-859 DE-703 DE-473 DE-BY-UBG DE-29 DE-706 DE-20 DE-739 DE-92 DE-634 DE-860 DE-861 DE-355 DE-BY-UBR |
owner_facet | DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-384 DE-Aug4 DE-M347 DE-573 DE-859 DE-703 DE-473 DE-BY-UBG DE-29 DE-706 DE-20 DE-739 DE-92 DE-634 DE-860 DE-861 DE-355 DE-BY-UBR |
physical | 1 Online-Ressource (XV, 430 p. 81 illus) |
psigel | ZDB-2-SCS ZDB-2-LNC ZDB-2-SCS_2015 ZDB-2-LNC_2015 |
publishDate | 2015 |
publishDateSearch | 2015 |
publishDateSort | 2015 |
publisher | Springer International Publishing |
record_format | marc |
series | Lecture Notes in Computer Science |
series2 | Lecture Notes in Computer Science |
spelling | Algorithms and Complexity 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings edited by Vangelis Th. Paschos, Peter Widmayer Cham Springer International Publishing 2015 1 Online-Ressource (XV, 430 p. 81 illus) txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Computer Science 9079 0302-9743 Computer science Data structures (Computer science) Computer software Computational complexity Computer Science Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures Informatik Algorithmus (DE-588)4001183-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2015 Paris gnd-content Algorithmus (DE-588)4001183-5 s Komplexitätstheorie (DE-588)4120591-1 s DE-604 Paschos, Vangelis Th. Sonstige (DE-588)142243124 oth CIAC 9. 2015 Paris Sonstige (DE-588)1070409774 oth Lecture Notes in Computer Science 9079 (DE-604)BV014880109 9079 https://doi.org/10.1007/978-3-319-18173-8 Verlag Volltext Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028025468&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Springer Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028025468&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Abstract |
spellingShingle | Algorithms and Complexity 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings Lecture Notes in Computer Science Computer science Data structures (Computer science) Computer software Computational complexity Computer Science Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures Informatik Algorithmus (DE-588)4001183-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
subject_GND | (DE-588)4001183-5 (DE-588)4120591-1 (DE-588)1071861417 |
title | Algorithms and Complexity 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings |
title_auth | Algorithms and Complexity 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings |
title_exact_search | Algorithms and Complexity 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings |
title_full | Algorithms and Complexity 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings edited by Vangelis Th. Paschos, Peter Widmayer |
title_fullStr | Algorithms and Complexity 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings edited by Vangelis Th. Paschos, Peter Widmayer |
title_full_unstemmed | Algorithms and Complexity 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings edited by Vangelis Th. Paschos, Peter Widmayer |
title_short | Algorithms and Complexity |
title_sort | algorithms and complexity 9th international conference ciac 2015 paris france may 20 22 2015 proceedings |
title_sub | 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings |
topic | Computer science Data structures (Computer science) Computer software Computational complexity Computer Science Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures Informatik Algorithmus (DE-588)4001183-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
topic_facet | Computer science Data structures (Computer science) Computer software Computational complexity Computer Science Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures Informatik Algorithmus Komplexitätstheorie Konferenzschrift 2015 Paris |
url | https://doi.org/10.1007/978-3-319-18173-8 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028025468&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=028025468&sequence=000003&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV014880109 |
work_keys_str_mv | AT paschosvangelisth algorithmsandcomplexity9thinternationalconferenceciac2015parisfrancemay20222015proceedings AT ciacparis algorithmsandcomplexity9thinternationalconferenceciac2015parisfrancemay20222015proceedings |