O. Bernardi, Bijective counting of tree-rooted maps and shuffles of parenthesis systems, In Electron. J. Combin, vol.14, issue.1, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00018111

O. Bernardi and E. Fusy, A unified bijective method for maps: application to two classes with boundaries, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01186298

U. Brandes and D. Wagner, A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs, Algorithmica, vol.28, issue.1, pp.16-36, 2000.
DOI : 10.1007/s004530010029

E. Brehm, 3-orientations and Schnyder-three tree decompositions, 2000.

W. Brown, Enumeration of Triangulations of the Disk, Proceedings of the London Mathematical Society, vol.3, issue.4, pp.746-768, 1964.
DOI : 10.1112/plms/s3-14.4.746

W. Brown, Enumeration of quadrangular dissections of the disk. Canad, J. Math, vol.21, pp.302-317, 1965.

L. Castelli-aleardi, O. Devillers, and G. Schaeffer, Succinct representations of triangulations with a boundary, WADS, pp.134-145, 2005.

H. De-fraysseix and P. O. De-mendez, On topological aspects of orientations, Discrete Mathematics, vol.229, issue.1-3, pp.57-72, 2001.
DOI : 10.1016/S0012-365X(00)00201-6
URL : https://hal.archives-ouvertes.fr/hal-00005628

S. Felsner, Lattice structures from planar graphs, 10] ´ E. Fusy. Combinatoire des cartes planaires et applications algorithmiques, p.24, 2004.

M. Krikun, Explicit enumeration of triangulations with multiple boundaries, Electr. J. Comb, vol.14, issue.1, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00151870

M. Kutz, Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time, Proceedings of the twenty-second annual symposium on Computational geometry , SCG '06, pp.430-438, 2006.
DOI : 10.1145/1137856.1137919

T. Lewiner, H. Lopes, J. Rossignac, and A. W. , Vieria Efficient Edgebreaker for surfaces of arbitrary topology, Sibgrapi, pp.218-225, 2004.

C. Mcdiarmid, Random graphs on surfaces, Journal of Combinatorial Theory, Series B, vol.98, issue.4, pp.778-797, 2008.
DOI : 10.1016/j.jctb.2007.11.006

D. Poulalhon and G. Schaeffer, Optimal Coding and Sampling of Triangulations, ICALP '03), pp.505-527, 2006.
DOI : 10.1007/s00453-006-0114-8
URL : https://hal.archives-ouvertes.fr/hal-00159287

J. Rossignac, Edgebreaker: connectivity compression for triangle meshes, IEEE Transactions on Visualization and Computer Graphics, vol.5, issue.1, pp.47-61, 1999.
DOI : 10.1109/2945.764870

W. Schnyder, Embedding planar graphs on the grid, SoDA, pp.138-148, 1990.

W. Tutte, A census of planar triangulations, Journal canadien de math??matiques, vol.14, issue.0, pp.21-38, 1962.
DOI : 10.4153/CJM-1962-002-9