I am a CNRS researcher at LIX, Ecole Polytechnique.
My main fields of research are enumerative combinatorics and algorithmics on
combinatorial structures (such as random generation, compact encoding, graph drawing).
A shorter version (focusing on the triangulated case),
under the title ``Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings" has appeared in the Proceedings of the 20th International Symposium on Graph Drawing (GD'12), Redmond 2012, Lecture Notes In Computer Science, pages 376-387.
A simple formula for the series of constellations and quasi-constellations with boundaries, with Gwendal Collet. Abstract
A bijection for triangulations, quadrangulations, pentagulations, etc., with Olivier Bernardi. Abstract
Journal of Combinatorial Theory, Ser. A. 119(1) 218-244 (2012).
Short version containing only results for d=3 or 4, under the title "A unified bijective approach
for maps; application to two classes with boundaries": FPSAC'10. pdf
On the diameter of random planar graphs, with Guillaume Chapuy, Omer Giménez, and Marc Noy. Abstract
To appear in Combinatorics, Probability, and Computing. pdf
Short version: Proceedings of the 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings, vol.AM (2010) 65-78.
Asymptotic study of subcritical graph classes, with Michael Drmota, Mihyun Kang, Veronika Kraus, and Juanjo Rué. Abstract
SIAM Journal on Discrete Math 25(4): 1615-1651 (2011).
Asymptotic enumeration and limit laws for graphs of fixed genus, with Guillaume Chapuy, Omer Giménez, Bojan Mohar, and Marc Noy. Abstract
Journal of Combinatorial Theory Ser. A 118(3): 748-777 (2011)
Optimal encoding of triangular and quadrangular meshes of fixed
topology, with Luca Castelli Aleardi and Thomas Lewiner. Abstract
Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG 2010), pages 95-98, 2010.
Bijective counting of involutive Baxter permutations. Abstract
Bijective counting of plane bipolar orientations and Schnyder woods, with Dominique Poulalhon and Gilles Schaeffer. Abstract
European Journal of Combinatorics 30(7): 1646-1658 (2009)
Short version: Proceedings of EuroComb 2007 (Sevilla), Electronic Notes in Discrete Mathematics 29, pp 283-287 (2007).
HyperLogLog, the analysis of a near-optimal
cardinality estimation algorithm, with Philippe Flajolet, Olivier Gandouet,
and Frederic Meunier. Abstract
Proceedings of the AofA'07 Conference (Analysis of Algorithms-2007), published in Discrete Mathematics and Theoretical Computer Science (DMTCS) Proceedings, vol AH, pp. 127-146 (2007).
Boltzmann samplers, Pólya theory, and Cycle-pointing, with Manuel Bodirsky, Mihyun Kang and Stefan Vigerske. Abstract
SIAM Journal on Computing 40(3): 721-769 (2011). pdf.
Short version, under the title "An unbiased pointing operator for unlabeled structures, with applications to counting and sampling": Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA'07), New Orleans 2007,
SIAM press, pages 356-365. pdf
Estimating the number of Active Flows in a Data Stream over a Sliding Window,
with Frederic Giroire. Abstract
the 4th Workshop on Analytic Algorithmics and Combinatorics (ANALCO'07), pages 223-231.
Boltzmann sampling of unlabelled structures, with Philippe Flajolet and Carine Pivoteau. Abstract
the 4th Workshop on Analytic Algorithmics and Combinatorics (ANALCO'07), pages 201-211. pdf
Random sampling of plane partitions, with Olivier Bodini and Carine Pivoteau. Abstract
Combinatorics, Probability and Computing 19(2): 201-226 (2010).
Straight-line drawing of quadrangulations. Abstract
Proceedings of the 14th International Symposium on Graph Drawing (GD'06), Karlsruhe 2006, Lecture Notes In Computer Science, pages 234-239.
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics, with Philippe Flajolet, Xavier Gourdon, Daniel Panario and Nicolas Pouyanne. Abstract
Electron. J. Combin., 13(1) R103, pp. 1-35 (November 2006)
Enumeration and asymptotic properties of unlabeled outerplanar graphs, with Manuel Bodirsky, Mihyun Kang and Stefan Vigerske. Abstract
Uniform random sampling of planar graphs in linear time. Abstract
Random Structures and Algorithms 35(4): 464-522 (2009).
Short version, under the title ``Quadratic exact-size and
random generation of
planar graphs'': Proceedings of the AofA'05 Conference (Analysis of Algorithms-2005), published in Discrete Mathematics and Theoretical Computer Science (DMTCS) Proceedings, vol AD, pp. 125-138 (2005).
Transversal structures on triangulations: a combinatorial study and
straight-line drawings. Abstract
Discrete Math. Volume 309, pages 1870-1894, 2009.
Short version, under the title "Tranversal structures on triangulations, with application to straight-line drawing": Proceedings of the 13th International Symposium on Graph Drawing (GD'05), Limerick 2005, Lecture Notes In Computer Science, pages 177-188. pdf
Dissections, orientations, and trees, with applications to optimal mesh encoding and to random sampling, with Dominique Poulalhon and Gilles Schaeffer. Abstract
Transactions on Algorithms, Volume 4 Number 2, Article 19, 2008.
Short version: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA'05), Vancouver 2005,
SIAM press, pages 690-699.
Counting unrooted maps using
Seminaire Lotharingien de Combinatoire, Volume B54A1, 44pp, 2007. pdf