-
A limit process for partial match queries in random quadtrees and 2-d trees
arXiv admin note: text overlap with arXiv:1107.2231 -
Partial match queries in random quadtrees
12 pages, 2 figures -
The total path length of split trees
International audience -
The distribution of height and diameter in random non-plane binary trees
International audience -
The continuum limit of critical random graphs
34 pages, 5 figures -
The scaling limit of the minimum spanning tree of the complete graph
International audience -
The dual tree of a recursive triangulation of the disk
International audience -
Cutting down trees with a Markov chainsaw
International audience -
Connectivity threshold for Bluetooth graphs
International audience -
Longest path distance in random circuits
21 pages, 2 figures -
A Hajós-like theorem for weighted coloring
International audience -
Linear time low tree-width partitions and algorithmic consequences
Classes of graphs with bounded expansion generalize both proper minor closed classes and classes with bounded degree. For any class with bounded expansion C and any... -
Cycle codes of graphs and MDS array codes
International audience -
Prüfer codes for hypertrees
20 pages -
On the number of simple arrangements of five double pseudolines
International audience -
Prodsimplicial neighborly polytopes
International audience -
Multitriangulations as complexes of star-polygons
International audience -
Multitriangulations, pseudotriangulations and primitive sorting networks
International audience -
The brick polytope of a sorting network
International audience -
On a dispersion problem in grid labeling
International audience
