According to our database
1,
Louis Esperet
authored at least 85 papers
between 2007 and 2025.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2025
Multiparty equality in the local broadcast model.
CoRR, October, 2025
Faithful universal graphs for minor-closed classes.
CoRR, April, 2025
Reductions in local certification.
CoRR, February, 2025
Discret. Math. Theor. Comput. Sci., 2025
2024
Optimization in graphical small cancellation theory.
Discret. Math., April, 2024
The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem.
J. Comb. Theory B, 2024
Colouring strong products.
Eur. J. Comb., 2024
Long induced paths and forbidden patterns: Polylogarithmic bounds.
CoRR, 2024
Long induced paths in sparse graphs and graphs with forbidden patterns.
CoRR, 2024
Renaming in distributed certification.
CoRR, 2024
Coarse Geometry of Quasi-Transitive Graphs Beyond Planarity.
Electron. J. Comb., 2024
Local Certification of Geometric Graph Classes.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024
2023
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Optimal Adjacency Labels for Subgraphs of Cartesian Products.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proof of the Clustered Hadwiger Conjecture.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Local certification of graphs on surfaces.
Theor. Comput. Sci., 2022
Clustered 3-colouring graphs of bounded degree.
Comb. Probab. Comput., 2022
Testability and Local Certification of Monotone Properties in Minor-Closed Classes.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Sketching Distances in Monotone Graph Classes.
Proceedings of the Approximation, 2022
2021
Isometric Universal Graphs.
SIAM J. Discret. Math., 2021
Single-conflict colouring.
J. Graph Theory, 2021
Packing and Covering Balls in Graphs Excluding a Minor.
Comb., 2021
Optimal labelling schemes for adjacency, comparability, and reachability.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Distributed Algorithms for Fractional Coloring.
Proceedings of the Structural Information and Communication Complexity, 2021
Distributed Coloring and the Local Structure of Unit-Disk Graphs.
Proceedings of the Algorithms for Sensor Systems, 2021
2020
Bipartite complements of circle graphs.
Discret. Math., 2020
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces.
CoRR, 2020
Sparse universal graphs for planarity.
CoRR, 2020
Adjacency Labelling for Planar Graphs (and Beyond).
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
Improper coloring of graphs on surfaces.
J. Graph Theory, 2019
Separation Choosability and Dense Bipartite Induced Subgraphs.
Comb. Probab. Comput., 2019
Exact Distance Colouring in Trees.
Comb. Probab. Comput., 2019
Planar graphs have bounded nonrepetitive chromatic number.
CoRR, 2019
Local Approximation of the Maximum Cut in Regular Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019
Distributed Coloring of Graphs with an Optimal Number of Colors.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019
2018
The width of quadrangulations of the projective plane.
J. Graph Theory, 2018
Polynomial expansion and sublinear separators.
Eur. J. Comb., 2018
Least conflict choosability.
CoRR, 2018
Boxicity, Poset Dimension, and Excluded Minors.
Electron. J. Comb., 2018
Distributed Coloring in Sparse Graphs with Fewer Colors.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018
2017
Coloring Jordan Regions and Curves.
SIAM J. Discret. Math., 2017
Flows and Bisections in Cubic Graphs.
J. Graph Theory, 2017
Graphs with No Induced Five-Vertex Path or Antipath.
J. Graph Theory, 2017
Additive bases and flows in graphs.
Electron. Notes Discret. Math., 2017
Long induced paths in graphs.
Eur. J. Comb., 2017
Box Representations of Embedded Graphs.
Discret. Comput. Geom., 2017
Small Feedback Vertex Sets in Planar Digraphs.
Electron. J. Comb., 2017
Graph colorings, flows and perfect matchings. (Coloration de graphes, flots, et couplages parfaits).
, 2017
2016
Islands in Graphs on Surfaces.
SIAM J. Discret. Math., 2016
Boxicity and topological invariants.
Eur. J. Comb., 2016
Coloring pseudo-disks and Jordan curves.
CoRR, 2016
Coloring Non-Crossing Strings.
Electron. J. Comb., 2016
Restricted Frame Graphs and a Conjecture of Scott.
Electron. J. Comb., 2016
2015
On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph.
Discret. Math., 2015
Equitable partition of graphs into induced forests.
Discret. Math., 2015
2014
On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings.
J. Graph Theory, 2014
List-Coloring Claw-Free Graphs with Small Clique Number.
Graphs Comb., 2014
Distance-two coloring of sparse graphs.
Eur. J. Comb., 2014
Colouring Planar Graphs With Three Colours and No Large Monochromatic Components.
Comb. Probab. Comput., 2014
2013
A Complexity Dichotomy for the Coloring of Sparse Graphs.
J. Graph Theory, 2013
Fire Containment in Planar Graphs.
J. Graph Theory, 2013
Boxicity of Graphs on Surfaces.
Graphs Comb., 2013
Acyclic edge-coloring using entropy compression.
Eur. J. Comb., 2013
The chromatic number of {<i>P</i><sub>5</sub>, <i>K</i><sub>4</sub>}-free graphs.
Discret. Math., 2013
Coloring planar graphs with three colors and no large monochromatic components
CoRR, 2013
A unified approach to distance-two colouring of graphs on surfaces.
Comb., 2013
2012
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs.
Eur. J. Comb., 2012
Locally Identifying Coloring of Graphs.
Electron. J. Comb., 2012
2010
An improved linear bound on the number of perfect matchings in cubic graphs.
Eur. J. Comb., 2010
Acyclic improper colourings of graphs with bounded maximum degree.
Discret. Math., 2010
Covering line graphs with equivalence relations.
Discret. Appl. Math., 2010
Dynamic list coloring of bipartite graphs.
Discret. Appl. Math., 2010
2009
Adapted list coloring of planar graphs.
J. Graph Theory, 2009
Cubic bridgeless graphs have more than a linear number of perfect matchings.
Electron. Notes Discret. Math., 2009
Coloring a set of touching strings.
Electron. Notes Discret. Math., 2009
Boxicity of graphs with bounded degree.
Eur. J. Comb., 2009
Game colouring of the square of graphs.
Discret. Math., 2009
A unified approach to distance-two colouring of planar graphs.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
2008
On induced-universal graphs for the class of bounded-degree graphs.
Inf. Process. Lett., 2008
Linear choosability of graphs.
Discret. Math., 2008
2007
Oriented colorings of 2-outerplanar graphs.
Inf. Process. Lett., 2007
Acyclic improper choosability of graphs.
Electron. Notes Discret. Math., 2007
On circle graphs with girth at least five.
Electron. Notes Discret. Math., 2007
Frugal Colouring of Graphs
CoRR, 2007
