Author:
Bläsius Thomas,Rutter Ignaz,Wagner Dorothea
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Biedl, T., Kant, G.: A Better Heuristic for Orthogonal Graph Drawings. Comput. Geom. 9(3), 159–180 (1998)
2. Bläsius, T., Krug, M., Rutter, I., Wagner, D.: Orthogonal graph drawing with flexibility constraints. Algorithmica (2012), doi:10.1007/s00453-012-9705-8
3. Bläsius, T., Rutter, I., Wagner, D.: Optimal orthogonal graph drawing with convex bend costs. CoRR abs/1204.4997 (2012),
http://arxiv.org/abs/1204.4997
4. Di Battista, G., Liotta, G., Vargiu, F.: Spirality and Optimal Orthogonal Drawings. SIAM J. Comput. 27(6), 1764–1811 (1998)
5. Di Battista, G., Tamassia, R.: On-Line Maintenance of Triconnected Components with SPQR-Trees. Algorithmica 15(4), 302–318 (1996)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献