C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the Desirability of Acyclic Database Schemes, Journal of the ACM, vol.30, issue.3, pp.479-513, 1983.
DOI : 10.1145/2402.322389

U. Brandes, S. Cornelsen, B. Pampel, and A. Sallaberry, Hypergraphs and outerplanarity, this volume
URL : https://hal.archives-ouvertes.fr/hal-00539143

K. Buchin, M. Van-kreveld, H. Meijer, B. Speckmann, and K. Verbeek, On planar supports for hypergraphs, Proceedings of the 17th International Symposium on Graph Drawing Lecture Notes in Computer Science, 2009.

C. Bujtás and Z. Tuza, Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees, Discrete Mathematics, vol.309, issue.22, pp.6391-6401, 2009.
DOI : 10.1016/j.disc.2008.10.023

J. Flower, A. Fish, and J. Howse, Euler diagram generation, Journal of Visual Languages & Computing, vol.19, issue.6, pp.675-694, 2008.
DOI : 10.1016/j.jvlc.2008.01.004

D. S. Johnson, S. Krishnan, J. Chhugani, S. Kumar, and S. Venkatasubramanian, Compressing Large Boolean Matrices Using Reordering Techniques, Proceedings of the 13th International Conference on Very Large Data Bases, pp.13-23, 2004.
DOI : 10.1016/B978-012088469-8.50005-X

D. S. Johnson and H. O. Pollak, Hypergraph planarity and the complexity of drawing venn diagrams, Journal of Graph Theory, vol.6, issue.3, pp.309-325, 1987.
DOI : 10.1002/jgt.3190110306

M. Kaufmann, M. Van-kreveld, and B. Speckmann, Subdivision Drawings of Hypergraphs, Proceedings of the 16th International Symposium on Graph Drawing, pp.396-407, 2008.
DOI : 10.1007/978-3-642-00219-9_39

E. Korach and M. Stern, The clustering matroid and the optimal clustering tree, Mathematical Programming, vol.98, issue.1-3, pp.385-414, 2003.
DOI : 10.1007/s10107-003-0410-x

D. Král-', J. Kratochvíl, and H. Voss, Mixed hypercacti, Discrete Mathematics, vol.286, issue.1-2, pp.99-113, 2004.
DOI : 10.1016/j.disc.2003.11.051

M. Nöllenburg, An Improved Algorithm for the Metro-line Crossing Minimization Problem, Proceedings of the 17th International Symposium on Graph Drawing, pp.381-392, 2009.
DOI : 10.1007/978-3-642-11805-0_36

P. Simonetto, D. Auber, and D. Archambault, Fully Automatic Visualisation of Overlapping Sets, Computer Graphics Forum, vol.10, issue.1, pp.967-974, 2009.
DOI : 10.1111/j.1467-8659.2009.01452.x
URL : https://hal.archives-ouvertes.fr/hal-00407269

R. E. Tarjan and M. Yannakakis, Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984.
DOI : 10.1137/0213035

A. Wolff, Drawing subway maps: A survey. Informatik-Forschung und Entwicklung, pp.23-44, 1970.