copydeleteadd this publication to your clipboard

• community post
• history of this post
• URL
• DOI
• BibTeX
• EndNote
• APA
• Chicago
• DIN 1505
• Harvard
• MSOffice XML

A Greedy Heuristic for Crossing-Angle Maximization.

A. Demel, D. Dürrschnabel, T. Mchedlidze, M. Radermacher, and L. Wulf. Graph Drawing , volume 11282 of Lecture Notes in Computer Science, page 286-299. Springer, (2018)