Information Technology Reference
In-Depth Information
References
1. Ackerman, E.: On the maximumnumber of edges in topological graphs with no fourpairwise
crossing edges. Discrete & Computational Geometry 41(3), 365-375 (2009)
2. Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear
number of edges. Combinatorica 17(1), 1-9 (1997)
3. Argyriou, E.N., Bekos, M.A., Symvonis, A.: The straight-line RAC drawing problem is NP-
hard. J. Graph Algorithms Appl. 16(2), 569-597 (2012)
4. Auer, C., Bachmaier, C., Brandenburg, F.J., Gleißner, A., Hanauer, K., Neuwirth, D., Reisl-
huber, J.: Recognizing outer 1-planar graphs in linear time. In: Wismath, S., Wolff, A. (eds.)
GD 2013. LNCS, vol. 8242, pp. 107-118. Springer, Heidelberg (2013)
5. Bekos, M.A., Cornelsen, S., Grilli, L., Hong, S.H., Kaufmann, M.: On the recognition of
fan-planar and maximal outer-fan-planar graphs. CoRR abs/1409.0461 (September 2014)
6. Cheong,O.,Har-Peled, S., Kim, H., Kim, H.S.: On the number of edges of fan-crossing free
graphs. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp.
163-173. Springer, Heidelberg (2013)
7. Reisi Dehkordi, H., Nguyen, Q., Eades, P., Hong,S.-H.:Circular graph drawings with large
crossing angles. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol. 7748,
pp. 298-309. Springer, Heidelberg (2013)
8. Didimo, W., Eades, P., Liotta, G.: Drawinggraphs with right angle crossings. Theor. Comput.
Sci. 412(39), 5156-5166 (2011)
9. Eades, P., Hong, S.H., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear time al-
gorithm for testing maximal 1-planarity of graphs with a rotation system. Theor. Comput.
Sci. 513, 65-76 (2013)
10. Eades, P., Liotta, G.: Right angle crossinggraphs and 1-planarity. Discrete Applied Mathe-
matics 161(7-8), 961-969 (2013)
11. Eggleton, R.: Rectilinear drawingsofgraphs. Utilitas Mathematica 29, 149-172 (1986)
12. Fox, J., Pach, J., Suk, A.: The number of edges in k-quasi-planar graphs. SIAM J. Discrete
Math. 27(1), 550-561 (2013)
13. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-
Completeness. W. H. Freeman & Co., New York (1979)
14. Grigoriev, A., Bodlaender, H.L.: Algorithms for graphs embeddable with few crossingsper
edge. Algorithmica 49(1), 1-11 (2007)
15. 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)
16. Hong, S.H., Eades, P., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: A linear-time al-
gorithm for testing outer-1-planarity. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS,
vol. 8242, pp. 71-82. Springer, Heidelberg (2013)
17. Hong, S.H., Nagamochi, H.: Testing full outer-2-planarity in linear time. Technical Report
2014-003, Department of Applied Mathematics and Physics, Kyoto University (2014)
18. Kaufmann, M., Ueckerdt, T.: The density of fan-planar graphs. CoRR abs/1403.6184 (2014)
19. Korzhik, V.P., Mohar, B.: Minimal obstructions for 1-immersions and hardness of 1-planarity
testing.Journal of Graph Theory 72(1), 30-71 (2013)
20. Pach, J., Radoicic, R., T oth, G.: Relaxing planarity for topological graphs. In: Akiyama, J.,
Kano, M. (eds.) JCDCG 2002. LNCS, vol. 2866, pp. 221-232. Springer, Heidelberg (2003)
21. Pach, J., T oth, G.: Graphs drawn with few crossings per edge. Combinatorica 17(3), 427-439
(1997)
22. Purchase, H.C.: Effective information visualisation: a study of graph drawing aesthetics and
algorithms. Interacting with Computers 13(2), 147-162 (2000)
23. Ringel, G.: Ein Sechsfarbenproblem aufderKugel. Abh. Math. Sem. Univ. Hamburg 29,
107-117 (1965)
