Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLouis Esperet
Person information
- affiliation: Grenoble Alpes University, G-SCOP Lab, Grenoble, France
- affiliation (PhD 2008 ): University of Bordeaux, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2017
[b1]Louis Esperet:
Graph colorings, flows and perfect matchings. (Coloration de graphes, flots, et couplages parfaits). Grenoble Alpes University, France, 2017
Journal Articles
- 2024
- [j59]Louis Esperet, Ugo Giocanti
:
Optimization in graphical small cancellation theory. Discret. Math. 347(4): 113842 (2024) - 2023
- [j58]Louis Esperet, Sébastien Julliot, Arnaud de Mesmay:
Distributed coloring and the local structure of unit-disk graphs. Theor. Comput. Sci. 944: 113674 (2023) - 2022
- [j57]Vida Dujmovic, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood:
Clustered 3-colouring graphs of bounded degree. Comb. Probab. Comput. 31(1): 123-135 (2022) - [j56]Louis Esperet, Lyuben Lichev:
Local boxicity. Eur. J. Comb. 102: 103495 (2022) - [j55]Louis Esperet, Benjamin Lévêque:
Local certification of graphs on surfaces. Theor. Comput. Sci. 909: 68-75 (2022) - 2021
- [j54]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): 299-318 (2021) - [j53]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). J. ACM 68(6): 42:1-42:33 (2021) - [j52]Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki:
Single-conflict colouring. J. Graph Theory 97(1): 148-160 (2021) - [j51]Louis Esperet, Cyril Gavoille, Carla Groenland:
Isometric Universal Graphs. SIAM J. Discret. Math. 35(2): 1224-1237 (2021) - 2020
- [j50]Louis Esperet, Matej Stehlík:
Bipartite complements of circle graphs. Discret. Math. 343(6): 111834 (2020) - [j49]Étienne Bamas, Louis Esperet:
Local approximation of the Maximum Cut in regular graphs. Theor. Comput. Sci. 820: 45-59 (2020) - 2019
- [j48]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed Coloring in Sparse Graphs with Fewer Colors. Electron. J. Comb. 26(4): 4 (2019) - [j47]Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos:
Exact Distance Colouring in Trees. Comb. Probab. Comput. 28(2): 177-186 (2019) - [j46]Louis Esperet, Ross J. Kang, Stéphan Thomassé:
Separation Choosability and Dense Bipartite Induced Subgraphs. Comb. Probab. Comput. 28(5): 720-732 (2019) - [j45]Ilkyoo Choi, Louis Esperet:
Improper coloring of graphs on surfaces. J. Graph Theory 91(1): 16-34 (2019) - 2018
- [j44]Louis Esperet, Veit Wiechert:
Boxicity, Poset Dimension, and Excluded Minors. Electron. J. Comb. 25(4): 4 (2018) - [j43]Louis Esperet, Jean-Florent Raymond:
Polynomial expansion and sublinear separators. Eur. J. Comb. 69: 49-53 (2018) - [j42]Louis Esperet, Matej Stehlík:
The width of quadrangulations of the projective plane. J. Graph Theory 89(1): 76-88 (2018) - [j41]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): 534-542 (2018) - 2017
- [j40]Louis Esperet, Laetitia Lemoine, Frédéric Maffray:
Small Feedback Vertex Sets in Planar Digraphs. Electron. J. Comb. 24(2): 2 (2017) - [j39]Louis Esperet:
Box Representations of Embedded Graphs. Discret. Comput. Geom. 57(3): 590-606 (2017) - [j38]Louis Esperet, Laetitia Lemoine, Frédéric Maffray:
Long induced paths in graphs. Eur. J. Comb. 62: 1-14 (2017) - [j37]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: 399-405 (2017) - [j36]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): 221-232 (2017) - [j35]Louis Esperet, Giuseppe Mazzuoccolo, Michael Tarsi:
Flows and Bisections in Cubic Graphs. J. Graph Theory 86(2): 149-158 (2017) - [j34]Wouter Cames van Batenburg, Louis Esperet, Tobias Müller:
Coloring Jordan Regions and Curves. SIAM J. Discret. Math. 31(3): 1670-1684 (2017) - 2016
- [j33]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): 1 (2016) - [j32]Louis Esperet, Daniel Gonçalves, Arnaud Labourel:
Coloring Non-Crossing Strings. Electron. J. Comb. 23(4): 4 (2016) - [j31]Louis Esperet:
Boxicity and topological invariants. Eur. J. Comb. 51: 495-499 (2016) - [j30]Louis Esperet, Pascal Ochem:
Islands in Graphs on Surfaces. SIAM J. Discret. Math. 30(1): 206-219 (2016) - 2015
- [j29]Louis Esperet, Laetitia Lemoine, Frédéric Maffray:
Equitable partition of graphs into induced forests. Discret. Math. 338(8): 1481-1483 (2015) - [j28]Louis Esperet, Giuseppe Mazzuoccolo:
On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph. Discret. Math. 338(8): 1509-1514 (2015) - 2014
- [j27]Louis Esperet, Gwenaël Joret:
Colouring Planar Graphs With Three Colours and No Large Monochromatic Components. Comb. Probab. Comput. 23(4): 551-570 (2014) - [j26]Zdenek Dvorák, Louis Esperet:
Distance-two coloring of sparse graphs. Eur. J. Comb. 36: 406-415 (2014) - [j25]Louis Esperet, András Gyárfás, Frédéric Maffray:
List-Coloring Claw-Free Graphs with Small Clique Number. Graphs Comb. 30(2): 365-375 (2014) - [j24]Louis Esperet, Giuseppe Mazzuoccolo:
On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings. J. Graph Theory 77(2): 144-157 (2014) - 2013
- [j23]Omid Amini, Louis Esperet, Jan van den Heuvel:
A unified approach to distance-two colouring of graphs on surfaces. Comb. 33(3): 253-296 (2013) - [j22]Louis Esperet, Laetitia Lemoine, Frédéric Maffray, Grégory Morel:
The chromatic number of {P5, K4}-free graphs. Discret. Math. 313(6): 743-754 (2013) - [j21]Louis Esperet, Aline Parreau:
Acyclic edge-coloring using entropy compression. Eur. J. Comb. 34(6): 1019-1027 (2013) - [j20]Louis Esperet, Gwenaël Joret:
Boxicity of Graphs on Surfaces. Graphs Comb. 29(3): 417-427 (2013) - [j19]Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou:
A Complexity Dichotomy for the Coloring of Sparse Graphs. J. Graph Theory 73(1): 85-102 (2013) - [j18]Louis Esperet, Jan van den Heuvel, Frédéric Maffray, Félix Sipma:
Fire Containment in Planar Graphs. J. Graph Theory 73(3): 267-279 (2013) - 2012
- [j17]Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau:
Locally Identifying Coloring of Graphs. Electron. J. Comb. 19(2): 40 (2012) - [j16]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): 767-798 (2012) - 2010
- [j15]Louis Esperet, John Gimbel, Andrew D. King:
Covering line graphs with equivalence relations. Discret. Appl. Math. 158(17): 1902-1907 (2010) - [j14]Louis Esperet:
Dynamic list coloring of bipartite graphs. Discret. Appl. Math. 158(17): 1963-1965 (2010) - [j13]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): 223-229 (2010) - [j12]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): 1316-1334 (2010) - 2009
- [j11]Louis Esperet, Pascal Ochem:
On circle graphs with girth at least five. Discret. Math. 309(8): 2217-2222 (2009) - [j10]Louis Esperet, Xuding Zhu:
Game colouring of the square of graphs. Discret. Math. 309(13): 4514-4521 (2009) - [j9]Louis Esperet:
Boxicity of graphs with bounded degree. Eur. J. Comb. 30(5): 1277-1280 (2009) - [j8]Louis Esperet, Daniel Gonçalves, Arnaud Labourel:
Coloring a set of touching strings. Electron. Notes Discret. Math. 34: 213-217 (2009) - [j7]Louis Esperet, Frantisek Kardos, Daniel Král:
Cubic bridgeless graphs have more than a linear number of perfect matchings. Electron. Notes Discret. Math. 34: 411-415 (2009) - [j6]Louis Esperet, Mickaël Montassier, Xuding Zhu:
Adapted list coloring of planar graphs. J. Graph Theory 62(2): 127-138 (2009) - 2008
- [j5]Louis Esperet, Mickaël Montassier, André Raspaud:
Linear choosability of graphs. Discret. Math. 308(17): 3938-3950 (2008) - [j4]Louis Esperet, Arnaud Labourel, Pascal Ochem:
On induced-universal graphs for the class of bounded-degree graphs. Inf. Process. Lett. 108(5): 255-260 (2008) - 2007
- [j3]Louis Esperet, Alexandre Pinlou:
Acyclic improper choosability of graphs. Electron. Notes Discret. Math. 28: 251-258 (2007) - [j2]Louis Esperet, Pascal Ochem:
On circle graphs with girth at least five. Electron. Notes Discret. Math. 29: 129-133 (2007) - [j1]Louis Esperet, Pascal Ochem:
Oriented colorings of 2-outerplanar graphs. Inf. Process. Lett. 101(5): 215-219 (2007)
Conference and Workshop Papers
- 2023
- [c13]Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood:
Proof of the Clustered Hadwiger Conjecture. FOCS 2023: 1921-1930 - [c12]Louis Esperet, Nathaniel Harms, Viktor Zamaraev:
Optimal Adjacency Labels for Subgraphs of Cartesian Products. ICALP 2023: 57:1-57:11 - [c11]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: 3006-3028 - 2022
- [c10]Louis Esperet, Nathaniel Harms, Andrey Kupavskii:
Sketching Distances in Monotone Graph Classes. APPROX/RANDOM 2022: 18:1-18:23 - [c9]Louis Esperet, Sergey Norin:
Testability and Local Certification of Monotone Properties in Minor-Closed Classes. ICALP 2022: 58:1-58:15 - 2021
- [c8]Louis Esperet, Sébastien Julliot, Arnaud de Mesmay:
Distributed Coloring and the Local Structure of Unit-Disk Graphs. ALGOSENSORS 2021: 61-75 - [c7]Nicolas Bousquet, Louis Esperet, François Pirot:
Distributed Algorithms for Fractional Coloring. SIROCCO 2021: 15-30 - [c6]Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott:
Optimal labelling schemes for adjacency, comparability, and reachability. STOC 2021: 1109-1117 - 2020
- [c5]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). FOCS 2020: 577-588 - 2019
- [c4]Étienne Bamas, Louis Esperet:
Distributed Coloring of Graphs with an Optimal Number of Colors. STACS 2019: 10:1-10:15 - [c3]Étienne Bamas, Louis Esperet:
Local Approximation of the Maximum Cut in Regular Graphs. WG 2019: 66-78 - 2018
- [c2]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed Coloring in Sparse Graphs with Fewer Colors. PODC 2018: 419-425 - 2009
- [c1]Omid Amini, Louis Esperet, Jan van den Heuvel:
A unified approach to distance-two colouring of planar graphs. SODA 2009: 273-282
Informal and Other Publications
- 2023
- [i28]Louis Esperet, Ugo Giocanti, Clément Legrand-Duchesne:
The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem. CoRR abs/2304.01823 (2023) - [i27]Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood:
Proof of the Clustered Hadwiger Conjecture. CoRR abs/2306.06224 (2023) - [i26]Oscar Defrain, Louis Esperet, Aurélie Lagoutte, Pat Morin, Jean-Florent Raymond:
Local certification of geometric graph classes. CoRR abs/2311.16953 (2023) - 2022
- [i25]Louis Esperet, Sergey Norin:
Testability and local certification of monotone properties in minor-closed classes. CoRR abs/2202.00543 (2022) - [i24]Louis Esperet, Nathaniel Harms, Andrey Kupavskii:
Sketching Distances in Monotone Graph Classes. CoRR abs/2202.09253 (2022) - [i23]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 abs/2206.00594 (2022) - [i22]Louis Esperet, Nathaniel Harms, Viktor Zamaraev:
Optimal Adjacency Labels for Subgraphs of Cartesian Products. CoRR abs/2206.02872 (2022) - 2021
- [i21]Louis Esperet, Benjamin Lévêque:
Local certification of graphs on surfaces. CoRR abs/2102.04133 (2021) - [i20]Louis Esperet, Sébastien Julliot, Arnaud de Mesmay:
Distributed coloring and the local structure of unit-disk graphs. CoRR abs/2106.12322 (2021) - 2020
- [i19]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 abs/2001.04517 (2020) - [i18]Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). CoRR abs/2003.04280 (2020) - [i17]Louis Esperet, Gwenaël Joret, Pat Morin:
Sparse universal graphs for planarity. CoRR abs/2010.05779 (2020) - [i16]Nicolas Bousquet, Louis Esperet, François Pirot:
Distributed algorithms for fractional coloring. CoRR abs/2012.01752 (2020) - [i15]Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott:
Optimal labelling schemes for adjacency, comparability and reachability. CoRR abs/2012.01764 (2020) - [i14]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 abs/2012.02435 (2020) - 2019
- [i13]Étienne Bamas, Louis Esperet:
Local approximation of the Maximum Cut in regular graphs. CoRR abs/1902.04899 (2019) - [i12]Vida Dujmovic, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood:
Planar graphs have bounded nonrepetitive chromatic number. CoRR abs/1904.05269 (2019) - 2018
- [i11]Louis Esperet, Ross J. Kang, Stéphan Thomassé:
Separation choosability and dense bipartite induced subgraphs. CoRR abs/1802.03727 (2018) - [i10]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed coloring in sparse graphs with fewer colors. CoRR abs/1802.05582 (2018) - [i9]Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki:
Least conflict choosability. CoRR abs/1803.10962 (2018) - [i8]Étienne Bamas, Louis Esperet:
Distributed coloring of graphs with an optimal number of colors. CoRR abs/1809.08140 (2018) - 2016
- [i7]Wouter Cames van Batenburg, Louis Esperet, Tobias Müller:
Coloring pseudo-disks and Jordan curves. CoRR abs/1608.08159 (2016) - 2015
- [i6]Louis Esperet, Daniel Gonçalves, Arnaud Labourel:
Coloring non-crossing strings. CoRR abs/1511.03827 (2015) - [i5]Louis Esperet:
Box representations of embedded graphs. CoRR abs/1512.02381 (2015) - 2014
- [i4]Maria Chudnovsky, Louis Esperet, Laetitia Lemoine, Peter Maceli, Frédéric Maffray, Irena Penev:
Graphs with no induced five-vertex path or antipath. CoRR abs/1410.0871 (2014) - 2013
- [i3]Louis Esperet, Gwenaël Joret:
Coloring planar graphs with three colors and no large monochromatic components. CoRR abs/1303.2487 (2013) - 2010
- [i2]Louis Esperet, Sylvain Gravier, Mickaël Montassier, Pascal Ochem, Aline Parreau:
Locally identifying coloring of graphs. CoRR abs/1010.5624 (2010) - 2007
- [i1]Omid Amini, Louis Esperet, Jan van den Heuvel:
Frugal Colouring of Graphs. CoRR abs/0705.0422 (2007)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-02 02:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
