Information Technology Reference
In-Depth Information
2. Angelini, P., Frati, F., Patrignani, M.: Splitting clusters to get C-planarity. In: Eppstein, D.,
Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 57-68. Springer, Heidelberg (2010)
3. Bertolazzi, P., Di Battista, G., Liotta, G., Mannino, C.: Upward drawings of triconnected
digraphs. Algorithmica 12(6), 476-497 (1994)
4. Chimani, M., Di Battista, G., Frati, F., Klein, K.: Advances on testing c-planarity of embed-
ded flat clustered graphs. CoRR, abs/1408.2595 (2014)
5. Chimani, M., Gutwenger, C., Jansen, M., Klein, K., Mutzel, P.: Computing maximumc-
planar subgraphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 114-
120. Springer, Heidelberg (2009)
6. Chimani, M., Klein, K.: Shrinking the search space for clustered planarity. In: Didimo, W.,
Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 90-101. Springer, Heidelberg (2013)
7. Cornelsen, S., Wagner, D.: Completely connected clustered graphs. J. Discrete Algo-
rithms 4(2), 313-323 (2006)
8. Cortese, P.F., Di Battista, G., Frati, F., Patrignani, M., Pizzonia, M.: C-planarity of c-
connected clustered graphs. J. Graph Algorithms Appl. 12(2), 225-262 (2008)
9. Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: Clustering cycles into cycles of
clusters. J. Graph Alg. Appl. 9(3), 391-413 (2005)
10. Dahlhaus, E.: A linear time algorithm to recognize clustered planar graphs and its paralleliza-
tion. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 239-248.
Springer, Heidelberg (1998)
11. Di Battista, G., Frati, F.: Efficient c-planarity testing for embedded flat clustered graphs with
small faces. J. Graph Alg. Appl. 13(3), 349-378 (2009)
12. Didimo, W., Giordano, F., Liotta, G.: Overlapping cluster planarity. J. Graph Algorithms
Appl. 12(3), 267-291 (2008)
13. Feng, Q.W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Moore, W., Luk, W.
(eds.) FPL 1995. LNCS, vol. 975, pp. 213-226. Springer, Heidelberg (1995)
14. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity
testing.SIAMJournal on Computing 31(2), 601-625 (2001)
15. Goodrich, M.T., Lueker, G.S., Sun, J.Z.: C-planarity of extrovert clustered graphs. In: Healy,
P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 211-222. Springer, Heidelberg
(2006)
16. Gutwenger, C., Junger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in
c-planarity testing of clustered graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002.
LNCS, vol. 2528, pp. 220-235. Springer, Heidelberg (2002)
17. Jelınek, V., Jelınkova, E., Kratochvıl, J., Lidicky, B.: Clustered planarity: Embedded clus-
tered graphs with two-component clusters. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008.
LNCS, vol. 5417, pp. 121-132. Springer, Heidelberg (2009)
18. Jelınek, V., Suchy, O., Tesar, M., Vyskocil, T.: Clustered planarity: Clusters with few out-
going edges. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 102-113.
Springer, Heidelberg (2009)
19. Jelınkova, E., Kara, J., Kratochvıl, J., Pergel, M., Suchy, O., Vyskocil, T.: Clustered pla-
narity: Small clusters in cycles and Eulerian graphs. J. Graph Alg. Appl. 13(3), 379-422
(2009)
20. Kratochvıl, J., Lubiw, A., Nesetril, J.: Noncrossing subgraphs in topological layouts. SIAM
J. Discrete Math. 4(2), 223-244 (1991)
21. Schaefer, M.: Toward a theory of planarity: Hanani-Tutte and planarity variants. J. Graph
Algorithms Appl. 17(4), 367-440 (2013)
22. Schaeffer, S.E.: Graph clustering.Computer Science Review 1(1), 27-64 (2007)
23. Tamassia, R.: On embedding a graph in the grid with the minimumnumber of bends. SIAM
J. Comput. 16(3), 421-444 (1987)
