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

C. Berge, Graphs and Hypergraphs, 1973.

K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, Journal of Computer and System Sciences, vol.13, issue.3, pp.335-379, 1976.
DOI : 10.1016/S0022-0000(76)80045-1

K. Buchin, M. Van-kreveld, H. Meijer, B. Speckmann, and K. Verbeek, On planar supports for hypergraphs, 2009.

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.

M. Chimani and C. Gutwenger, Algorithms for the Hypergraph and the Minor Crossing Number Problems, Proceedings of the 18th International Symposium on Algorithms and Computing, pp.184-195, 2007.
DOI : 10.1007/978-3-540-77120-3_18

S. C. Chow, Generating and drawing area-proportional Euler and Venn diagrams, 2007.

W. Didimo, F. Giordano, and G. Liotta, Overlapping Cluster Planarity, Journal of Graph Algorithms and Applications, vol.12, issue.3, pp.267-291, 2008.
DOI : 10.7155/jgaa.00167

Y. Dinitz, A. V. Karzanov, and M. Lomonosov, On the structure of a family of minimal weighted cuts in a graph, Studies in Discrete Optimization, pp.290-306, 1976.

T. Eschbach, W. Günther, and B. Becker, Orthogonal Hypergraph Drawing for Improved Visibility, Journal of Graph Algorithms and Applications, vol.10, issue.2, pp.141-157, 2006.
DOI : 10.7155/jgaa.00122

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

J. E. Hopcroft and R. E. Tarjan, Efficient Planarity Testing, Journal of the ACM, vol.21, issue.4, pp.549-568, 1974.
DOI : 10.1145/321850.321852

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

E. Mäkinen, How to draw a hypergraph, International Journal of Computer Mathematics, vol.18, issue.3-4, pp.177-185, 1990.
DOI : 10.1109/TSMC.1981.4308636

P. Mutton, P. Rodgers, and J. Flower, Drawing Graphs in Euler Diagrams, pp.66-81
DOI : 10.1007/978-3-540-25931-2_9

G. Sander, Layout of Directed Hypergraphs with Orthogonal Hyperedges, Proceedings of the 11th International Symposium on Graph Drawing, pp.381-386, 2003.
DOI : 10.1007/978-3-540-24595-7_35

M. Schaefer and D. Stefankovi?-c, Decidability of string graphs, Journal of Computer and System Sciences, vol.68, issue.2, pp.319-334, 2004.
DOI : 10.1016/j.jcss.2003.07.002

P. Simonetto and D. Auber, Visualise Undrawable Euler Diagrams, 2008 12th International Conference Information Visualisation, pp.594-599, 2008.
DOI : 10.1109/IV.2008.78
URL : https://hal.archives-ouvertes.fr/hal-00319119

P. Simonetto and D. Auber, An Heuristic for the Construction of Intersection Graphs, 2009 13th International Conference Information Visualisation, pp.673-678, 2009.
DOI : 10.1109/IV.2009.30
URL : https://hal.archives-ouvertes.fr/hal-00407218

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

W. M. Van-cleemput, On the planarity of hypergraphs, Proceedings of the IEEE, pp.514-515, 1978.
DOI : 10.1109/PROC.1978.10945

A. Verroust and M. Viaud, Ensuring the Drawability of Extended Euler Diagrams for up to 8 Sets, Blackwell et al. [3], pp.128-141
DOI : 10.1007/978-3-540-25931-2_13
URL : https://hal.archives-ouvertes.fr/inria-00071605

T. R. Walsh, Hypermaps versus bipartite maps, Journal of Combinatorial Theory, Series B, vol.18, issue.2, pp.155-163, 1975.
DOI : 10.1016/0095-8956(75)90042-8