92 citations · 608 across the 67 of their papers we have counts for
9 papers · 1 filter
Local boxicity
Louis Esperet, Lyuben Lichev
A box is the cartesian product of real intervals, which are either bounded or equal to . A box is said to be -local if at most of the intervals are bounded. In t…
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces
Marthe Bonamy, Nicolas Bousquet, Louis Esperet +4
The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric…
Optimal labelling schemes for adjacency, comparability, and reachability
Marthe Bonamy, Louis Esperet, Carla Groenland +1
We construct asymptotically optimal adjacency labelling schemes for every hereditary class containing -vertex graphs as . This regime contains many cla…
Distributed algorithms for fractional coloring
Nicolas Bousquet, Louis Esperet, François Pirot
In this paper we study fractional coloring from the angle of distributed computing. Fractional coloring is the linear relaxation of the classical notion of coloring, and has many a…
Sparse universal graphs for planarity
Louis Esperet, Gwenaël Joret, Pat Morin
We show that for every integer there exists a graph with vertices and edges such that every -vertex planar graph is isomorphic to a su…
Surfaces have (asymptotic) dimension 2
Marthe Bonamy, Nicolas Bousquet, Louis Esperet +3
The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. When restricted to graphs and their shortest paths metric,…
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…
Clustered 3-Colouring Graphs of Bounded Degree
Vida Dujmović, Louis Esperet, Pat Morin +2
A (not necessarily proper) vertex colouring of a graph has "clustering" if every monochromatic component has at most vertices. We prove that planar graphs with maximum degr…
Packing and covering balls in graphs excluding a minor
Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet +4
We prove that for every integer there exists a constant such that for every -minor-free graph , and every set of balls in , the minimum size of a set…