Verfügbarkeit: WALCOM: algorithms and computation

WALCOM: algorithms and computation: second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings

Gespeichert in:

Bibliographische Detailangaben
Format:	Elektronisch Tagungsbericht E-Book
Sprache:	English
Veröffentlicht:	Berlin [u.a.] Springer 2008
Schriftenreihe:	Lecture Notes in Computer Science 4921
Schlagworte:	Graph Algorithmische Geometrie Berechnungskomplexität Graphenzeichnen Algorithmus Konferenzschrift > 2008 > Dhaka
Online-Zugang:	DE-634 DE-M347 DE-91 DE-384 DE-473 DE-19 DE-703 DE-706 DE-739 DE-355 Volltext
Beschreibung:	1 Online-Ressource (XII, 239 S.) graph. Darst. 235 mm x 155 mm
ISBN:	354077890X 9783540778905 9783540778912
DOI:	10.1007/978-3-540-77891-2

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV023290882
003	DE-604
005	20080508
007	cr\|uuu---uuuuu
008	080506s2008 gw d\|\|\| o\|\|\|\| 10\|\|\| eng d
015			\|a 08,N05,0114 \|2 dnb
020			\|a 354077890X \|c : EUR 48.15 (freier Pr.), sfr 78.50 (freier Pr.) \|9 3-540-77890-X
020			\|a 9783540778905 \|c : EUR 48.15 (freier Pr.), sfr 78.50 (freier Pr.) \|9 978-3-540-77890-5
020			\|a 9783540778912 \|c Online \|9 978-3-540-77891-2
024	7		\|a 10.1007/978-3-540-77891-2 \|2 doi
024	3		\|a 9783540778905
028	5	2	\|a 12223176
035			\|a (OCoLC)254437095
035			\|a (DE-599)BVBBV023290882
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
044			\|a gw \|c XA-DE-BE
049			\|a DE-473 \|a DE-706 \|a DE-19 \|a DE-739 \|a DE-91 \|a DE-384 \|a DE-M347 \|a DE-703 \|a DE-634 \|a DE-355
084			\|a 004 \|2 sdnb
084			\|a DAT 000 \|2 stub
084			\|a DAT 530f \|2 stub
245	1	0	\|a WALCOM: algorithms and computation \|b second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings \|c Shin-ichi Nakano ... (eds.)
264		1	\|a Berlin [u.a.] \|b Springer \|c 2008
300			\|a 1 Online-Ressource (XII, 239 S.) \|b graph. Darst. \|c 235 mm x 155 mm
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	1		\|a Lecture Notes in Computer Science \|v 4921
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|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 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 2008 \|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 Algorithmische Geometrie \|0 (DE-588)4130267-9 \|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 Nakano, Shin-ichi \|e Sonstige \|4 oth
711	2		\|a WALCOM \|n 2 \|d 2008 \|c Dhaka \|j Sonstige \|0 (DE-588)10192940-7 \|4 oth
830		0	\|a Lecture Notes in Computer Science \|v 4921 \|w (DE-604)BV014880109 \|9 4921
856	4	0	\|u https://doi.org/10.1007/978-3-540-77891-2 \|x Verlag \|3 Volltext
912			\|a ZDB-2-SCS
943	1		\|a oai:aleph.bib-bvb.de:BVB01-016475496
966	e		\|u https://doi.org/10.1007/978-3-540-77891-2 \|l DE-634 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-540-77891-2 \|l DE-M347 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-540-77891-2 \|l DE-91 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-540-77891-2 \|l DE-384 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-540-77891-2 \|l DE-473 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-540-77891-2 \|l DE-19 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-540-77891-2 \|l DE-703 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-540-77891-2 \|l DE-706 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-540-77891-2 \|l DE-739 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-540-77891-2 \|l DE-355 \|p ZDB-2-SCS \|x Verlag \|3 Volltext

Datensatz im Suchindex

