Louis Esperet

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