Information Technology Reference
In-Depth Information
References
1. Athenstadt, J.C., Hartmann, T., Nollenburg,M.:Simultaneous embeddability of two parti-
tions. CoRR, abs/1408.6019 (August 2014)
2. Blasius, T., Kobourov, S.G., Rutter, I.: Simultaneous embedding of planar graphs. In: Tamas-
sia, R. (ed.) Handbook of Graph Drawing and Visualization, ch. 11, pp. 349-381. CRC Press
(2013)
3. Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Blocks of hypergraphs applied to hy-
pergraphs and outerplanarity. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS,
vol. 6460, pp. 201-211. Springer, Heidelberg (2011)
4. Brandes, U., Cornelsen, S., Pampel, B., Sallaberry, A.: Path-based supports for hypergraphs.
J. Discrete Algorithms 14, 248-261 (2012)
5. Buchin, K., van Kreveld, M., Meijer, H., Speckmann, B., Verbeek, K.: On planar sup-
ports for hypergraphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849,
pp. 345-356. Springer, Heidelberg (2010), see also Tech. Rep. UU-CS-2009-035, Utrecht
University (2009)
6. Buja, A., Swayne, D.F., Littman, M.L., Dean, N., Hofmann, H., Chen, L.: Data visualization
with multidimensional scaling.J.Comput. Graphical Statistics 17(2), 444-472 (2008)
7. Chaplick, S., Jelınek, V., Kratochvıl, J., Vyskocil, T.: Bend-bounded path intersection graphs:
Sausages, noodles, and waffles on a grill. In: Golumbic, M.C., Stern, M., Levy, A., Morgen-
stern, G. (eds.) WG 2012. LNCS, vol. 7551, pp. 274-285. Springer, Heidelberg (2012)
8. Chow, S.: Generating and Drawing Area-Proportional Euler and Venn Diagrams. PhD thesis,
University of Victoria (2007)
9. Collins, C., Penn, G., Carpendale, S.: Bubble sets: Revealing set relations with isocontours
over existing visualizations. IEEE TVCG 15(6), 1009-1016 (2009)
10. de Berg, M., Khosravi, A.: Optimal binary space partitions in the plane. In: Thai, M.T., Sahni,
S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 216-225. Springer, Heidelberg (2010)
11. Feng, Q.-W., Cohen, R., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) ESA
1995. LNCS, vol. 979, pp. 213-226. Springer, Heidelberg (1995)
12. Flower, J., Fish, A., Howse, J.: Euler diagram generation. J. Visual Languages and Comput-
ing 19(6), 675-694 (2008)
13. Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21(4), 549-568 (1974)
14. Johnson, D.S., Pollak, H.O.: Hypergraph planarity and the complexity of drawing Venn dia-
grams. J. Graph Theory 11(3), 309-325 (1987)
15. Kaufmann, M., van Kreveld, M., Speckmann, B.: Subdivision drawings of hypergraphs. In:
Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 396-407. Springer, Hei-
delberg (2009)
16. Kohonen, T.: Self-Organizing Maps, 3rd edn. Springer (2001)
17. Makinen, E.: How to draw a hypergraph. Int. J. Computer Math. 34(3-4), 177-185 (1990)
18. Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs and Combi-
natorics 17(4), 717-728 (2001)
19. Simonetto, P., Auber, D., Archambault, D.: Fully automatic visualisation of overlapping sets.
Computer Graphics Forum 28(3), 967-974 (2009)
20. S. Wagner and D. Wagner. Comparing Clusterings - An Overview. Tech. Rep. 2006-04,
Department of Informatics, Universitat Karlsruhe, 2007.
21. Walsh, T.R.: Hypermaps Versus Bipartite Maps. J. Combinatorial Theory Series B 18(2),
155-163 (1975)
22. Zykov, A.A.: Hypergraphs. Russian Mathematical Surveys 29(6), 89-156 (1974)