_version_	1820875036244836352
adam_text
adam_txt
any_adam_object
any_adam_object_boolean
building	Verbundindex
bvnumber	BV023290882
classification_rvk	SS 4800
classification_tum	DAT 000 DAT 530f
collection	ZDB-2-SCS
ctrlnum	(OCoLC)254437095 (DE-599)BVBBV023290882
discipline	Informatik
discipline_str_mv	Informatik
doi_str_mv	10.1007/978-3-540-77891-2
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">BV023290882</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20080508</controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">080506s2008 gw d\|\|\| o\|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">08,N05,0114</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">354077890X</subfield><subfield code="c">: EUR 48.15 (freier Pr.), sfr 78.50 (freier Pr.)</subfield><subfield code="9">3-540-77890-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540778905</subfield><subfield code="c">: EUR 48.15 (freier Pr.), sfr 78.50 (freier Pr.)</subfield><subfield code="9">978-3-540-77890-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783540778912</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-540-77891-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-540-77891-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783540778905</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">12223176</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)254437095</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023290882</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-473</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-355</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">DAT 000</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">WALCOM: algorithms and computation</subfield><subfield code="b">second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings</subfield><subfield code="c">Shin-ichi Nakano ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XII, 239 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">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">4921</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">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">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">2008</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">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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">Nakano, Shin-ichi</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WALCOM</subfield><subfield code="n">2</subfield><subfield code="d">2008</subfield><subfield code="c">Dhaka</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)10192940-7</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">4921</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">4921</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-540-77891-2</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</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-016475496</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77891-2</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77891-2</subfield><subfield code="l">DE-M347</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77891-2</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77891-2</subfield><subfield code="l">DE-384</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77891-2</subfield><subfield code="l">DE-473</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77891-2</subfield><subfield code="l">DE-19</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77891-2</subfield><subfield code="l">DE-703</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77891-2</subfield><subfield code="l">DE-706</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77891-2</subfield><subfield code="l">DE-739</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-540-77891-2</subfield><subfield code="l">DE-355</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2008 Dhaka gnd-content
genre_facet	Konferenzschrift 2008 Dhaka
id	DE-604.BV023290882
illustrated	Illustrated
index_date	2024-07-02T20:43:09Z
indexdate	2025-01-10T15:09:15Z
institution	BVB
institution_GND	(DE-588)10192940-7
isbn	354077890X 9783540778905 9783540778912
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-016475496
oclc_num	254437095
open_access_boolean
owner	DE-473 DE-BY-UBG DE-706 DE-19 DE-BY-UBM DE-739 DE-91 DE-BY-TUM DE-384 DE-M347 DE-703 DE-634 DE-355 DE-BY-UBR
owner_facet	DE-473 DE-BY-UBG DE-706 DE-19 DE-BY-UBM DE-739 DE-91 DE-BY-TUM DE-384 DE-M347 DE-703 DE-634 DE-355 DE-BY-UBR
physical	1 Online-Ressource (XII, 239 S.) graph. Darst. 235 mm x 155 mm
psigel	ZDB-2-SCS
publishDate	2008
publishDateSearch	2008
publishDateSort	2008
publisher	Springer
record_format	marc
series	Lecture Notes in Computer Science
series2	Lecture Notes in Computer Science
spelling	WALCOM: algorithms and computation second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings Shin-ichi Nakano ... (eds.) Berlin [u.a.] Springer 2008 1 Online-Ressource (XII, 239 S.) graph. Darst. 235 mm x 155 mm txt rdacontent c rdamedia cr rdacarrier Lecture Notes in Computer Science 4921 Graph (DE-588)4021842-9 gnd rswk-swf Algorithmische Geometrie (DE-588)4130267-9 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Graphenzeichnen (DE-588)4706480-8 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2008 Dhaka gnd-content Algorithmus (DE-588)4001183-5 s DE-604 Algorithmische Geometrie (DE-588)4130267-9 s Graphenzeichnen (DE-588)4706480-8 s Graph (DE-588)4021842-9 s Berechnungskomplexität (DE-588)4134751-1 s Nakano, Shin-ichi Sonstige oth WALCOM 2 2008 Dhaka Sonstige (DE-588)10192940-7 oth Lecture Notes in Computer Science 4921 (DE-604)BV014880109 4921 https://doi.org/10.1007/978-3-540-77891-2 Verlag Volltext
spellingShingle	WALCOM: algorithms and computation second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings Lecture Notes in Computer Science Graph (DE-588)4021842-9 gnd Algorithmische Geometrie (DE-588)4130267-9 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)4130267-9 (DE-588)4134751-1 (DE-588)4706480-8 (DE-588)4001183-5 (DE-588)1071861417
title	WALCOM: algorithms and computation second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings
title_auth	WALCOM: algorithms and computation second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings
title_exact_search	WALCOM: algorithms and computation second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings
title_exact_search_txtP	WALCOM: algorithms and computation second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings
title_full	WALCOM: algorithms and computation second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings Shin-ichi Nakano ... (eds.)
title_fullStr	WALCOM: algorithms and computation second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings Shin-ichi Nakano ... (eds.)
title_full_unstemmed	WALCOM: algorithms and computation second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings Shin-ichi Nakano ... (eds.)
title_short	WALCOM: algorithms and computation
title_sort	walcom algorithms and computation second international workshop walcom 2008 dhaka bangladesh february 7 8 2008 proceedings
title_sub	second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008 ; proceedings
topic	Graph (DE-588)4021842-9 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Graphenzeichnen (DE-588)4706480-8 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Graph Algorithmische Geometrie Berechnungskomplexität Graphenzeichnen Algorithmus Konferenzschrift 2008 Dhaka
url	https://doi.org/10.1007/978-3-540-77891-2
volume_link	(DE-604)BV014880109
work_keys_str_mv	AT nakanoshinichi walcomalgorithmsandcomputationsecondinternationalworkshopwalcom2008dhakabangladeshfebruary782008proceedings AT walcomdhaka walcomalgorithmsandcomputationsecondinternationalworkshopwalcom2008dhakabangladeshfebruary782008proceedings

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge