Author:
Bekos Michael A.,Kaufmann Michael,Krug Robert
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Badent, M., Brandes, U., Cornelsen, S.: More canonical ordering. J. Graph Algorithms Appl. 15(1), 97–126 (2011)
2. Bekos, M.A., Gronemann, M., Kaufmann, M., Krug, R.: Planar octilinear drawings with one bend per edge. J. Graph Algorithms Appl. 19(2), 657–680 (2015)
3. Bekos, M.A., Kaufmann, M., Krug, R.: On the total number of bends for planar octilinear drawings. Arxiv report
arxiv.org/abs/1512.04866
(2014)
4. Lecture Notes in Computer Science;TC Biedl,1996
5. Biedl, T.C., Kant, G.: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3), 159–180 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献