E. Ackerman, G. Barequet, and R. Y. Pinter, A bijection between permutations and floorplans, and its applications, Discrete Applied Mathematics, vol.154, issue.12, pp.1674-1684, 2006.
DOI : 10.1016/j.dam.2006.03.018

O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser et al., On the Number of Plane Geometric Graphs, Graphs and Combinatorics, vol.23, issue.S1, pp.67-84, 2007.
DOI : 10.1007/s00373-007-0704-5

K. Amano, S. Nakano, and K. Yamanaka, On the number of rectangular drawings: Exact counting and lower and upper bounds, 2007.

J. Bhasker and S. Sahni, A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph, Networks, vol.17, issue.3, pp.307-317, 1987.
DOI : 10.1002/net.3230170306

T. Biedl, G. Kant, and M. Kaufmann, On Triangulating Planar Graphs under the Four-Connectivity Constraint, Algorithmica, vol.19, issue.4, pp.427-446, 1997.
DOI : 10.1007/PL00009182

A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto, The Travelling Salesman Problem in Bounded Degree Graphs, Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), Part I, pp.198-209, 2008.
DOI : 10.1007/978-3-540-70575-8_17

M. Bruls, K. Huizing, and J. J. Van-wijk, Squarified Treemaps, Data Visualization 2000: Proceedings Joint Eurographics and IEEE TCVG Symp. on Visualization, pp.33-42, 2000.
DOI : 10.1007/978-3-7091-6783-0_4

K. Buchin and A. Schulz, On the Number of Spanning Trees a Planar Graph Can Have, Proceedings of the 18th European Symposium on Algorithms (ESA), pp.110-121, 2010.
DOI : 10.1007/978-3-642-15775-2_10

K. Buchin, C. Knauer, K. Kriegel, A. Schulz, and R. Seidel, On the Number of Cycles in Planar Graphs, Proceedings of the 13th Computing and Combinatorics Conference (COCOON), pp.97-107, 2007.
DOI : 10.1007/978-3-540-73545-8_12

K. Buchin, B. Speckmann, and S. Verdonschot, Optimizing Regular Edge Labelings, Proceedings of the 18th International Symposium on Graph Drawing (GD), pp.117-128, 2011.
DOI : 10.1007/978-3-642-18469-7_11

K. Buchin, B. Speckmann, and S. Verdonschot, Evolution Strategies for Optimizing Rectangular Cartograms, Proceedings of the 7th International Conference on Geographic Information Science, pp.29-42, 2012.
DOI : 10.1007/978-3-642-33024-7_3

F. R. Chung, R. L. Graham, P. Frankl, and J. B. Shearer, Some intersection theorems for ordered sets and graphs, Journal of Combinatorial Theory, Series A, vol.43, issue.1, pp.23-37, 1986.
DOI : 10.1016/0097-3165(86)90019-1

A. Dumitrescu, A. Schulz, A. Sheffer, and C. D. Tóth, Bounds on the Maximum Multiplicity of Some Common Geometric Graphs, Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science Schloss Dagstuhl -Leibniz-Zentrum für Informatik, pp.637-648, 2011.
DOI : 10.1137/110849407
URL : https://hal.archives-ouvertes.fr/hal-00573645

C. F. Earl and L. J. March, Architectural applications of graph theory, Applications of Graph Theory, pp.327-355, 1979.

S. Felsner and F. Zickfeld, On the number of planar orientations with prescribed degrees, Electronic Journal of Combinatorics, vol.15, issue.1, 2008.

R. Fujimaki, Y. Inoue, and T. Takahashi, An asymptotic estimate of the numbers of rectangular drawings or floorplans, 2009 IEEE International Symposium on Circuits and Systems, pp.856-859, 2009.
DOI : 10.1109/ISCAS.2009.5117891

E. Fusy, Transversal structures on triangulations: A combinatorial study and straight-line drawings, Discrete Mathematics, vol.309, issue.7, pp.1870-1894, 2009.
DOI : 10.1016/j.disc.2007.12.093

M. Hoffmann, A. Schulz, M. Sharir, A. Sheffer, C. D. Tóth et al., Counting plane graphs: flippability and its applications, Thirty Essays on Geometric Graph Theory, pp.303-326, 2013.

R. Horn and C. R. Johnson, Matrix Analysis, 1985.

Y. Inoue, T. Takahashi, and R. Fujimaki, Counting Rectangular Drawings or Floorplans in Polynomial Time, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.92, issue.4, pp.92-1115, 2009.
DOI : 10.1587/transfun.E92.A.1115

G. Kant and X. He, Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems, Theoretical Computer Science, vol.172, issue.1-2, pp.175-193, 1997.
DOI : 10.1016/S0304-3975(95)00257-X

E. Ko´zmi´nskiko´zmi´ko´zmi´nski and . Kinnen, Rectangular dual of planar graphs, Networks, vol.5, pp.145-157, 1985.

H. Minc, Nonnegative Matrices, 1988.

E. Raisz, The Rectangular Statistical Cartogram, Geographical Review, vol.24, issue.2, pp.292-296, 1934.
DOI : 10.2307/208794

I. Rinsma, Rectangular and orthogonal floorplans with required rooms areas and tree adjacency. Environment and Planning B: Planning and Design, pp.111-118, 1988.

M. Sharir and A. Sheffer, Counting triangulations of planar point sets, Electronic Journal of Combinatorics, vol.18, issue.1, 2011.

M. Van-kreveld and B. Speckmann, On rectangular cartograms, Computational Geometry, vol.37, issue.3, pp.175-187, 2007.
DOI : 10.1016/j.comgeo.2006.06.002

S. Verdonschot, Optimizing regular edge labelings, 2010.

G. K. Yeap and M. Sarrafzadeh, Sliceable Floorplanning by Graph Dualization, SIAM Journal on Discrete Mathematics, vol.8, issue.2, pp.258-280, 1995.
DOI : 10.1137/S0895480191266700