Information Technology Reference
In-Depth Information
References
1. Alam, M.J., Brandenburg, F.J., Kobourov, S.G.: Straight-line grid drawings of 3-connected
1-planar graphs. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 83-94.
Springer, Heidelberg (2013)
2. 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)
3. Barat, J., Matousek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric
thickness. The Electronic Journal of Combinatorics 13(1) (2006)
4. Brandenburg, F.-J., Eppstein, D., Gleißner, A., Goodrich, M.T., Hanauer, K., Reislhuber, J.:
On the density of maximal 1-planar graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012.
LNCS, vol. 7704, pp. 327-338. Springer, Heidelberg (2013)
5. Dehkordi, H.R., Eades, P.: Every outer-1-plane graph has a right angle crossing drawing.
International Journal on Computational Geometry and Applications 22(6), 543-558 (2012)
6. Di Battista, G., Tamassia, R.: On-line planarity testing.SIAMJournal on Computing 25(5),
956-997 (1996)
7. 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, Heidelberg
(2014)
8. Didimo, W.: Density of straight-line 1-planar graph drawings. IPL 113(7), 236-240 (2013)
9. Dujmovic, V., Suderman, M., Wood, D.R.: Graph drawings with few slopes. Computational
Geometry 38(3), 181-193 (2007)
10. Eades, P., Hong, S.-H., Katoh, N., Liotta, G., Schweitzer, P., Suzuki, Y.: Testing maximal
1-planarity of graphs with a rotation system in linear time. In: Didimo, W., Patrignani, M.
(eds.) GD 2012. LNCS, vol. 7704, pp. 339-345. Springer, Heidelberg (2013)
11. 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)
12. Hong, S.-H., Eades, P., Liotta, G., Poon, S.-H.: Fary's theorem for 1-planar graphs. In: Gud-
mundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 335-346.
Springer, Heidelberg (2012)
13. 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)
14. Keszegh, B., Pach, J., Palvolgyi, D.: Drawing planar graphs of bounded degree with few
slopes. SIAM Journal on Discrete Mathematics 27(2), 1171-1183 (2013)
15. Knauer, K.B., Micek, P., Walczak, B.: Outerplanar graph drawings with few slopes. Compu-
tational Geometry 47(5), 614-624 (2014)
16. 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)
17. Lenhart, W., Liotta, G., Mondal, D., Nishat, R.: 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)
18. Mukkamala, P., Palvolgyi, D.: Drawing cubic graphs with the four basic slopes. In: van
Kreveld, M.J., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 254-265. Springer,
Heidelberg (2011)
19. Pach, J., Palvolgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. The
Electronic Journal of Combinatorics 13(1) (2006)
20. Pach, J., T oth, G.: Graphs drawn with few crossings per edge. Comb. 17(3), 427-439 (1997)
21. Wade, G.A., Chu, J.-H.: Drawability of complete graphs using a minimal slope set. The
Computer Journal 37(2), 139-142 (1994)
Search WWH ::




Custom Search