Verfügbarkeit: WALCOM: Algorithm and Computation | Technische Universität München

WALCOM: Algorithm and Computation: 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings

Gespeichert in:

Bibliographische Detailangaben
Körperschaft:	WALCOM Dhaka (VerfasserIn)
Format:	Tagungsbericht Buch
Sprache:	Englisch
Veröffentlicht:	Berlin [u.a.] Springer 2012
Schriftenreihe:	Lecture notes in computer science 7157
Schlagwörter:	Graph Approximationsalgorithmus Berechnungskomplexität Graphenzeichnen Algorithmus Konferenzschrift > 2012 > Dhaka
Links:	http://deposit.dnb.de/cgi-bin/dokserv?id=3950281&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=024726605&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	XV, 240 S. graph. Darst. 235 mm x 155 mm
ISBN:	3642280757 9783642280757

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV039867189
003	DE-604
005	20120504
007	t\|
008	120206s2012 xx d\|\|\| \|\|\|\| 10\|\|\| eng d
015			\|a 12,N02 \|2 dnb
016	7		\|a 1018439153 \|2 DE-101
020			\|a 3642280757 \|9 3-642-28075-7
020			\|a 9783642280757 \|c Pb. : EUR 49.22 (DE) (freier Pr.), ca. EUR 50.60 (AT) (freier Pr.), ca. sfr 61.50 (freier Pr.) \|9 978-3-642-28075-7
024	3		\|a 9783642280757
028	5	2	\|a Best.-Nr.: 86039480
035			\|a (OCoLC)908261803
035			\|a (DE-599)DNB1018439153
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-706 \|a DE-83 \|a DE-11 \|a DE-91G
082	0		\|a 004.015113 \|2 22/ger
084			\|a 004 \|2 sdnb
084			\|a 510 \|2 sdnb
111	2		\|a WALCOM \|n 6 \|d 2012 \|c Dhaka \|j Verfasser \|0 (DE-588)16339045-9 \|4 aut
245	1	0	\|a WALCOM: Algorithm and Computation \|b 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings \|c Md. Saidur Rahman ... (eds.)
264		1	\|a Berlin [u.a.] \|b Springer \|c 2012
300			\|a XV, 240 S. \|b graph. Darst. \|c 235 mm x 155 mm
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Lecture notes in computer science \|v 7157
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 Berechnungskomplexität \|0 (DE-588)4134751-1 \|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
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 2012 \|z Dhaka \|2 gnd-content
689	0	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0		\|5 DE-604
689	1	0	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|D s
689	1		\|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 Berechnungskomplexität \|0 (DE-588)4134751-1 \|D s
689	4		\|5 DE-604
700	1		\|a Rahman, Md. Saidur \|d 1966- \|e Sonstige \|0 (DE-588)140356304 \|4 oth
776	0	8	\|i Erscheint auch als \|n Online-Ausgabe \|z 978-3-642-28076-4
830		0	\|a Lecture notes in computer science \|v 7157 \|w (DE-604)BV000000607 \|9 7157
856	4	2	\|m X:MVB \|q text/html \|u http://deposit.dnb.de/cgi-bin/dokserv?id=3950281&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=024726605&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-024726605

Datensatz im Suchindex

