{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:18:18Z","timestamp":1759335498827,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,10,26]],"date-time":"2016-10-26T00:00:00Z","timestamp":1477440000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["EGOS ANR-12-JS02-002-01","PERSYVAL-Lab ANR-11-LABX-0025"],"award-info":[{"award-number":["EGOS ANR-12-JS02-002-01","PERSYVAL-Lab ANR-11-LABX-0025"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00454-016-9832-0","type":"journal-article","created":{"date-parts":[[2016,10,26]],"date-time":"2016-10-26T14:56:51Z","timestamp":1477493811000},"page":"507-544","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Encoding Toroidal Triangulations"],"prefix":"10.1007","volume":"57","author":[{"given":"Vincent","family":"Despr\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Gon\u00e7alves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"L\u00e9v\u00eaque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,26]]},"reference":[{"key":"9832_CR1","doi-asserted-by":"crossref","unstructured":"Albar, B., Gon\u00e7alves, D., Knauer, K.: Orienting triangulations. J. Graph Theory 83(4), 392\u2013405 (2016)","DOI":"10.1002\/jgt.22005"},{"key":"9832_CR2","doi-asserted-by":"crossref","unstructured":"Albenque, M., Poulalhon, D.: Generic method for bijections between blossoming trees and planar maps. Electron. J. Comb. 22(2), paper P2.38 (2015)","DOI":"10.37236\/3386"},{"key":"9832_CR3","unstructured":"Aleardi, L.C., Fusy, E., Lewiner, T.: Optimal encoding of triangular and quadrangular meshes with fixed topology. In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010)"},{"key":"9832_CR4","doi-asserted-by":"crossref","first-page":"R9","DOI":"10.37236\/928","volume":"14","author":"O Bernardi","year":"2007","unstructured":"Bernardi, O.: Bijective counting of tree-rooted maps and shuffles of parenthesis systems. Electron. J. Comb. 14, R9 (2007)","journal-title":"Electron. J. Comb."},{"key":"9832_CR5","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1016\/j.jcta.2011.02.006","volume":"118","author":"O Bernardi","year":"2011","unstructured":"Bernardi, O., Chapuy, G.: A bijection for covered maps, or a shortcut between Harer-Zagier\u2019s and Jackson\u2019s formulas. J Comb Theory A 118, 1718\u20131748 (2011)","journal-title":"J Comb Theory A"},{"key":"9832_CR6","doi-asserted-by":"crossref","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N.: An information-theoretic upper bound of planar graphs using triangulation. Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003). Lecture Notes in Computer Science, vol. 2607, pp. 499\u2013510. Springer, Berlin (2003)","DOI":"10.1007\/3-540-36494-3_44"},{"key":"9832_CR7","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1016\/j.aam.2011.04.004","volume":"47","author":"G Chapuy","year":"2011","unstructured":"Chapuy, G.: A new combinatorial identity for unicellular maps, via a direct bijective approach. Adv. Appl. Math. 47, 874\u2013893 (2011)","journal-title":"Adv. Appl. Math."},{"key":"9832_CR8","doi-asserted-by":"crossref","first-page":"1587","DOI":"10.1137\/080720097","volume":"23","author":"G Chapuy","year":"2009","unstructured":"Chapuy, G., Marcus, M., Schaeffer, G.: A bijection for rooted maps on orientable surfaces. SIAM J. Discrete Math. 23, 1587\u20131611 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"9832_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0012-365X(00)00201-6","volume":"229","author":"H Fraysseix de","year":"2001","unstructured":"de Fraysseix, H., de Mendez, O.P.: On topological aspects of orientations. Discrete Math. 229, 57\u201372 (2001)","journal-title":"Discrete Math."},{"key":"9832_CR10","unstructured":"de Mendez, P.O.: Orientations bipolaires. PhD Thesis (1994)"},{"key":"9832_CR11","doi-asserted-by":"crossref","unstructured":"Duchi, E., Poulalhon, D., Schaeffer, G.: Uniform random sampling of simple branched coverings of the sphere by itself. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 294\u2013304. Society for Industrial and Applied Mathematics, New York (2013)","DOI":"10.1137\/1.9781611973402.21"},{"key":"9832_CR12","doi-asserted-by":"crossref","first-page":"R15","DOI":"10.37236\/1768","volume":"11","author":"S Felsner","year":"2004","unstructured":"Felsner, S.: Lattice structures from planar graphs. Electron. J. Comb. 11, R15 (2004)","journal-title":"Electron. J. Comb."},{"key":"9832_CR13","unstructured":"Fusy, E.: Combinatoire des cartes planaires et applications algorithmiques. PhD Thesis (2007). http:\/\/www.lix.polytechnique.fr\/Labo\/Eric.Fusy\/Theses\/these_eric_fusy.pdf"},{"key":"9832_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511779534.005","volume-title":"Graphs","author":"P Giblin","year":"2010","unstructured":"Giblin, P.: Graphs. Surfaces and Homology. Cambridge University Press, Cambridge (2010)"},{"key":"9832_CR15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s00454-013-9552-7","volume":"51","author":"D Gon\u00e7alves","year":"2014","unstructured":"Gon\u00e7alves, D., L\u00e9v\u00eaque, B.: Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations. Discrete Comput. Geom. 51, 67\u2013131 (2014)","journal-title":"Discrete Comput. Geom."},{"key":"9832_CR16","unstructured":"Gon\u00e7alves, D., Knauer, K., L\u00e9v\u00eaque, B.: Structure of Schnyder labelings on orientable surfaces (2015). arXiv:1501.05475"},{"key":"9832_CR17","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/BF02086606","volume":"16","author":"G Kant","year":"1996","unstructured":"Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16, 4\u201332 (1996)","journal-title":"Algorithmica"},{"key":"9832_CR18","unstructured":"L\u00e9v\u00eaque, B.: Generalization of Schnyder woods to orientable surfaces and applications. HDR Thesis (2016). http:\/\/pagesperso.g-scop.grenoble-inp.fr\/~levequeb\/Publications\/HDR.pdf"},{"key":"9832_CR19","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(94)00381-R","volume":"155","author":"B Mohar","year":"1996","unstructured":"Mohar, B.: Straight-line representations of maps on the torus and other flat surfaces. Discrete Math. 155, 173\u2013181 (1996)","journal-title":"Discrete Math."},{"key":"9832_CR20","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s00453-006-0114-8","volume":"46","author":"D Poulalhon","year":"2006","unstructured":"Poulalhon, D., Schaeffer, G.: Optimal coding and sampling of triangulations. Algorithmica 46, 505\u2013527 (2006)","journal-title":"Algorithmica"},{"key":"9832_CR21","unstructured":"Propp, J.: Lattice structure for orientations of graphs (1993). arXiv:math\/0209005"},{"key":"9832_CR22","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF00353652","volume":"5","author":"W Schnyder","year":"1989","unstructured":"Schnyder, W.: Planar graphs and poset dimension. Order 5, 323\u2013343 (1989)","journal-title":"Order"},{"key":"9832_CR23","unstructured":"Ueckerdt, T.: Geometric representations of graphs with low polygonal complexity. PhD Thesis (2011). http:\/\/www.math.kit.edu\/iag6\/~ueckerdt\/media\/thesis-ueckerdt.pdf"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9832-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-016-9832-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9832-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T23:23:18Z","timestamp":1601162598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-016-9832-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,26]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["9832"],"URL":"https:\/\/doi.org\/10.1007\/s00454-016-9832-0","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2016,10,26]]}}}