Verfügbarkeit: Algorithm theory - SWAT 2012 | Technische Universität München

Algorithm theory - SWAT 2012: 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4 - 6, 2012 ; proceedings

Gespeichert in:

Bibliographische Detailangaben
Körperschaft:	SWAT Helsinki (VerfasserIn)
Format:	Tagungsbericht Buch
Sprache:	Englisch
Veröffentlicht:	Berlin [u.a.] Springer 2012
Schriftenreihe:	Lecture Notes in Computer Science 7357
Schlagwörter:	Datenstruktur Algorithmische Geometrie Berechnungskomplexität Algorithmus Konferenzschrift > 2012 > Helsinki
Links:	http://deposit.dnb.de/cgi-bin/dokserv?id=4044009&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=025140539&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	XV, 400 S. graph. Darst.
ISBN:	3642311547 9783642311543

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV040285253
003	DE-604
005	20120709
007	t\|
008	120702s2012 gw d\|\|\| \|\|\|\| 10\|\|\| eng d
015			\|a 12,N22 \|2 dnb
016	7		\|a 1022534343 \|2 DE-101
020			\|a 3642311547 \|9 3-642-31154-7
020			\|a 9783642311543 \|c Pb. : ca. EUR 66.34 (DE) (freier Pr.), ca. EUR 68.20 (AT) (freier Pr.), ca. sfr 83.00 (freier Pr.) \|9 978-3-642-31154-3
024	3		\|a 9783642311543
028	5	2	\|a Best.-Nr.: 86120401
035			\|a (OCoLC)800506240
035			\|a (DE-599)DNB1022534343
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
044			\|a gw \|c XA-DE-BE
049			\|a DE-706 \|a DE-83 \|a DE-11 \|a DE-91G
082	0		\|a 004.015118 \|2 22/ger
084			\|a 004 \|2 sdnb
111	2		\|a SWAT \|n 13 \|d 2012 \|c Helsinki \|j Verfasser \|0 (DE-588)102384432X \|4 aut
245	1	0	\|a Algorithm theory - SWAT 2012 \|b 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4 - 6, 2012 ; proceedings \|c Fedor V. Fomin ... (eds.)
264		1	\|a Berlin [u.a.] \|b Springer \|c 2012
300			\|a XV, 400 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Lecture Notes in Computer Science \|v 7357
650	0	7	\|a Datenstruktur \|0 (DE-588)4011146-5 \|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 Berechnungskomplexität \|0 (DE-588)4134751-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 2012 \|z Helsinki \|2 gnd-content
689	0	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0	1	\|a Datenstruktur \|0 (DE-588)4011146-5 \|D s
689	0	2	\|a Berechnungskomplexität \|0 (DE-588)4134751-1 \|D s
689	0	3	\|a Algorithmische Geometrie \|0 (DE-588)4130267-9 \|D s
689	0		\|5 DE-604
700	1		\|a Fomin, Fedor V. \|e Sonstige \|0 (DE-588)142598348 \|4 oth
776	0	8	\|i Erscheint auch als \|n Online-Ausgabe \|z 978-3-642-31155-0
830		0	\|a Lecture Notes in Computer Science \|v 7357 \|w (DE-604)BV000000607 \|9 7357
856	4	2	\|m X:MVB \|q text/html \|u http://deposit.dnb.de/cgi-bin/dokserv?id=4044009&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=025140539&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-025140539

Datensatz im Suchindex