DE-BY-TUM_call_number	0102 DAT 001z 2001 A 999-7157
DE-BY-TUM_katkey	1852574
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040071414507
_version_	1821933763784867840
adam_text	IMAGE 1 TABLE OF CONTENTS INVITED TALKS COMBINATORIAL OPTIMIZATION WITH NOISY INPUTS: HOW CAN WE SEPARATE THE WHEAT FROM THE CHAFF? 1 PETER WIDMAYER APPROXIMABILITY OF STABLE MATCHING PROBLEMS 2 KAZUO IWAMA ON THREE-DIMENSIONAL GRAPH DRAWING AND EMBEDDING 3 SUE WHITESIDES GRAPH ALGORITHMS I BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION 5 TAKEAKI UNO, RYUHEI UEHARA, AND SHIN-ICHI NAKANO GENERALIZED ABOVE GUARANTEE VERTEX COVER AND R-PARTIZATION 17 R. KRITHIKA AND N.S. NARAYANASWAMY COMPUTATIONAL GEOMETRY FARTHEST VORONOI DIAGRAMS UNDER TRAVEL TIME METRICS 28 SANG WON BAE AND KYUNG- YONG CHWA T I G HT B O U ND FOR F A R T H E S T - C O L OR V O R O N OI D I A G R A MS OF LINE S E G M E N TS . . . 40 SANG WON BAE RANGE AGGREGATE MAXIMAL POINTS IN THE PLANE 52 ANANDA SWARUP DAS, PROSENJIT GUPTA, ANIL KISHORE KALAVAGATTU, JATIN AGARWAL, KANNAN SRINATHAN, AND KISHORE KOTHAPALLI APPROXIMATION ALGORITHMS APPROXIMATING THE MULTI-LEVEL BOTTLENECK ASSIGNMENT PROBLEM 64 TRIVIKRAM DOKKA, ANASTASIA KOUVELA, AND FRITS C.R. SPIEKSMA REOPTIMIZATION OF THE MAXIMUM WEIGHTED PFC-FREE SUBGRAPH PROBLEM UNDER VERTEX INSERTION 76 NICOLAS BORIA, JEROME MONNOT, AND VANGELIS TH. PASCHOS BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1018439153 DIGITALISIERT DURCH IMAGE 2 XIV TABLE OF CONTENTS COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES 88 FRANZ J. BRANDENBURG, ANDREAS GLEISSNER, AND ANDREAS HOFMEIER GRAPH ALGORITHMS II ON THE ROUND-TRIP 1-CENTER AND 1-MEDIAN PROBLEMS 100 BIING-FENG WANG, JHIH-HONG YE, AND PEI-JUNG CHEN TRIANGLE-FREE OUTERPLANAR 3-GRAPHS ARE PAIRWISE COMPATIBILITY GRAPHS 112 SAMMI ABIDA SALMA AND MD. SAIDUR RAHMAN ON RELAXING THE CONSTRAINTS IN PAIRWISE COMPATIBILITY GRAPHS 124 TIZIANA CALAMONERI, ROSSELLA PETRESCHI, AND BLERINA SINAIMERI GRAPH DRAWING I UNIVERSAL LINE-SETS FOR DRAWING PLANAR 3-TREES 136 MD. IQBAL HOSSAIN, DEBAJYOTI MONDAI, MD. SAIDUR RAHMAN, AND SAMMI ABIDA SALMA ON THE HARDNESS OF POINT-SET EMBEDDABILITY 148 STEPHANE DUROCHER AND DEBAJYOTI MONDAI STRING AND DATA STRUCTURES LINEAR TIME INFERENCE OF STRINGS FROM COVER ARRAYS USING A BINARY ALPHABET 160 TANAEEM M. MOOSA, SUMAIYA NAZEEN, M. SOHEL RAHMAN, AND REZWANA REAZ FAT HEAPS WITHOUT REGULAR COUNTERS 173 AMR ELMASRY AND JYRKI KATAJAINEN GRAPH DRAWING II DRAWING GRAPHS WITH VERTICES AT SPECIFIED POSITIONS AND CROSSINGS AT LARGE ANGLES 186 MARTIN FINK, JAN-HENRIK HAUNERT, TAMARA MCHEDLIDZE, JOACHIM SPOERHASE, AND ALEXANDER WOLFF DRAWING UNORDERED TREES ON FC-GRIDS 198 CHRISTIAN BACHMAIER AND MARCO MATZEDER HEURISTICS FOR THE MAXIMUM 2-LAYER RAC SUBGRAPH PROBLEM 211 EMILIO DI GIACOMO, WALTER DIDIMO, LUCA GRILLI, GIUSEPPE LIOTTA, AND SALVATORE A. ROMEO IMAGE 3 TABLE OF CONTENTS XV GAMES AND CRYPTOGRAPHY NASH EQUILIBRIA WITH MINIMUM POTENTIAL IN UNDIRECTED BROADCAST GAMES 217 YASUSHI KAWASE AND KAZUHISA MAKINO CALCULATING AVERAGE JOINT HAMMING WEIGHT FOR MINIMAL WEIGHT CONVERSION OF D INTEGERS 229 VORAPONG SUPPAKITPAISARN, MASATO EDAHIRO, AND HIROSHI IMAI AUTHOR INDEX 241
any_adam_object	1
author_GND	(DE-588)140356304
author_corporate	WALCOM Dhaka
author_corporate_role	aut
author_facet	WALCOM Dhaka
author_sort	WALCOM Dhaka
building	Verbundindex
bvnumber	BV039867189
classification_rvk	SS 4800
ctrlnum	(OCoLC)908261803 (DE-599)DNB1018439153
dewey-full	004.015113
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	004 - Computer science
dewey-raw	004.015113
dewey-search	004.015113
dewey-sort	14.015113
dewey-tens	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">BV039867189</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120504</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">120206s2012 xx d\|\|\| \|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">12,N02</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1018439153</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642280757</subfield><subfield code="9">3-642-28075-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642280757</subfield><subfield code="c">Pb. : EUR 49.22 (DE) (freier Pr.), ca. EUR 50.60 (AT) (freier Pr.), ca. sfr 61.50 (freier Pr.)</subfield><subfield code="9">978-3-642-28075-7</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642280757</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 86039480</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)908261803</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1018439153</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-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.015113</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="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">6</subfield><subfield code="d">2012</subfield><subfield code="c">Dhaka</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)16339045-9</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">WALCOM: Algorithm and Computation</subfield><subfield code="b">6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings</subfield><subfield code="c">Md. Saidur Rahman ... (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, 240 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">235 mm x 155 mm</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">7157</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">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">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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2012</subfield><subfield code="z">Dhaka</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="689" ind1="1" ind2="0"><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=" "><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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</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">Rahman, Md. Saidur</subfield><subfield code="d">1966-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)140356304</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-28076-4</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7157</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">7157</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=3950281&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=024726605&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-024726605</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2012 Dhaka gnd-content
genre_facet	Konferenzschrift 2012 Dhaka
id	DE-604.BV039867189
illustrated	Illustrated
indexdate	2025-01-11T19:04:19Z
institution	BVB
institution_GND	(DE-588)16339045-9
isbn	3642280757 9783642280757
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-024726605
oclc_num	908261803
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, 240 S. graph. Darst. 235 mm x 155 mm
publishDate	2012
publishDateSearch	2012
publishDateSort	2012
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spellingShingle	WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings Lecture notes in computer science Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4021842-9 (DE-588)4500954-5 (DE-588)4134751-1 (DE-588)4706480-8 (DE-588)4001183-5 (DE-588)1071861417
title	WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings
title_auth	WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings
title_exact_search	WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings
title_full	WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings Md. Saidur Rahman ... (eds.)
title_fullStr	WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings Md. Saidur Rahman ... (eds.)
title_full_unstemmed	WALCOM: Algorithm and Computation 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings Md. Saidur Rahman ... (eds.)
title_short	WALCOM: Algorithm and Computation
title_sort	walcom algorithm and computation 6th international workshop walcom 2012 dhaka bangladesh february 15 17 2012 proceedings
title_sub	6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012 ; proceedings
topic	Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Graph Approximationsalgorithmus Berechnungskomplexität Graphenzeichnen Algorithmus Konferenzschrift 2012 Dhaka
url	http://deposit.dnb.de/cgi-bin/dokserv?id=3950281&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=024726605&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000607
work_keys_str_mv	AT walcomdhaka walcomalgorithmandcomputation6thinternationalworkshopwalcom2012dhakabangladeshfebruary15172012proceedings AT rahmanmdsaidur walcomalgorithmandcomputation6thinternationalworkshopwalcom2012dhakabangladeshfebruary15172012proceedings

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-7157 Lageplan
Exemplar 1	Ausleihbar Am Standort