%0 Conference Paper %1 conf/gd/DemelDMRW18 %A Demel, Almut %A Dürrschnabel, Dominik %A Mchedlidze, Tamara %A Radermacher, Marcel %A Wulf, Lasse %B Graph Drawing %D 2018 %E Biedl, Therese C. %E Kerren, Andreas %I Springer %K 2018 crossing_angle_maximization greedy_heuristik myown %P 286-299 %T A Greedy Heuristic for Crossing-Angle Maximization. %U http://dblp.uni-trier.de/db/conf/gd/gd2018.html#DemelDMRW18 %V 11282 %@ 978-3-030-04414-5

@inproceedings{conf/gd/DemelDMRW18, added-at = {2019-12-17T16:50:25.000+0100}, author = {Demel, Almut and Dürrschnabel, Dominik and Mchedlidze, Tamara and Radermacher, Marcel and Wulf, Lasse}, biburl = {https://www.bibsonomy.org/bibtex/24d53ae536166435e13c78aeb2025d574/duerrschnabel}, booktitle = {Graph Drawing}, crossref = {conf/gd/2018}, editor = {Biedl, Therese C. and Kerren, Andreas}, ee = {https://doi.org/10.1007/978-3-030-04414-5_20}, interhash = {44c9d5616b9daf6501104053f403cfdc}, intrahash = {4d53ae536166435e13c78aeb2025d574}, isbn = {978-3-030-04414-5}, keywords = {2018 crossing_angle_maximization greedy_heuristik myown}, pages = {286-299}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2021-02-17T11:50:39.000+0100}, title = {A Greedy Heuristic for Crossing-Angle Maximization.}, url = {http://dblp.uni-trier.de/db/conf/gd/gd2018.html#DemelDMRW18}, volume = 11282, year = 2018 }