default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominique Poulalhon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j12]Marie Albenque, Dominique Poulalhon:
A Generic Method for Bijections between Blossoming Trees and Planar Maps. Electron. J. Comb. 22(2): 2 (2015)- 2014
- [j11]Marie Albenque, Éric Fusy, Dominique Poulalhon:
On symmetric quadrangulations and triangulations. Eur. J. Comb. 35: 13-31 (2014) - [c4]Enrica Duchi, Dominique Poulalhon, Gilles Schaeffer:
Uniform random sampling of simple branched coverings of the sphere by itself. SODA 2014: 294-304 - 2011
- [j10]Marie Albenque, Éric Fusy, Dominique Poulalhon:
On symmetric quadrangulations. Electron. Notes Discret. Math. 38: 17-24 (2011)
2000 – 2009
- 2009
- [j9]Éric Fusy, Dominique Poulalhon, Gilles Schaeffer:
Bijective counting of plane bipolar orientations and Schnyder woods. Eur. J. Comb. 30(7): 1646-1658 (2009) - 2008
- [j8]Patrice Ossona de Mendez
, Michel Pocchiola, Dominique Poulalhon, Jorge L. Ramírez Alfonsín, Gilles Schaeffer:
Preface. Electron. Notes Discret. Math. 31: 1-4 (2008) - [j7]Éric Fusy, Gilles Schaeffer, Dominique Poulalhon:
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling. ACM Trans. Algorithms 4(2): 19:1-19:48 (2008) - 2007
- [j6]Éric Fusy, Dominique Poulalhon, Gilles Schaeffer:
Bijective counting of plane bipolar orientations. Electron. Notes Discret. Math. 29: 283-287 (2007) - 2006
- [j5]Dominique Poulalhon, Gilles Schaeffer:
Optimal Coding and Sampling of Triangulations. Algorithmica 46(3-4): 505-527 (2006) - [j4]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees. Graphs Comb. 22(2): 185-202 (2006) - 2005
- [c3]Éric Fusy, Dominique Poulalhon, Gilles Schaeffer:
Dissections and trees, with applications to optimal mesh encoding and to random sampling. SODA 2005: 690-699 - 2004
- [c2]Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer:
Planar Graphs, via Well-Orderly Maps and Trees. WG 2004: 270-284 - 2003
- [j3]Dominique Poulalhon, Gilles Schaeffer:
A bijection for triangulations of a polygon with interior points and multiple edges. Theor. Comput. Sci. 307(2): 385-401 (2003) - [c1]Dominique Poulalhon, Gilles Schaeffer:
Optimal Coding and Sampling of Triangulations. ICALP 2003: 1080-1094 - 2002
- [j2]Dominique Poulalhon, Gilles Schaeffer:
Factorizations of large cycles in the symmetric group. Discret. Math. 254(1-3): 433-458 (2002) - [j1]Robert Cori, Dominique Poulalhon:
Enumeration of (p, q)-parking functions . Discret. Math. 256(3): 609-623 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
