Information Technology Reference
In-Depth Information
drawn with at most nine bends per edge. Fewer bends suffice if the common graph is
(bi)connected. Our main open questions concern lower bounds. What is the smallest c 0
such that every SEFE of two graphs admits a (0 ,c 0 )-drawing? Is it possible to putsome
bends on the edges of G in order to save bends on the exclusive edges?
References
1. Angelini, P., Di Battista, G., Frati, F., Jelínek, V., Kratochvíl, J., Patrignani, M., Rutter, I.:
Testing planarity of partially embedded graphs. In: Discrete Algorithms (SODA 2010), pp.
202-221. SIAM (2010)
2. Angelini, P., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Testing the simultaneous
embeddability of two graphs whose intersection is a biconnected or a connected graph. J.
Discrete Alg. 14, 150-172 (2012)
3. Angelini, P., Geyer, M., Kaufmann, M., Neuwirth, D.: On a tree and a path with no geometric
simultaneous embedding.J.GraphAlgorithms Appl. 16(1), 37-83 (2012)
4. Bläsius,T.,Karrer,A.,Rutter, I.: Simultaneous embedding:Edgeorderings, relative posi-
tions, cutvertices. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 220-231.
Springer, Heidelberg (2013)
5. Bläsius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamas-
sia, R. (ed.) Handbook of Graph Drawing and Visualization. CRC Press (2013)
6. Bläsius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding
problems. In: Discrete Algorithms (SODA 2013), pp. 1030-1043. SIAM (2013)
7. Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. J.
Graph Algorithms Appl. 9(3), 347-364 (2005)
8. Estrella-Balderrama, A., Gassner, E., Jünger, 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)
9. Gassner, E., Jünger, 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)
10. Haeupler, B., Jampani, K.R., Lubiw, A.: Testing simultaneous planarity when the common
graph is 2-connected. J. Graph Algorithms Appl. 17(3), 147-171 (2013)
11. Hong, S.H., Nagamochi, H.: Convex drawingsofgraphs with non-convex boundary con-
straints. Discrete Appl. Math. 156(12), 2368-2380 (2008)
12. Jelínek, V., Kratochvíl, J., Rutter, I.: A kuratowski-type theorem for planarity of partially
embedded graphs. Computational Geometry Theory & Applications 46(4), 466-492 (2013)
13. Jünger, M., Schulz, M.: Intersection graphs in simultaneous embedding with fixed edges. J.
Graph Algorithms Appl. 13(2), 205-218 (2009)
14. Kratochvíl, J., Matoušek, J.: Stringgraphs requiring exponential representations. J. Comb.
Theory, Ser. B 53(1), 1-4 (1991)
15. Mchedlidze, T., Nöllenburg,M.,Rutter, I.: Drawing planar graphs with a prescribed inner
face. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 316-327. Springer,
Heidelberg (2013)
16. Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs and Combi-
natorics 17, 717-728 (2001)
17. Patrignani, M.: On extending a partial straight-line drawing. International Journal of Foun-
dations of Computer Science 17(5), 1061-1069 (2006)
18. Schaefer, M.: Toward a theory of planarity: Hanani-tutte and planarity variants. J. Graph
Algorithms Appl. 17(4), 367-440 (2013)
19. Tutte, W.T.: How to draw a graph. London Math. Soc. s3-13(1), 743-767 (1963)
Search WWH ::




Custom Search