A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution

dc.contributor.author	Bekos, Michael A.
dc.contributor.author	Geckeler, Christian
dc.contributor.author	Kaufmann, Michael
dc.contributor.author	Splett, Jan
dc.contributor.author	Förster, Henry
dc.contributor.author	Holländer, Lukas
dc.contributor.author	Spallek, Amadäus
dc.date.accessioned	2021-09-16T13:55:09Z
dc.date.available	2021-09-16T13:55:09Z
dc.date.issued	2021
dc.identifier.issn	1460-2067
dc.identifier.uri	http://hdl.handle.net/10900/119019
dc.language.iso	en	de_DE
dc.publisher	Oxford Univ Press	de_DE
dc.relation.uri	http://dx.doi.org/10.1093/comjnl/bxz133	de_DE
dc.subject.ddc	004	de_DE
dc.title	A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution	de_DE
dc.type	Article	de_DE
utue.quellen.id	20210512015105_01346
utue.publikation.seiten	7-26	de_DE
utue.personen.roh	Bekos, Michael A.
utue.personen.roh	Foerster, Henry
utue.personen.roh	Geckeler, Christian
utue.personen.roh	Hollaender, Lukas
utue.personen.roh	Kaufmann, Michael
utue.personen.roh	Spallek, Amadaeus M.
utue.personen.roh	Splett, Jan
dcterms.isPartOf.ZSTitelID	Computer Journal	de_DE
dcterms.isPartOf.ZS-Issue	1	de_DE
dcterms.isPartOf.ZS-Volume	64	de_DE
utue.fakultaet	07 Mathematisch-Naturwissenschaftliche Fakultät	de_DE