
Distributed coloring and the local structure of unitdisk graphs
Coloring unitdisk graphs efficiently is an important problem in the glo...
read it

Local certification of graphs on surfaces
A proof labelling scheme for a graph class 𝒞 is an assignment of certifi...
read it

Asymptotic Dimension of MinorClosed Families and AssouadNagata Dimension of Surfaces
The asymptotic dimension is an invariant of metric spaces introduced by ...
read it

Optimal labelling schemes for adjacency, comparability and reachability
We construct asymptotically optimal adjacency labelling schemes for ever...
read it

Distributed algorithms for fractional coloring
In this paper we study fractional coloring from the angle of distributed...
read it

Sparse universal graphs for planarity
We show that for every integer n≥ 1 there exists a graph G_n with (1+o(1...
read it

Adjacency Labelling for Planar Graphs (and Beyond)
We show that there exists an adjacency labelling scheme for planar graph...
read it

Packing and covering balls in graphs excluding a minor
We prove that for every integer t> 1 there exists a constant c_t such th...
read it

Planar graphs have bounded nonrepetitive chromatic number
A colouring of a graph is "nonrepetitive" if for every path of even orde...
read it

Local approximation of the Maximum Cut in regular graphs
This paper is devoted to the distributed complexity of finding an approx...
read it

Distributed coloring of graphs with an optimal number of colors
This paper studies sufficient conditions to obtain efficient distributed...
read it

Least conflict choosability
Given a multigraph, suppose that each vertex is given a local assignment...
read it

Distributed coloring in sparse graphs with fewer colors
This paper is concerned with efficiently coloring sparse graphs in the d...
read it

Separation choosability and dense bipartite induced subgraphs
We study a restricted form of list colouring, for which every pair of li...
read it
Louis Esperet
is this you? claim profile