30 citations · 52 across the 10 of their papers we have counts for
13 papers
Minor-Universal Graph for Graphs on Surfaces
Cyril Gavoille, Claire Hilaire
We show that for integer every and every surface , there is a graph embeddable on with at most vertices that contains as a minor every -vertex graph embeddabl…
Isometric universal graphs
Louis Esperet, Cyril Gavoille, Carla Groenland
A subgraph of a graph is isometric if the distances between vertices in coincide with the distances between the corresponding vertices in . We show that for any inte…
Adjacency Labelling for Planar Graphs (and Beyond)
Vida Dujmović, Louis Esperet, Gwenaël Joret +3
We show that there exists an adjacency labelling scheme for planar graphs where each vertex of an -vertex planar graph is assigned a -bit label and the lab…
Shorter Labeling Schemes for Planar Graphs
Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
An \emph{adjacency labeling scheme} for a given class of graphs is an algorithm that for every graph from the class, assigns bit strings (labels) to vertices of so that for…
Towards Plane Spanners of Degree 3
Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel +3
Let be a finite set of points in the plane that are in convex position. We present an algorithm that constructs a plane -spanner of whose vertex degree is a…
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation
Leonid Barenboim, Michael Elkin, Cyril Gavoille
A partition of into clusters of strong (respectively, weak) diameter , such that the supergraph obtained by contracting each is -colo…