Author:
Cornelsen Sabine,Karrenbauer Andreas
Publisher
Springer Berlin Heidelberg
Reference31 articles.
1. Biedl, T.C., Kant, G.: A better heuristic for orthogonal graph drawings. Computational Geometry 9(3), 159–180 (1998)
2. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM Journal on Computing 31(2), 601–625 (2001)
3. Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing 16, 421–444 (1987)
4. Lecture Notes in Computer Science;U. Fößmeier,1996
5. Klau, G.W., Mutzel, P.: Quasi orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut für Informatik, Saarbrücken, Germany (1998), http://data.mpi-sb.mpg.de/internet/reports.nsf
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献