A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution

dc.contributor.author	Bekos, Michael A.
dc.contributor.author	Förster, Henry
dc.contributor.author	Geckeler, Christian
dc.contributor.author	Holländer, Lukas
dc.contributor.author	Kaufmann, Michael
dc.contributor.author	Spallek, Amadäus
dc.contributor.author	Splett, Jan
dc.date.accessioned	2019-03-18T14:44:24Z
dc.date.available	2019-03-18T14:44:24Z
dc.date.issued	2018
dc.identifier.isbn	978-3-030-04414-5
dc.identifier.isbn	978-3-030-04413-8
dc.identifier.uri	http://hdl.handle.net/10900/87091
dc.language.iso	en	de_DE
dc.publisher	Cham : Springer	de_DE
dc.relation.ispartofseries	Lecture Notes in Computer Science;11282
dc.relation.uri	http://dx.doi.org/10.1007/978-3-030-04414-5_19	de_DE
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject.ddc	004	de_DE
dc.title	A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution	de_DE
dc.type	BookPart	de_DE
dc.type	ConferenceObject	de_DE
utue.publikation.seiten	271-285	de_DE
utue.personen.roh	Bekos, Michael A.
utue.personen.roh	Förster, Henry
utue.personen.roh	Geckeler, Christian
utue.personen.roh	Holländer, Lukas
utue.personen.roh	Kaufmann, Michael
utue.personen.roh	Spallek, Amadäus M.
utue.personen.roh	Splett, Jan
utue.publikation.buchdesbeitrags	Biedl T., Kerren A. (eds) Graph Drawing and Network Visualization. GD 2018	de_DE