Computing Cartograms with Optimal Complexity

dc.contributor.author	Kaufmann, Michael	de_DE
dc.date.accessioned	2014-02-05T14:36:40Z
dc.date.available	2014-02-05T14:36:40Z
dc.date.issued	2013	de_DE
dc.identifier.issn	0179-5376	de_DE
dc.identifier.uri	http://hdl.handle.net/10900/40715
dc.language.iso	en	en
dc.publisher	Springer	de_DE
dc.relation.uri	http://dx.doi.org/10.1007/s00454-013-9521-1	de_DE
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject.ddc	004	de_DE
dc.subject.ddc	510	de_DE
dc.title	Computing Cartograms with Optimal Complexity	de_DE
dc.type	Article	de_DE
utue.quellen.id	20140116051827_00672	de_DE
utue.publikation.seiten	784-810	de_DE
utue.personen.roh	Alam, Md. Jawaherul	de_DE
utue.personen.roh	Biedl, Therese	de_DE
utue.personen.roh	Felsner, Stefan	de_DE
utue.personen.roh	Kaufmann, Michael	de_DE
utue.personen.roh	Kobourov, Stephen G.	de_DE
utue.personen.roh	Ueckerdt, Torsten	de_DE
dcterms.isPartOf.ZSTitelID	Discrete & Computational Geometry	de_DE
dcterms.isPartOf.ZS-Issue	3	de_DE
dcterms.isPartOf.ZS-Volume	50	de_DE
utue.fakultaet	07 Mathematisch-Naturwissenschaftliche Fakultät	de_DE