Information Technology Reference
In-Depth Information
References
1. Bekos, M.A., Gronemann, M., Kaufmann, M., Krug,R.:Planar octilinear drawings with one
bend per edge. Arxiv report arxiv.org/abs/1408.5920 (2014)
2. Biedl, T.C., Kant, G.: A better heuristic for orthogonal graph drawings. In: van Leeuwen, J.
(ed.) ESA 1994. LNCS, vol. 855, pp. 24-35. Springer, Heidelberg (1994)
3. Blasius, T., Krug,M.,Rutter, I., Wagner, D.: Orthogonal graph drawing with flexibility con-
straints. Algorithmica 68(4), 859-885 (2014)
4. Bodlaender, H.L., Tel, G.: A note on rectilinearity and angular resolution. Journal of Graph
Algorithms and Applications 8(1), 89-94 (2004)
5. Di Battista, G., Tamassia, R.: On-line graph algorithms with SPQR-trees. In: Paterson, M.
(ed.) ICALP 1990. LNCS, vol. 443, pp. 598-611. Springer, Heidelberg (1990)
6. Di Giacomo, E., Liotta, G., Montecchiani, F.: The planar slope number of subcubic graphs.
In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 132-143. Springer, Hei-
delberg (2014)
7. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity
testing.SIAMJournal on Computing 31(2), 601-625 (2001)
8. Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.)
GD 2000. LNCS, vol. 1984, pp. 77-90. Springer, Heidelberg (2001)
9. Hong, S.H., Merrick, D., do Nascimento, H.A.D.: Automatic visualisation of metro maps.
Journal of Visual Languages and Computing 17(3), 203-224 (2006)
10. Jelınek, V., Jelınkova, E., Kratochvıl, J., Lidicky, B., Tesar, M., Vyskocil, T.: The planar
slope number of planar partial 3-trees of bounded degree. Graphs and Combinatorics 29(4),
981-1005 (2013)
11. Kant, G.: Drawing planar graphs using the lmc-ordering. In: 33rd Annual Symposiumon
Foundations of Computer Science (FOCS 1992), pp. 101-110. IEEE (1992)
12. Kant, G.: Hexagonal grid drawings. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol. 657, pp.
263-276. Springer, Heidelberg (1993)
13. Keszegh, B., Pach, J., Palvolgyi, D.: Drawing planar graphs of bounded degree with few
slopes. SIAM Journal of Discrete Mathematics 27(2), 1171-1183 (2013)
14. Keszegh, B., Pach, J., Palvolgyi, D., T oth, G.: Drawing cubic graphs with at most five slopes.
Computational Geometry 40(2), 138-147 (2008)
15. Lenhart, W., Liotta, G., Mondal, D., Nishat, R.I.: Planar and plane slope number of partial
2-trees. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 412-423. Springer,
Heidelberg (2013)
16. Mukkamala, P., Palvolgyi, D.: Drawing cubic graphs with the four basic slopes. In: van Krev-
eld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 254-265. Springer, Heidelberg
(2011)
17. N ollenburg,M.:Automated drawings of metro maps. Tech. Rep. 2005-25, Fakultat f urIn-
formatik, Universitat Karlsruhe (2005)
18. N ollenburg, M., Wolff, A.: Drawing and labeling high-quality metro maps by mixed-integer
programming. IEEE Transactions on Visualization and Computer Graphics 17(5), 626-641
(2011)
19. Stott, J.M., Rodgers, P., Martinez-Ovando, J.C., Walker, S.G.: Automatic metro map layout
using multicriteria optimization. IEEE Transactions on Visualization and Computer Graph-
ics 17(1), 101-114 (2011)
20. Tamassia, R.: On embedding a graph in the grid with the minimumnumber of bends. SIAM
Journal of Computing 16(3), 421-444 (1987)
21. Wolff, A.: Graph drawing and cartography. In: Tamassia, R. (ed.) Handbook of Graph Draw-
ing and Visualization, ch. 23, pp. 697-736. CRC Press (2013)
