Information Technology Reference
In-Depth Information
References
1. Biedl, T.: Drawing planar partitions I: LL-drawings and LH-drawings. In: SoCG 1998, pp.
287-296. ACM (1998)
2. Biedl, T., Kaufmann, M., Mutzel, P.: Drawing planar partitions II: HH-drawings. In:
Hromkovic, J., Sýkora, O. (eds.) WG 1998. LNCS, vol. 1517, pp. 124-136. Springer, Hei-
delberg (1998)
3. Bläsius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding
problems. CoRR abs/1112.0245, 1-46 (2011)
4. Bläsius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding
problems. In: SODA 2013. SIAM (2013)
5. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and
graph planarity usingPQ-tree algorithms.J.Comput. System Sci. 13(3), 335-379 (1976)
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. of Disc. Alg. 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 Alg. 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. Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: On embedding a cycle in a plane
graph. Disc. Math. 309(7), 1856-1869 (2009)
11. 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)
12. Di Battista, G., Frati, F.: Efficient C-planarity testing for embedded flat clustered graphs with
small faces. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp.
291-302. Springer, Heidelberg (2008)
13. Feng, Q.W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.)
ESA 1995. LNCS, vol. 979, pp. 213-226. Springer, Heidelberg (1995)
14. 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)
15. Gutwenger, C., Jünger, 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)
16. Hong, S.H., Nagamochi, H.: Two-page topic embedding and clustered graph planarity. Tech.
Rep. 2009-004, Kyoto University, Depart. Appl. Math. & Phys. (2009)
17. Jelínek,
V.,
Jelínková,
E.,
Kratochvíl,
J.,
Lidický,
B.:
Clustered
pla-
narity:
Embedded
clustered
graphs
with
two-component
clusters
(2009),
http://kam.mff.cuni.cz/~bernard/pub/flat.pdf (manuscript)
18. Jelínek, V., Jelínková, E., Kratochvíl, J., Lidický, B.: Clustered planarity: Embedded clus-
tered graphs with two-component clusters (extended abstract). In: Tollis, I.G., Patrignani, M.
(eds.) GD 2008. LNCS, vol. 5417, pp. 121-132. Springer, Heidelberg (2009)
19. Jelínek, V., Such ý , 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)
20. Jelínková, E., Kára, J., Kratochvíl, J., Pergel, M., Suchý, O., Vyskocil, T.: Clustered pla-
narity: Small clusters in cycles and eulerian graphs. J. Graph Alg. Appl. 13(3), 379-422
(2009)
21. Lengauer, T.: Hierarchical planarity testing algorithms. J. ACM 36(3), 474-509 (1989)
 
Search WWH ::




Custom Search