Gilles Schaeffer

According to our database1, Gilles Schaeffer authored at least 36 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the enumeration of plane bipolar posets and transversal structures.
Eur. J. Comb., February, 2024

2023
Enumeration of Corner Polyhedra and 3-Connected Schnyder Labelings.
Electron. J. Comb., 2023

2014
Uniform random sampling of simple branched coverings of the sphere by itself.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2012
Odd permutations are nicer than even ones.
Eur. J. Comb., 2012

2011
Permutations with few internal points.
Electron. Notes Discret. Math., 2011

2009
A Bijection for Rooted Maps on Orientable Surfaces.
SIAM J. Discret. Math., 2009

Bijective counting of plane bipolar orientations and Schnyder woods.
Eur. J. Comb., 2009

2008
Succinct representations of planar maps.
Theor. Comput. Sci., 2008

Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling.
ACM Trans. Algorithms, 2008

A combinatorial approach to jumping particles: The parallel TASEP.
Random Struct. Algorithms, 2008

A bijective proof of Jackson's formula for the number of factorizations of a cycle.
J. Comb. Theory A, 2008

Preface.
Electron. Notes Discret. Math., 2008

The number of Z-convex polyominoes.
Adv. Appl. Math., 2008

2007
Bijective counting of plane bipolar orientations.
Electron. Notes Discret. Math., 2007

2006
Planar Graphs, via Well-Orderly Maps and Trees.
Graphs Comb., 2006

Optimal Coding and Sampling of Triangulations.
Algorithmica, 2006

Optimal succinct representations of planar maps.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
A combinatorial approach to jumping particles.
J. Comb. Theory A, 2005

Succinct Representation of Triangulations with a Boundary.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Dissections and trees, with applications to optimal mesh encoding and to random sampling.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Dynamic updates of succinct triangulations.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
On the Asymptotic Number of Plane Curves and Alternating Knots.
Exp. Math., 2004

Boltzmann Samplers for the Random Generation of Combinatorial Structures.
Comb. Probab. Comput., 2004

Airy Phenomena and Analytic Combinatorics of Connected Graphs.
Electron. J. Comb., 2004

2003
A bijection for triangulations of a polygon with interior points and multiple edges.
Theor. Comput. Sci., 2003

Description trees and Tutte formulas.
Theor. Comput. Sci., 2003

2002
Factorizations of large cycles in the symmetric group.
Discret. Math., 2002

Random Sampling from Boltzmann Principles.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001
Random maps, coalescing saddles, singularity analysis, and Airy phenomena.
Random Struct. Algorithms, 2001

Approximation of a Direction of Nd in Bounded Coordinates.
Mob. Networks Appl., 2001

2000
Enumeration of Planar Constellations.
Adv. Appl. Math., 2000

Planar Maps and Airy Phenomena.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Random Sampling of Large Planar Maps and Convex Polyhedra.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998
A Bijective Census of Nonseparable Planar Maps.
J. Comb. Theory A, 1998

Factoring N-Cycles and Counting Maps of Given Genus.
Eur. J. Comb., 1998

1997
Bijective Census and Random Generation of Eulerian Planar Maps With Prescribed Degrees.
Electron. J. Comb., 1997


  Loading...