Louis Esperet | DeepAI

AI Chat

Featured Co-authors

Édouard Bonnet
45 publications
Nicolas Bousquet
43 publications
Andrey Kupavskii
35 publications
Gwenaël Joret
32 publications
Stéphan Thomassé
31 publications
Marthe Bonamy
30 publications
David R. Wood
29 publications
Pat Morin
26 publications
Vida Dujmovic
25 publications
Viktor Zamaraev
25 publications
Zdeněk Dvořák
23 publications

∙ 06/09/2023

Proof of the Clustered Hadwiger Conjecture

Hadwiger's Conjecture asserts that every K_h-minor-free graph is properl...

0 Vida Dujmovic, et al. ∙

∙ 04/04/2023

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem

An infinite graph is quasi-transitive if its vertex set has finitely man...

0 Louis Esperet, et al. ∙

∙ 06/06/2022

Optimal Adjacency Labels for Subgraphs of Cartesian Products

For any hereditary graph class ℱ, we construct optimal adjacency labelin...

0 Louis Esperet, et al. ∙

∙ 06/01/2022

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth

A graph is O_k-free if it does not contain k pairwise vertex-disjoint an...

0 Marthe Bonamy, et al. ∙

∙ 02/18/2022

Sketching Distances in Monotone Graph Classes

We study the problems of adjacency sketching, small-distance sketching, ...

0 Louis Esperet, et al. ∙

∙ 02/01/2022

Testability and local certification of monotone properties in minor-closed classes

The main problem in the area of property testing is to understand which ...

0 Louis Esperet, et al. ∙

∙ 06/23/2021

Distributed coloring and the local structure of unit-disk graphs

Coloring unit-disk graphs efficiently is an important problem in the glo...

0 Louis Esperet, et al. ∙

∙ 02/08/2021

Local certification of graphs on surfaces

A proof labelling scheme for a graph class 𝒞 is an assignment of certifi...

0 Louis Esperet, et al. ∙

∙ 12/04/2020

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces

The asymptotic dimension is an invariant of metric spaces introduced by ...

0 Marthe Bonamy, et al. ∙

∙ 12/03/2020

Optimal labelling schemes for adjacency, comparability and reachability

We construct asymptotically optimal adjacency labelling schemes for ever...

0 Marthe Bonamy, et al. ∙

∙ 12/03/2020

Distributed algorithms for fractional coloring

In this paper we study fractional coloring from the angle of distributed...

0 Nicolas Bousquet, et al. ∙

∙ 10/12/2020

Sparse universal graphs for planarity

We show that for every integer n≥ 1 there exists a graph G_n with (1+o(1...

0 Louis Esperet, et al. ∙

∙ 03/09/2020

Adjacency Labelling for Planar Graphs (and Beyond)

We show that there exists an adjacency labelling scheme for planar graph...

0 Vida Dujmovic, et al. ∙

∙ 01/13/2020

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...

0 Nicolas Bousquet, et al. ∙

∙ 04/10/2019

Planar graphs have bounded nonrepetitive chromatic number

A colouring of a graph is "nonrepetitive" if for every path of even orde...

0 Vida Dujmovic, et al. ∙

∙ 02/13/2019

Local approximation of the Maximum Cut in regular graphs

This paper is devoted to the distributed complexity of finding an approx...

0 Étienne Bamas, et al. ∙

∙ 09/21/2018

Distributed coloring of graphs with an optimal number of colors

This paper studies sufficient conditions to obtain efficient distributed...

0 Étienne Bamas, et al. ∙

∙ 03/29/2018

Least conflict choosability

Given a multigraph, suppose that each vertex is given a local assignment...

0 Zdeněk Dvořák, et al. ∙

∙ 02/15/2018

Distributed coloring in sparse graphs with fewer colors

This paper is concerned with efficiently coloring sparse graphs in the d...

0 Pierre Aboulker, et al. ∙

∙ 02/11/2018

Separation choosability and dense bipartite induced subgraphs

We study a restricted form of list colouring, for which every pair of li...

0 Louis Esperet, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world