Algorithms - ESA 2011 19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2011
|
| Schriftenreihe: | Lecture notes in computer science
6942 |
| Schlagworte: | |
| Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV039589051 | ||
| 003 | DE-604 | ||
| 005 | 20111109 | ||
| 007 | t | ||
| 008 | 110919s2011 d||| |||| 10||| eng d | ||
| 015 | |a 11,N32 |2 dnb | ||
| 016 | 7 | |a 1014072948 |2 DE-101 | |
| 020 | |a 9783642237188 |c kart. : EUR 101.65 (DE) (freier Pr.), ca. sfr 126.50 (freier Pr.) |9 978-3-642-23718-8 | ||
| 020 | |a 3642237185 |9 3-642-23718-5 | ||
| 024 | 3 | |a 9783642237188 | |
| 028 | 5 | 2 | |a Best.-Nr.: 80112234 |
| 035 | |a (OCoLC)844930084 | ||
| 035 | |a (DE-599)DNB1014072948 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-11 |a DE-91G |a DE-83 | ||
| 082 | 0 | |a 518.1 |2 22/ger | |
| 082 | 0 | |a 005.1 |2 22/ger | |
| 084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
| 084 | |a 004 |2 sdnb | ||
| 084 | |a 510 |2 sdnb | ||
| 084 | |a DAT 530f |2 stub | ||
| 111 | 2 | |a ESA |n 19 |d 2011 |c Saarbrücken |j Verfasser |0 (DE-588)16181856-0 |4 aut | |
| 245 | 1 | 0 | |a Algorithms - ESA 2011 |b 19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings |c Camil Demetrescu ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2011 | |
| 300 | |a XIX, 813 S. |b graph. Darst. |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 6942 : Advanced research in computing and software science | |
| 500 | |a Literaturangaben | ||
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2011 |z Saarbrücken |2 gnd-content | |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Demetrescu, Camil |d 1971- |e Sonstige |0 (DE-588)133265749 |4 oth | |
| 710 | 2 | |a European Association for Theoretical Computer Science |e Sonstige |0 (DE-588)1024519-4 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 6942 |w (DE-604)BV000000607 |9 6942 | |
| 856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3863693&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024440186&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024440186 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0102/DAT 001z 2001 A 999-6942 |
|---|---|
| DE-BY-TUM_katkey | 1786353 |
| DE-BY-TUM_media_number | 040010216952 |
| _version_ | 1816713676408750080 |
| adam_text |
IMAGE 1
TABLE OF CONTENTS
APPROXIMATION ALGORITHMS I
POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR MAXIMIZING GROSS SUBSTITUTES
UTILITY UNDER BUDGET CONSTRAINTS 1
AKIYOSHI SHIOURA
APPROXIMATING THE SMALLEST 2-VERTEX CONNECTED SPANNING SUBGRAPH OF A
DIRECTED GRAPH 13
LOUKAS GEORGIADIS
IMPROVED APPROXIMATION ALGORITHMS FOR BIPARTITE CORRELATION CLUSTERING
25
NIR AILON, NOA AVIGDOR-ELGRABLI, EDO LIBERTY, AND ANKE VAN ZUYLEN
BOUNDS ON GREEDY ALGORITHMS FOR MAX SAT 37
MATTHIAS POLOCZEK
COMPUTATIONAL GEOMETRY I
APPROXIMATING MINIMUM M A N H A T T AN NETWORKS IN HIGHER D I M E N S I
O N S . . 49 APARNA DAS, EMDEN R. GANSNER, MICHAEL KAUFMANN, STEPHEN
KOBOUROV, JOACHIM SPOERHASE, AND ALEXANDER WOLFF
ON ISOLATING POINTS USING DISKS 61
MATT GIBSON, GAURAV KANADE, AND KASTURI VARADARAJAN
AN OUTPUT-SENSITIVE APPROACH FOR THE LI/LX, FC-NEAREST-NEIGHBOR VORONOI
DIAGRAM 70
CHIH-HUNG LIU, EVANTHIA PAPADOPOULOU, AND DER- TSAI LEE
CAN NEAREST NEIGHBOR SEARCHING BE SIMPLE AND ALWAYS FAST? 82 VICTOR
ALVAREZ, DAVID G. KIRKPATRICK, AND RAIMUND SEIDEL
GAME THEORY
ON THE APPROXIMATION PERFORMANCE OF FICTITIOUS PLAY IN FINITE GAMES 93
PAUL W. GOLDBERG, RAHUL SAVANI, TROELS BJERRE S0RENSEN, AND CARMINE
VENTRE
HOW PROFITABLE ARE STRATEGIC BEHAVIORS IN A MARKET? 106
NING CHEN, XIAOTIE DENG, AND JIE ZHANG
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1014072948
DIGITALISIERT DURCH
IMAGE 2
XIV TABLE OF CONTENTS
IMPROVING THE PRICE OF ANARCHY FOR SELFISH ROUTING VIA COORDINATION
MECHANISMS ' 119
GEORGE CHRISTODOULOU, KURT MEHLHORN, AND EVANGELIA PYRGA
GRAPH ALGORITHMS I
ALGORITHMS FOR FINDING A MAXIMUM NON-FC-LINKED GRAPH 131 YUSUKE
KOBAYASHI AND YUICHI YOSHIDA
AN (N 4 ) TIME ALGORITHM TO COMPUTE THE BISECTION WIDTH OF SOLID GRID
GRAPHS 143
ANDREAS EMIL FELDMANN AND PETER WIDMAYER
MIN-CUTS AND SHORTEST CYCLES IN PLANAR GRAPHS IN O (N LOG LOG N) TIME
155
JAKUB LQCKI AND PIOTR SANKOWSKI
STABLE MATCHINGS AND AUCTIONS
NEAR-POPULAR MATCHINGS IN THE ROOMMATES PROBLEM 167
CHIEN-CHUNG HUANG AND TELIKEPALLI KAVITHA
THE HOSPITALS/RESIDENTS PROBLEM WITH QUOTA LOWER BOUNDS 180 KOKI
LLAMADA, KAZUO IWAMA, AND SHUICHI MIYAZAKI
MULTI-PARAMETER MECHANISM DESIGN UNDER BUDGET AND MATROID CONSTRAINTS
192
MONIKA HENZINGER AND ANGELINA VIDALI
OPTIMIZATION
QUANTIFIED LINEAR PROGRAMS: A COMPUTATIONAL STUDY 203
THORSTEN EDERER, ULF LORENZ, ALEXANDER MARTIN, AND JAN WOLF
RECOVERABLE ROBUSTNESS BY COLUMN GENERATION 215
P.C. BOUMAN, J.M. VAN DEN AKKER, AND J.A. HOOGEVEEN
PASSENGER FLOW-ORIENTED TRAIN DISPOSITION 227
ANNABELL BERGER, CHRISTIAN BLAAR, ANDREAS GEBHARDT, MATTHIAS
MUELLER-HANNEMANN, AND MATHIAS SCHNEE
ONLINE ALGORITHMS I
ONE TO RULE THEM AU: A GENERAL RANDOMIZED ALGORITHM FOR BUFFER
MANAGEMENT WITH BOUNDED DELAY 239
LUKASZ JEZ
IMAGE 3
TABLE OF CONTENTS XV
BETTER BOUNDS FOR INCREMENTAL FREQUENCY ALLOCATION IN BIPARTITE GRAPHS
251
MAREK CHROBAK, LUKASZ JEZ, AND JIFI SGALL
TWO-BOUNDED-SPACE BIN PACKING REVISITED 263
MAREK CHROBAK, JIFI SGALL, AND GERHARD J. WOEGINGER
EXPONENTIAL-TIME ALGORITHMS
OUTPUT-SENSITIVE LISTING OF BOUNDED-SIZE TREES IN UNDIRECTED GRAPHS 275
RUI FERREIRA, ROBERTO GROSSI, AND ROMEO RIZZI
EXACT ALGORITHM FOR THE MAXIMUM INDUCED PLANAR SUBGRAPH PROBLEM 287
FEDOR V. FOMIN, LOAN TODINCA, AND YNGVE VILLANGER
SCHEDULING PARTIALLY ORDERED JOBS FASTER THAN 2* 299
MAREK CYGAN, MARCIN PILIPCZUK, MICHAL PILIPCZUK, AND JAKUB ONUFRY
WOJTASZCZYK
ONLINE ALGORITHMS I
ADCELL: AD ALLOCATION IN CELLULAR NETWORKS 311
SAEED ALAEI, MOHAMMAD T. HAJIAGHAYI, VAHID LIAGHAT, DAN PEI, AND BARNA
SAHA
SUBMODULAR MAX-SAT 323
YOSSI AZAR, IFTAH GAMZU, AND RAN ROTH
ON VARIANTS OF THE MATROID SECRETARY PROBLEM 335
SHAYAN OVEIS GHARAN AND JAN VONDRAK
HITTING SETS ONLINE AND VERTEX RANKING 347
GUY EVEN AND SHAKHAR SMORODINSKY
PARAMETERIZED ALGORITHMS
FAST SUB-EXPONENTIAL ALGORITHMS AND COMPACTNESS IN PLANAR GRAPHS . .
358 DIMITRIOS M. THILIKOS
ISOMORPHISM OF (MIS)LABELED GRAPHS 370
PASCAL SCHWEITZER
PATHS, FLOWERS AND VERTEX COVER 382
VENKATESH RAMAN, M.S. RAMANUJAN, AND SAKET SAURABH
IMAGE 4
XVI TABLE OF CONTENTS
HITTING AND HARVESTING PUMPKINS 394
GWENAEL JORET, CHRISTOPHE PAUL, JGNASI SAU, SAKET SAURABH, AND STEPHAN
THOMASSE
BEST PAPER SESSION
DETERMINISTIC DISCREPANCY MINIMIZATION 408
NIKHIL BANSAL AND JOEL SPENCER
PATTERN MATCHING IN LEMPEL-ZIV COMPRESSED STRINGS: FAST, SIMPLE, AND
DETERMINISTIC 421
PAWEL GAWRYCHOWSKI
GRAPH ALGORITHMS I
AN EXPERIMENTAL STUDY ON APPROXIMATING K SHORTEST SIMPLE PATHS . . 433
ASAF FRIEDER AND LIAM RODITTY
SCOPE-BASED ROUTE PLANNING 445
PETR HLINENY AND ONDREJ MORIS
MAXIMUM FLOWS BY INCREMENTAL BREADTH-FIRST SEARCH 457 ANDREW V.
GOLDBERG, SAGI HED, HAIM KAPLAN, ROBERT E. TARJAN, AND RENATO F. WERNECK
ENGINEERING MULTILEVEL GRAPH PARTITIONING ALGORITHMS 469 PETER SANDERS
AND CHRISTIAN SCHULZ
COMPUTATIONAL GEOMETRY II
A NEARLY OPTIMAL ALGORITHM FOR FINDING L\ SHORTEST PATHS AMONG POLYGONAL
OBSTACLES IN THE PLANE 481
DANNY Z. CHEN AND HAITAO WANG
MOTION PLANNING VIA MANIFOLD SAMPLES 493
OREN SALZMAN, MICHAEL HEMMER, BARAK RAVEH, AND DAN HALPERIN
RAY-SHOOTING DEPTH: COMPUTING STATISTICAL DATA DEPTH OF POINT SETS IN
THE PLANE 506
NABU H. MUSTAFA, SAURABH RAY, AND MUDASSIR SHABBIR
IMPROVED ALGORITHMS FOR PARTIAL CURVE MATCHING 518
ANIL MAHESHWARI, JOERG-RUEDIGER SACK, KAVEH SHAHBAZ, AND HAMID
ZARRABI-ZADEH
IMAGE 5
TABLE OF CONTENTS XVII
SCHEDULING
ON THE CONFIGURATION-LP FOR SCHEDULING ON UNRELATED MACHINES 530 JOSE
VERSCHAE AND ANDREAS WIESE
RESOURCE ALLOCATION FOR COVERING TIME VARYING DEMANDS 543 VENKATESAN T.
CHAKARAVARTHY, AMIT KUMAR, SAMBUDDHA ROY, AND YOGISH SABHARWAL
MIXED-CRITICALITY SCHEDULING OF SPORADIC TASK SYSTEMS 555 SANJOY K.
BARUAH, VINCENZO BONIFACI, GIANLORENZO D'ANGELO, ALBERTO
MARCHETTI-SPACCAMELA, SUZANNE VAN DER STER, AND LEEN STOUGIE
ROBUST ALGORITHMS FOR PREEMPTIVE SCHEDULING 567
LEAH EPSTEIN AND ASAF LEVIN
DATA STRUCTURES
APPROXIMATE DISTANCE QUERIES FOR WEIGHTED POLYHEDRAL SURFACES 579 HRISTO
N. DJIDJEV AND CHRISTIAN SOMMER
THE UNION OF PROBABILISTIC BOXES: MAINTAINING THE VOLUME 591 HAKAN
YILDIZ, LUCA FOSCHINI, JOHN HERSHBERGER, AND SUBHASH SURI
PREPROCESS, SET, QUERY! 603
ELY PORAT AND LIAM RODITTY
CUCKOO HASHING WITH PAGES 615
MARTIN DIETZFELBINGER, MICHAEL MITZENMACHER, AND MICHAEL RINK
APPROXIMATION ALGORITHMS I
APPROXIMATION ALGORITHMS AND HARDNESS RESULTS FOR THE JOINT
REPLENISHMENT PROBLEM WITH CONSTANT DEMANDS 628
ANDREAS S. SCHULZ AND CLAUDIO TELHA
APPROXIMATION ALGORITHMS FOR CONFLICT-FREE VEHICLE ROUTING 640 KASPAR
SCHUEPBACH AND RICO ZENKLUSEN
A | APPROXIMATION FOR A CONSTRAINED FOREST PROBLEM 652
BASILE COUETOUX
IMAGE 6
XVIII TABLE OF CONTENTS
GRAPHS AND GAMES
EXTERNAL-MEMORY NETWORK ANALYSIS ALGORITHMS FOR NATURALLY SPARSE GRAPHS
6 64
MICHAEL T. GOODRICH AND PAWEL PSZONA
APPROXIMATE COUNTING OF CYCLES IN STREAMS 677
MADHUSUDAN MANJUNATH, KURT MEHLHORN, KONSTANTINOS PANAGIOTOU, AND HE SUN
ALGORITHMS FOR SOLVING RUBIK'S CUBES 689
ERIK D. DEMAINE, MARTIN L. DEMAINE, SARAH EISENSTAT, ANNA LUBIW, AND
ANDREW WINSLOW
DISTRIBUTED COMPUTING AND NETWORKING
BOUNDARY PATROLLING BY MOBILE AGENTS WITH DISTINCT MAXIMAL SPEEDS 701
JUREK CZYZOWICZ, LESZEK GQ,SIENIEC, ADRIAN KOSOWSKI, AND EVANGELOS
KRANAKIS
OPTIMAL DISCOVERY STRATEGIES IN WHITE SPACE NETWORKS 713
YOSSI AZAR, ORI GUREL-GUREVICH, EYAL LUBETZKY, AND THOMAS MOSCIBRODA
SOCIAL-AWARE FORWARDING IMPROVES ROUTING PERFORMANCE IN POCKET SWITCHED
NETWORKS 723
JOSEP DIAZ, ALBERTO MARCHETTI-SPACCAMELA, DIETER MITSCHE, PAOLO SANTI,
AND JULINDA STEFA
STRINGS AND SORTING
TOLERANT ALGORITHMS 736
ROLF KLEIN, RAINER PENNINGER, CHRISTIAN SOHLER, AND DAVID P. WOODRUFF
ALPHABET-INDEPENDENT COMPRESSED TEXT INDEXING 748
DJAMAL BELAZZOUGUI AND GONZALO NAVARRO
DISTRIBUTION-AWARE COMPRESSED FULL-TEXT INDEXES 760
PAOLO FERRAGINA, JOUNI SIREN, AND ROSSANO VENTURINI
LOCAL SEARCH AND SET SYSTEMS
SMOOTHED PERFORMANCE GUARANTEES FOR LOCAL SEARCH 772
TOBIAS BRUNSCH, HEIKO ROEGLIN, CYRIEL RUTTEN, AND TJARK VREDEVELD
IMAGE 7
TABLE OF CONTENTS XIX
IMPROVED APPROXIMATIONS FOR /-EXCHANGE SYSTEMS (EXTENDED ABSTRACT) 784
MORAN FELDMAN, JOSEPH (SEFFI) NAOR, ROY SCHWARTZ, AND JUSTIN WARD
COVER-DECOMPOSITION AND POLYCHROMATIC NUMBERS 799
BELA BOLLOBAS, DAVID PRITCHARD, THOMAS ROTHVOSS, AND ALEX SCOTT
AUTHOR INDEX 811 |
| any_adam_object | 1 |
| author_GND | (DE-588)133265749 |
| author_corporate | ESA Saarbrücken |
| author_corporate_role | aut |
| author_facet | ESA Saarbrücken |
| author_sort | ESA Saarbrücken |
| building | Verbundindex |
| bvnumber | BV039589051 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)844930084 (DE-599)DNB1014072948 |
| dewey-full | 518.1 005.1 |
| dewey-hundreds | 500 - Natural sciences and mathematics 000 - Computer science, information, general works |
| dewey-ones | 518 - Numerical analysis 005 - Computer programming, programs, data, security |
| dewey-raw | 518.1 005.1 |
| dewey-search | 518.1 005.1 |
| dewey-sort | 3518.1 |
| dewey-tens | 510 - Mathematics 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| 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">BV039589051</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20111109</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110919s2011 d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">11,N32</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1014072948</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642237188</subfield><subfield code="c">kart. : EUR 101.65 (DE) (freier Pr.), ca. sfr 126.50 (freier Pr.)</subfield><subfield code="9">978-3-642-23718-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642237185</subfield><subfield code="9">3-642-23718-5</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642237188</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 80112234</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)844930084</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1014072948</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-706</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">518.1</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">22/ger</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">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">ESA</subfield><subfield code="n">19</subfield><subfield code="d">2011</subfield><subfield code="c">Saarbrücken</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)16181856-0</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms - ESA 2011</subfield><subfield code="b">19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings</subfield><subfield code="c">Camil Demetrescu ... (eds.)</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">XIX, 813 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">24 cm</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">6942 : Advanced research in computing and software science</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</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">2011</subfield><subfield code="z">Saarbrücken</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Demetrescu, Camil</subfield><subfield code="d">1971-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)133265749</subfield><subfield code="4">oth</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">European Association for Theoretical Computer Science</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1024519-4</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">6942</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">6942</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3863693&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</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=024440186&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024440186</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2011 Saarbrücken gnd-content |
| genre_facet | Konferenzschrift 2011 Saarbrücken |
| id | DE-604.BV039589051 |
| illustrated | Illustrated |
| indexdate | 2024-11-25T17:37:10Z |
| institution | BVB |
| institution_GND | (DE-588)16181856-0 (DE-588)1024519-4 |
| isbn | 9783642237188 3642237185 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024440186 |
| oclc_num | 844930084 |
| open_access_boolean | |
| owner | DE-706 DE-11 DE-91G DE-BY-TUM DE-83 |
| owner_facet | DE-706 DE-11 DE-91G DE-BY-TUM DE-83 |
| physical | XIX, 813 S. graph. Darst. 24 cm |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spellingShingle | Algorithms - ESA 2011 19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings Lecture notes in computer science Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)1071861417 |
| title | Algorithms - ESA 2011 19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings |
| title_auth | Algorithms - ESA 2011 19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings |
| title_exact_search | Algorithms - ESA 2011 19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings |
| title_full | Algorithms - ESA 2011 19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings Camil Demetrescu ... (eds.) |
| title_fullStr | Algorithms - ESA 2011 19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings Camil Demetrescu ... (eds.) |
| title_full_unstemmed | Algorithms - ESA 2011 19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings Camil Demetrescu ... (eds.) |
| title_short | Algorithms - ESA 2011 |
| title_sort | algorithms esa 2011 19th annual european symposium saarbrucken germany september 5 9 2011 proceedings |
| title_sub | 19th annual European symposium, Saarbrücken, Germany, September 5 - 9, 2011 ; proceedings |
| topic | Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmus Konferenzschrift 2011 Saarbrücken |
| url | http://deposit.dnb.de/cgi-bin/dokserv?id=3863693&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024440186&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT esasaarbrucken algorithmsesa201119thannualeuropeansymposiumsaarbruckengermanyseptember592011proceedings AT demetrescucamil algorithmsesa201119thannualeuropeansymposiumsaarbruckengermanyseptember592011proceedings AT europeanassociationfortheoreticalcomputerscience algorithmsesa201119thannualeuropeansymposiumsaarbruckengermanyseptember592011proceedings |