A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Almost all maps are asymmetric
Journal of Combinatorial Theory Series B
Largest 4-connected components of 3-connected planar triangulations
Random Structures & Algorithms
Isomorph-free exhaustive generation
Journal of Algorithms
A bijective census of nonseparable planar maps
Journal of Combinatorial Theory Series A
Uniform random generation of decomposable structures using floating-point arithmetic
Theoretical Computer Science - Special issue on Caen '97
Determinant algorithms for random planar structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Succinct representation of balanced parentheses, static trees and planar graphs
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Submap Density and Asymmetry Results for Two Parameter Map Families
Combinatorics, Probability and Computing
Planar Maps and Airy Phenomena
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Boltzmann Samplers for the Random Generation of Combinatorial Structures
Combinatorics, Probability and Computing
Dissections and trees, with applications to optimal mesh encoding and to random sampling
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Generating Outerplanar Graphs Uniformly at Random
Combinatorics, Probability and Computing
Generating labeled planar graphs uniformly at random
Theoretical Computer Science
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
ACM Transactions on Algorithms (TALG)
Computational Study on Dominating Set Problem of Planar Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Computational study on planar dominating set problem
Theoretical Computer Science
Uniform random sampling of planar graphs in linear time
Random Structures & Algorithms
Optimal coding and sampling of triangulations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Generating labeled planar graphs uniformly at random
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Computing branch decomposition of large planar graphs
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Transversal structures on triangulations, with application to straight-line drawing
GD'05 Proceedings of the 13th international conference on Graph Drawing
Sampling unlabeled biconnected planar graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |