Information Technology Reference
In-Depth Information
2. Badent, M., Di Giacomo, E., Liotta, G.: Drawing colored graphs on colored points. Theor.
Comput. Sci. 408(2-3), 129-142 (2008)
3. Bern, M., Gilbert, J.R.: Drawing the planar dual. Inform. Process. Lett. 43(1), 7-13 (1992)
4. Blasius, T., Kobourov, S.G., Rutter, I.: Simultaneous embeddingsofplanargraphs. In:
Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. Discrete Mathematics
and Its Applications, ch. 11, pp. 349-382. Chapman and Hall/CRC (2013)
5. Cabello, S., Mohar, B.: Adding one edgetoplanargraphs makes crossing number and 1-
planarity hard. SIAM Journal on Computing 42(5), 1803-1829 (2013)
6. Chan, T.M., Hoffmann, H.-F., Kiazyk, S., Lubiw, A.: Minimumlength embedding of planar
graphs at fixed vertex locations. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242,
pp. 376-387. Springer, Heidelberg (2013)
7. Chimani, M., Junger, M., Schulz, M.: Crossing minimization meets simultaneousdrawing.
In: PacificVis, pp. 33-40. IEEE (2008)
8. Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. J.
Graph Algorithms and Appl. 9(3), 347-364 (2005)
9. Estrella-Balderrama, A., Gassner, E., Junger, M., Percan, M., Schaefer, M., Schulz, M.: Si-
multaneous geometric graph embeddings. In: Hong, S.-H., Nishizeki, T., Quan,W.(eds.)GD
2007. LNCS, vol. 4875, pp. 280-290. Springer, Heidelberg (2008)
10. Fowler, J.J., Junger, M., Kobourov, S.G., Schulz, M.: Characterizations of restricted pairs
of planar graphs allowing simultaneous embedding with fixed edges. Comput. Geom. 44(8),
385-398 (2011)
11. Gassner, E., Junger, M., Percan, M., Schaefer, M., Schulz, M.: Simultaneous graph embed-
dings with fixed edges. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 325-335.
Springer, Heidelberg (2006)
12. Grilli, L., Hong,S.-H.,Kratochvıl, J., Rutter, I.: Drawing simultaneously embedded graphs
with few bends. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 40-51.
Springer, Heidelberg (2014)
13. Haeupler, B., Jampani, K.R., Lubiw, A.: Testing simultaneous planarity when the common
graph is 2-connected. J. Graph Algorithms and Appl. 17(3), 147-171 (2013)
14. Hlineny, P.: Crossing number is hard for cubic graphs. J. Combin. Theory Ser. B 96(4), 455-
471 (2006)
15. Jelınek, V., Kratochvıl, J., Rutter, I.: A Kuratowski-type theorem for planarity of partially
embedded graphs. Comput. Geom. 46(4), 466-492 (2013)
16. J unger, M., Schulz, M.: Intersection graphs in simultaneous embedding with fixed edges. J.
Graph Algorithms Appl. 13(2), 205-218 (2009)
17. Kaufmann, M., Wiese, R.: Embedding vertices at points: Few bends suffice for planar graphs.
J. Graph Algorithms and Appl. 6(1), 115-129 (2002)
18. Kratochvıl, J., Matousek, J.: Stringgraphs requiring exponential representations. J. Comb.
Theory, Ser. B 53(1), 1-4 (1991)
19. O'Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, NY (1987)
20. Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs Com-
bin. 17(4), 717-728 (2001)
21. Patrignani, M.: On extending a partial straight-line drawing. Internat. J. Found. Comput.
Sci. 17(5), 1061-1069 (2006)
22. Schaefer, M.: The graph crossing number and its variants: A survey. The Electronic Journal
of Combinatorics 20, 1-90 (2013), Dynamic Survey, #DS21.
23. Schaefer, M.: Toward a theory of planarity: Hanani-Tutte and planarity variants. J. of Graph
Algorthims and Appl. 17(4), 367-440 (2013)
Search WWH ::




Custom Search