DE-BY-TUM_call_number	0102 DAT 001z 2001 A 999-7357
DE-BY-TUM_katkey	1865859
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040071418283
_version_	1821933869676363777
adam_text	IMAGE 1 TABLE O F C O N T E N T S A-VISIBILITY 1 MOHAMMAD GHODSI, ANIL MAHESHWARI, MOSTAFA NOURI, JORG-RIIDIGER SACK, AND HAMID ZARRABI-ZADEH PARTIAL MATCHING BETWEEN SURFACES USING FRECHET DISTANCE 13 JESSICA SHERETTE AND CAROLA WENK A POLYNOMIAL-TIME APPROXIMATION SCHEME FOR THE GEOMETRIC UNIQUE COVERAGE PROBLEM ON UNIT SQUARES 24 TAKEHIRO ITO, SHIN-ICHI NAKANO, YOSHIO OKAMOTO, YOTA OTACHI, RYUHEI UEHARA, TAKEAKI UNO, AND YUSHI UNO WATCHMAN ROUTES FOR LINES AND SEGMENTS 36 ADRIAN DUMITRESCU. JOSEPH S.B. MITCHELL, AND PAWEL ZYLINSKI KINETIC PIE DELAUNAY GRAPH AND ITS APPLICATIONS 48 MOHAMMAD ALI ABAM, ZAHED RAHMATI. AND ALIREZA ZAREI HIGHER ORDER CITY VORONOI DIAGRAMS -59 ANDREAS GEMSA, D. T. LEE, CHIH-HUNG LIU. AND DOROTHEA WAGNER ON MINIMUM SUM OF RADII AND DIAMETERS CLUSTERING 71 BABAK BEHSAZ AND MOHAMMAD R. SALAVATIPOUR A SIMPLE FRAMEWORK FOR THE GENERALIZED NEAREST NEIGHBOR P R O B L E M . . . . 83 TOMAS HRUZ AND MARCEL SCHDNGENS DETERMINISTIC PARAMETERIZED CONNECTED VERTEX COVER 9-5 MAREK CYGAN FASTER PARAMETERIZED ALGORITHMS FOR DELETION T O SPLIT GRAPHS 107 ESHA GHOSH, SUDESHNA KOLAY, MRINAL KUMAR, PRANABENDU MISRA, FAHAD PANOLAN, ASHUTOSH RAI. AND M.S. RAMANUJAN A SINGLE-EXPONENTIAL F P T ALGORITHM FOR THE AVMINOR COVER PROBLEM 119 EUN JUNG KIM, CHRISTOPHE PAUL, AND GEEVMYHESE PHILIP AN 0 ( N 3 LOG LOG N / LOG 2 N ) TIME ALGORITHM FOR ALL PAIRS SHORTEST PATHS 131 YIJIE HAN AND TADAO TAKAOKA HTTP://D-NB.INFO/1022534343 IMAGE 2 XIV TABLE OF CONTENTS LINEAR TIME ALGORITHM FOR COMPUTING A SMALL BICLIQUE IN GRAPHS WITHOUT LONG INDUCED PATHS 142 AISTIS ATMINAS, VADIM V. LOZIN. AND IGOR R.AZGON INDUCED DISJOINT PATHS IN AT-FREE GRAPHS 153 PETR A. GOLOVA.CH, DANIEL PAULUSMA, AND, ERIK JAN VAN LEEUWEN EFFECTIVE COMPUTATION OF IMMERSION OBSTRUCTIONS FOR UNIONS OF GRAPH CLASSES 165 ARCHONTIA C. GIANNOPOULOU, IOSIF SALEM, AND D M I T R I S ZOROS ALGORITHMS ON MINIMIZING THE MAXIMUM SENSOR MOVEMENT FOR BARRIER COVERAGE OF A LINEAR DOMAIN 177 DANNY Z. CHEN, YAN GU. JIA.N LI, AND HAITAO WANG ANNOTATING SIMPLICES WITH A HOMOLOGY BASIS AND ITS APPLICATIONS 189 OLEKSIY BUSARYEV. SERGIO CA.BELLO, CHAO CHEN. TAMAL K. DEY, AND YUSU WANG DO DIRECTIONAL ANTENNAS FACILITATE IN REDUCING INTERFERENCES? 201 R O M ASCHNER, MATTHEW J. KATZ. AND GILA MORGENSTERN MINIMUM CONVEX PARTITIONS AND MAXIMUM EMPTY POLYTOPES 213 ADRIAN DUMITRESCU, SA.RI.EL HAR-PELED, AND CSABA D. TOTH, A PROBABILISTIC ANALYSIS OF CHRISTOFIDES' ALGORITHM 225 MARKUS BLDSER, KONSTATINOS PANAGIOTOU, A/RID B. V. RAGHAVENDRA RAO NEW APPROXIMATION ALGORITHMS FOR THE UNSPLITTABIE CAPACITATED FACILITY LOCATION PROBLEM 237 BA.BAK BEHSAZ, MOHAMMAD R. SALAVAMPOUR, AND ZOYA SVITKINA NON-PREEMPTIVE SPEED SCALING 249 ANTONIOS ANT.ONI.ADIS AND G'HIEN-CHUNG HUANG A FAST ALGORITHM FOR PERMUTATION PATTERN MATCHING BASED ON ALTERNATING RUNS 261 MARIE-LOUISE BRUNEV AND MA.ITIN LACKNER SORTED RANGE REPORTING 271 YAKOV NEKRI.CH AND GONZALO NAVARRO STRING INDEXING FOR PATTERNS WITH WILDCARDS 283 PHILIP BILLE, INGE L I G0RT,Z, HJALTE WEDEL VILD,H0J, AND S0REN VIND LINEAR-SPACE DATA STRUCTURES FOR RANGE MINORITY QUERY IN ARRAYS 295 TIMOTHY M. CHAN, ST.EPH.ANE DUROCHER, MATTHEW SKALA, AND. BRYAN T. WILKINSON IMAGE 3 TABLE OF CONTENTS XV ASYNCHRONOUS RUMOR SPREADING IN PREFERENTIAL ATTACHMENT GRAPHS . . . . 307 BENJAMIN DOERR, MAHMOUD FOUZ, AND TOBIAS FRIEDRICH CONNECTIVITY ORACLES FOR PLANAR GRAPHS 316 GLENCORA BORRADAILE, SETH PETTIE, AND CHRISTIAN WULFF-NILSEN ACCESS GRAPHS RESULTS FOR LRU VERSUS FIFO UNDER RELATIVE WORST ORDER ANALYSIS 328 JOAN BOYAR, SUSHMITA GUPTA, AND K I M S. LARSEN COMPETITIVE ANALYSIS OF MAINTAINING FREQUENT ITEMS OF A STREAM 340 YIANNIS GIANNAKOPOULOS AND ELIAS KOUTSOUPIAS KERNEL BOUNDS FOR STRUCTURAL PARAMETERIZATIONS OF PATHWIDTH 352 HANS L. BODLAENDER, BART M.P. JANSEN, AND STEFAN KRATSCH KERNEL LOWER BOUNDS USING CO-NONDETERMINISM: FINDING INDUCED HEREDITARY SUBGRAPHS 364 STEFAN KRATSCH, MARCIN PILIPCZUK, ASHUTOSH RAI, AND VENKATESH RAMAN TESTING FORMULA SATISFACTION 376 ELDAR FISCHER, YONATAN GOLDHIRSH, AND ODED LACHISH RECONSTRUCTING STRINGS FROM SUBSTRINGS WITH QUANTUM QUERIES 388 RICHARD CLEVE, KAZUO IWAMA, FRANGOIS LE GALL, HARUMICHI NISHIMURA. SEIIEHIRO TANI, JUNICHI TERUYAMA, AND SHIGERU YAMASHITA A U T H O R I N D E X 399
any_adam_object	1
author_GND	(DE-588)142598348
author_corporate	SWAT Helsinki
author_corporate_role	aut
author_facet	SWAT Helsinki
author_sort	SWAT Helsinki
building	Verbundindex
bvnumber	BV040285253
classification_rvk	SS 4800
ctrlnum	(OCoLC)800506240 (DE-599)DNB1022534343
dewey-full	004.015118
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	004 - Computer science
dewey-raw	004.015118
dewey-search	004.015118
dewey-sort	14.015118
dewey-tens	000 - Computer science, information, general works
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">BV040285253</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120709</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">120702s2012 gw d\|\|\| \|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">12,N22</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1022534343</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642311547</subfield><subfield code="9">3-642-31154-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642311543</subfield><subfield code="c">Pb. : ca. EUR 66.34 (DE) (freier Pr.), ca. EUR 68.20 (AT) (freier Pr.), ca. sfr 83.00 (freier Pr.)</subfield><subfield code="9">978-3-642-31154-3</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642311543</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 86120401</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)800506240</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1022534343</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.015118</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">SWAT</subfield><subfield code="n">13</subfield><subfield code="d">2012</subfield><subfield code="c">Helsinki</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)102384432X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithm theory - SWAT 2012</subfield><subfield code="b">13th Scandinavian symposium and workshops, Helsinki, Finland, July 4 - 6, 2012 ; proceedings</subfield><subfield code="c">Fedor V. Fomin ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 400 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">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">7357</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</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">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">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">2012</subfield><subfield code="z">Helsinki</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">Datenstruktur</subfield><subfield code="0">(DE-588)4011146-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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="3"><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="700" ind1="1" ind2=" "><subfield code="a">Fomin, Fedor V.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)142598348</subfield><subfield code="4">oth</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-642-31155-0</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture Notes in Computer Science</subfield><subfield code="v">7357</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">7357</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=4044009&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=025140539&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-025140539</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2012 Helsinki gnd-content
genre_facet	Konferenzschrift 2012 Helsinki
id	DE-604.BV040285253
illustrated	Illustrated
indexdate	2025-01-11T19:04:37Z
institution	BVB
institution_GND	(DE-588)102384432X
isbn	3642311547 9783642311543
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-025140539
oclc_num	800506240
open_access_boolean
owner	DE-706 DE-83 DE-11 DE-91G DE-BY-TUM
owner_facet	DE-706 DE-83 DE-11 DE-91G DE-BY-TUM
physical	XV, 400 S. graph. Darst.
publishDate	2012
publishDateSearch	2012
publishDateSort	2012
publisher	Springer
record_format	marc
series	Lecture Notes in Computer Science
series2	Lecture Notes in Computer Science
spellingShingle	Algorithm theory - SWAT 2012 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4 - 6, 2012 ; proceedings Lecture Notes in Computer Science Datenstruktur (DE-588)4011146-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4011146-5 (DE-588)4130267-9 (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)1071861417
title	Algorithm theory - SWAT 2012 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4 - 6, 2012 ; proceedings
title_auth	Algorithm theory - SWAT 2012 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4 - 6, 2012 ; proceedings
title_exact_search	Algorithm theory - SWAT 2012 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4 - 6, 2012 ; proceedings
title_full	Algorithm theory - SWAT 2012 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4 - 6, 2012 ; proceedings Fedor V. Fomin ... (eds.)
title_fullStr	Algorithm theory - SWAT 2012 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4 - 6, 2012 ; proceedings Fedor V. Fomin ... (eds.)
title_full_unstemmed	Algorithm theory - SWAT 2012 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4 - 6, 2012 ; proceedings Fedor V. Fomin ... (eds.)
title_short	Algorithm theory - SWAT 2012
title_sort	algorithm theory swat 2012 13th scandinavian symposium and workshops helsinki finland july 4 6 2012 proceedings
title_sub	13th Scandinavian symposium and workshops, Helsinki, Finland, July 4 - 6, 2012 ; proceedings
topic	Datenstruktur (DE-588)4011146-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Datenstruktur Algorithmische Geometrie Berechnungskomplexität Algorithmus Konferenzschrift 2012 Helsinki
url	http://deposit.dnb.de/cgi-bin/dokserv?id=4044009&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=025140539&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000607
work_keys_str_mv	AT swathelsinki algorithmtheoryswat201213thscandinaviansymposiumandworkshopshelsinkifinlandjuly462012proceedings AT fominfedorv algorithmtheoryswat201213thscandinaviansymposiumandworkshopshelsinkifinlandjuly462012proceedings

Verfügbarkeit

Bestellen (Login erforderlich)

Inhaltsverzeichnis
Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik

Bestandsangaben von Teilbibliothek Mathematik & Informatik
Signatur:	0102 DAT 001z 2001 A 999-7357 Lageplan
Exemplar 1	Ausleihbar Am Standort