Louis Esperet

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 73

Top Venues

Publications

Louis Esperet, David R. Wood
Colouring strong products. Eur. J. Comb. 121 (2024)
Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. J. Comb. Theory B 167 (2024)
Louis Esperet, Ugo Giocanti
Coarse Geometry of Quasi-Transitive Graphs Beyond Planarity. Electron. J. Comb. 31 (2) (2024)
Louis Esperet, Ugo Giocanti
Optimization in graphical small cancellation theory. Discret. Math. 347 (4) (2024)
Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond
Local Certification of Geometric Graph Classes. MFCS (2024)
Louis Esperet, Nathaniel Harms, Viktor Zamaraev
Optimal Adjacency Labels for Subgraphs of Cartesian Products. SIAM J. Discret. Math. 38 (3) (2024)
Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood
Proof of the Clustered Hadwiger Conjecture. FOCS (2023)
Louis Esperet, Nathaniel Harms, Viktor Zamaraev
Optimal Adjacency Labels for Subgraphs of Cartesian Products. ICALP (2023)
Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. SODA (2023)
Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood
Proof of the Clustered Hadwiger Conjecture. CoRR (2023)
Louis Esperet, Sébastien Julliot, Arnaud de Mesmay
Distributed coloring and the local structure of unit-disk graphs. Theor. Comput. Sci. 944 (2023)
Louis Esperet, Ugo Giocanti, Clément Legrand-Duchesne
The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem. CoRR (2023)
Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond
Local certification of geometric graph classes. CoRR (2023)
Louis Esperet, Lyuben Lichev
Local boxicity. Eur. J. Comb. 102 (2022)
Louis Esperet, Sergey Norin
Testability and local certification of monotone properties in minor-closed classes. CoRR (2022)
Louis Esperet, Benjamin Lévêque
Local certification of graphs on surfaces. Theor. Comput. Sci. 909 (2022)
Louis Esperet, Nathaniel Harms, Andrey Kupavskii
Sketching Distances in Monotone Graph Classes. APPROX/RANDOM (2022)
Louis Esperet, Nathaniel Harms, Andrey Kupavskii
Sketching Distances in Monotone Graph Classes. CoRR (2022)
Louis Esperet, Sergey Norin
Testability and Local Certification of Monotone Properties in Minor-Closed Classes. ICALP (2022)
Louis Esperet, Nathaniel Harms, Viktor Zamaraev
Optimal Adjacency Labels for Subgraphs of Cartesian Products. CoRR (2022)
Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. CoRR (2022)
Vida Dujmovic, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood
Clustered 3-colouring graphs of bounded degree. Comb. Probab. Comput. 31 (1) (2022)
Louis Esperet, Benjamin Lévêque
Local certification of graphs on surfaces. CoRR (2021)
Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond). J. ACM 68 (6) (2021)
Louis Esperet, Sébastien Julliot, Arnaud de Mesmay
Distributed Coloring and the Local Structure of Unit-Disk Graphs. ALGOSENSORS (2021)
Louis Esperet, Cyril Gavoille, Carla Groenland
Isometric Universal Graphs. SIAM J. Discret. Math. 35 (2) (2021)
Nicolas Bousquet, Louis Esperet, François Pirot
Distributed Algorithms for Fractional Coloring. SIROCCO (2021)
Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki
Single-conflict colouring. J. Graph Theory 97 (1) (2021)
Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott
Optimal labelling schemes for adjacency, comparability, and reachability. STOC (2021)
Louis Esperet, Sébastien Julliot, Arnaud de Mesmay
Distributed coloring and the local structure of unit-disk graphs. CoRR (2021)
Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot
Packing and Covering Balls in Graphs Excluding a Minor. Comb. 41 (3) (2021)
Nicolas Bousquet, Wouter Cames van Batenburg, Louis Esperet, Gwenaël Joret, William Lochet, Carole Muller, François Pirot
Packing and covering balls in graphs excluding a minor. CoRR (2020)
Louis Esperet, Matej Stehlík
Bipartite complements of circle graphs. Discret. Math. 343 (6) (2020)
Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond). FOCS (2020)
Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin
Adjacency Labelling for Planar Graphs (and Beyond). CoRR (2020)
Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott
Optimal labelling schemes for adjacency, comparability and reachability. CoRR (2020)
Louis Esperet, Gwenaël Joret, Pat Morin
Sparse universal graphs for planarity. CoRR (2020)
Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, François Pirot, Alex D. Scott
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces. CoRR (2020)
Nicolas Bousquet, Louis Esperet, François Pirot
Distributed algorithms for fractional coloring. CoRR (2020)
Étienne Bamas, Louis Esperet
Local approximation of the Maximum Cut in regular graphs. Theor. Comput. Sci. 820 (2020)
Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet
Distributed Coloring in Sparse Graphs with Fewer Colors. Electron. J. Comb. 26 (4) (2019)
Étienne Bamas, Louis Esperet
Local Approximation of the Maximum Cut in Regular Graphs. WG (2019)
Étienne Bamas, Louis Esperet
Local approximation of the Maximum Cut in regular graphs. CoRR (2019)
Louis Esperet, Ross J. Kang, Stéphan Thomassé
Separation Choosability and Dense Bipartite Induced Subgraphs. Comb. Probab. Comput. 28 (5) (2019)
Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos
Exact Distance Colouring in Trees. Comb. Probab. Comput. 28 (2) (2019)
Étienne Bamas, Louis Esperet
Distributed Coloring of Graphs with an Optimal Number of Colors. STACS (2019)
Ilkyoo Choi, Louis Esperet
Improper coloring of graphs on surfaces. J. Graph Theory 91 (1) (2019)
Vida Dujmovic, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood
Planar graphs have bounded nonrepetitive chromatic number. CoRR (2019)
Louis Esperet, Jean-Florent Raymond
Polynomial expansion and sublinear separators. Eur. J. Comb. 69 (2018)
Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki
Least conflict choosability. CoRR (2018)
Étienne Bamas, Louis Esperet
Distributed coloring of graphs with an optimal number of colors. CoRR (2018)
Louis Esperet, Ross J. Kang, Stéphan Thomassé
Separation choosability and dense bipartite induced subgraphs. CoRR (2018)
Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet
Distributed coloring in sparse graphs with fewer colors. CoRR (2018)
Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet
Distributed Coloring in Sparse Graphs with Fewer Colors. PODC (2018)
Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé
Additive Bases and Flows in Graphs. SIAM J. Discret. Math. 32 (1) (2018)
Louis Esperet, Matej Stehlík
The width of quadrangulations of the projective plane. J. Graph Theory 89 (1) (2018)
Louis Esperet, Veit Wiechert
Boxicity, Poset Dimension, and Excluded Minors. Electron. J. Comb. 25 (4) (2018)
Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi
Flows and Bisections in Cubic Graphs. J. Graph Theory 86 (2) (2017)
Louis Esperet
Box Representations of Embedded Graphs. Discret. Comput. Geom. 57 (3) (2017)
Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev
Graphs with No Induced Five-Vertex Path or Antipath. J. Graph Theory 84 (3) (2017)
Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé
Additive bases and flows in graphs. Electron. Notes Discret. Math. 61 (2017)
Louis Esperet, Laetitia Lemoine, Frédéric Maffray
Long induced paths in graphs. Eur. J. Comb. 62 (2017)
Louis Esperet, Laetitia Lemoine, Frédéric Maffray
Small Feedback Vertex Sets in Planar Digraphs. Electron. J. Comb. 24 (2) (2017)
Wouter Cames van Batenburg, Louis Esperet, Tobias Müller
Coloring Jordan Regions and Curves. SIAM J. Discret. Math. 31 (3) (2017)
Louis Esperet, Pascal Ochem
Islands in Graphs on Surfaces. SIAM J. Discret. Math. 30 (1) (2016)
Jérémie Chalopin, Louis Esperet, Zhentao Li, Patrice Ossona de Mendez
Restricted Frame Graphs and a Conjecture of Scott. Electron. J. Comb. 23 (1) (2016)
Wouter Cames van Batenburg, Louis Esperet, Tobias Müller
Coloring pseudo-disks and Jordan curves. CoRR (2016)
Louis Esperet
Boxicity and topological invariants. Eur. J. Comb. 51 (2016)
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
Coloring Non-Crossing Strings. Electron. J. Comb. 23 (4) (2016)
Louis Esperet, Giuseppe Mazzuoccolo
On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph. Discret. Math. 338 (8) (2015)
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
Coloring non-crossing strings. CoRR (2015)
Louis Esperet
Box representations of embedded graphs. CoRR (2015)
Louis Esperet, Laetitia Lemoine, Frédéric Maffray
Equitable partition of graphs into induced forests. Discret. Math. 338 (8) (2015)
Louis Esperet, András Gyárfás, Frédéric Maffray
List-Coloring Claw-Free Graphs with Small Clique Number. Graphs Comb. 30 (2) (2014)
Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev
Graphs with no induced five-vertex path or antipath. CoRR (2014)
Zdenek Dvorák, Louis Esperet
Distance-two coloring of sparse graphs. Eur. J. Comb. 36 (2014)
Louis Esperet, Giuseppe Mazzuoccolo
On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings. J. Graph Theory 77 (2) (2014)
Louis Esperet, Gwenaël Joret
Colouring Planar Graphs With Three Colours and No Large Monochromatic Components. Comb. Probab. Comput. 23 (4) (2014)
Louis Esperet, Gwenaël Joret
Coloring planar graphs with three colors and no large monochromatic components CoRR (2013)
Louis Esperet, Gwenaël Joret
Boxicity of Graphs on Surfaces. Graphs Comb. 29 (3) (2013)
Louis Esperet, Jan van den Heuvel, Frédéric Maffray, Félix Sipma
Fire Containment in Planar Graphs. J. Graph Theory 73 (3) (2013)
Omid Amini, Louis Esperet, Jan van den Heuvel
A unified approach to distance-two colouring of graphs on surfaces. Comb. 33 (3) (2013)
Louis Esperet, Aline Parreau
Acyclic edge-coloring using entropy compression. Eur. J. Comb. 34 (6) (2013)
Louis Esperet, Laetitia Lemoine, Frédéric Maffray, Grégory Morel
}-free graphs. Discret. Math. 313 (6) (2013)
Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou
A Complexity Dichotomy for the Coloring of Sparse Graphs. J. Graph Theory 73 (1) (2013)
Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau
Locally Identifying Coloring of Graphs. Electron. J. Comb. 19 (2) (2012)
Louis Esperet, Frantisek Kardos, Daniel Král'
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs. Eur. J. Comb. 33 (5) (2012)
Louis Esperet, Daniel Král', Petr Skoda, Riste Skrekovski
An improved linear bound on the number of perfect matchings in cubic graphs. Eur. J. Comb. 31 (5) (2010)
Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau
Locally identifying coloring of graphs CoRR (2010)
Louis Esperet
Dynamic list coloring of bipartite graphs. Discret. Appl. Math. 158 (17) (2010)
Louis Esperet, John Gimbel, Andrew D. King
Covering line graphs with equivalence relations. Discret. Appl. Math. 158 (17) (2010)
Louigi Addario-Berry, Louis Esperet, Ross J. Kang, Colin J. H. McDiarmid, Alexandre Pinlou
Acyclic improper colourings of graphs with bounded maximum degree. Discret. Math. 310 (2) (2010)
Omid Amini, Louis Esperet, Jan van den Heuvel
A unified approach to distance-two colouring of planar graphs. SODA (2009)
Louis Esperet
Boxicity of graphs with bounded degree. Eur. J. Comb. 30 (5) (2009)
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
Coloring a set of touching strings. Electron. Notes Discret. Math. 34 (2009)
Louis Esperet, Pascal Ochem
On circle graphs with girth at least five. Discret. Math. 309 (8) (2009)
Louis Esperet, Xuding Zhu
Game colouring of the square of graphs. Discret. Math. 309 (13) (2009)
Louis Esperet, Frantisek Kardos, Daniel Král
Cubic bridgeless graphs have more than a linear number of perfect matchings. Electron. Notes Discret. Math. 34 (2009)
Louis Esperet, Mickaël Montassier, Xuding Zhu
Adapted list coloring of planar graphs. J. Graph Theory 62 (2) (2009)
Louis Esperet, Arnaud Labourel, Pascal Ochem
On induced-universal graphs for the class of bounded-degree graphs. Inf. Process. Lett. 108 (5) (2008)

Louis Esperet.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Louis Esperet