Louis Esperet

804 total citations
51 papers, 344 citations indexed

About

Louis Esperet is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Louis Esperet has authored 51 papers receiving a total of 344 indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 31 papers in Discrete Mathematics and Combinatorics and 12 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Louis Esperet's work include Advanced Graph Theory Research (49 papers), Limits and Structures in Graph Theory (30 papers) and Graph Labeling and Dimension Problems (22 papers). Louis Esperet is often cited by papers focused on Advanced Graph Theory Research (49 papers), Limits and Structures in Graph Theory (30 papers) and Graph Labeling and Dimension Problems (22 papers). Louis Esperet collaborates with scholars based in France, Czechia and Canada. Louis Esperet's co-authors include Aline Parreau, Pascal Ochem, Mickaël Montassier, Frédéric Maffray, Daniel Král͏̌, Jan van den Heuvel, Omid Amini, František Kardoš, Andrew D. King and Pat Morin and has published in prestigious journals such as Advances in Mathematics, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Louis Esperet

47 papers receiving 330 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Louis Esperet France	11	315	183	64	41	41	51	344
Ross J. Kang Netherlands	9	207 0.7×	137 0.7×	52 0.8×	32 0.8×	27 0.7×	56	252
Keith Edwards United Kingdom	10	295 0.9×	103 0.6×	38 0.6×	86 2.1×	11 0.3×	29	307
Daniel W. Cranston United States	12	413 1.3×	185 1.0×	69 1.1×	82 2.0×	27 0.7×	57	459
André Kündgen United States	10	292 0.9×	199 1.1×	80 1.3×	77 1.9×	23 0.6×	30	329
Bogdan Oporowski United States	9	300 1.0×	143 0.8×	76 1.2×	50 1.2×	55 1.3×	21	317
Robert Šámal Czechia	7	133 0.4×	98 0.5×	66 1.0×	26 0.6×	18 0.4×	34	165
Juan José Montellano‐Ballesteros Mexico	8	213 0.7×	185 1.0×	106 1.7×	47 1.1×	9 0.2×	42	250
Hongliang Lu China	10	266 0.8×	117 0.6×	213 3.3×	60 1.5×	7 0.2×	49	323
Célia Picinin de Mello Brazil	10	231 0.7×	86 0.5×	51 0.8×	49 1.2×	8 0.2×	30	248
Daniel Gonçalves France	7	231 0.7×	47 0.3×	32 0.5×	65 1.6×	46 1.1×	38	254

Countries citing papers authored by Louis Esperet

Since Specialization

Citations

This map shows the geographic impact of Louis Esperet's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Louis Esperet with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Louis Esperet more than expected).

Fields of papers citing papers by Louis Esperet

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Louis Esperet. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Louis Esperet. The network helps show where Louis Esperet may publish in the future.

Co-authorship network of co-authors of Louis Esperet

This figure shows the co-authorship network connecting the top 25 collaborators of Louis Esperet. A scholar is included among the top collaborators of Louis Esperet based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Louis Esperet. Louis Esperet is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Bonamy, Marthe, et al.. (2024). Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. Journal of Combinatorial Theory Series B. 167. 215–249. 1 indexed citations

Esperet, Louis, et al.. (2024). Optimal Adjacency Labels for Subgraphs of Cartesian Products. SIAM Journal on Discrete Mathematics. 38(3). 2181–2193.

Esperet, Louis, et al.. (2023). The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem. 425–432. 2 indexed citations

Esperet, Louis & David R. Wood. (2023). Colouring strong products. European Journal of Combinatorics. 121. 103847–103847. 1 indexed citations

Dujmović, Vida, Louis Esperet, Pat Morin, Bartosz Walczak, & David R. Wood. (2021). Clustered 3-colouring graphs of bounded degree. Combinatorics Probability Computing. 31(1). 123–135. 9 indexed citations

Dvořák, Zdenĕk, Louis Esperet, Ross J. Kang, & Kenta Ozeki. (2020). Single‐conflict colouring. Journal of Graph Theory. 97(1). 148–160. 8 indexed citations

Dujmović, Vida, Louis Esperet, Cyril Gavoille, et al.. (2020). Adjacency Labelling for Planar Graphs (and Beyond). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 577–588. 16 indexed citations

Esperet, Louis, et al.. (2018). Additive Bases and Flows in Graphs. SIAM Journal on Discrete Mathematics. 32(1). 534–542. 3 indexed citations

Esperet, Louis, et al.. (2017). Polynomial expansion and sublinear separators. European Journal of Combinatorics. 69. 49–53. 5 indexed citations

10.

Esperet, Louis, et al.. (2015). Equitable partition of graphs into induced forests. Discrete Mathematics. 338(8). 1481–1483. 11 indexed citations

11.

Esperet, Louis. (2015). Boxicity and topological invariants. European Journal of Combinatorics. 51. 495–499. 4 indexed citations

12.

Esperet, Louis & Aline Parreau. (2013). Acyclic edge-coloring using entropy compression. European Journal of Combinatorics. 34(6). 1019–1027. 39 indexed citations

13.

Esperet, Louis, et al.. (2013). The chromatic number of{P5,K4}-free graphs. Discrete Mathematics. 313(6). 743–754. 22 indexed citations

14.

Dvořák, Zdenĕk & Louis Esperet. (2013). Distance-two coloring of sparse graphs. European Journal of Combinatorics. 36. 406–415. 1 indexed citations

15.

Esperet, Louis, John Gimbel, & Andrew D. King. (2010). Covering line graphs with equivalence relations. Discrete Applied Mathematics. 158(17). 1902–1907. 1 indexed citations

16.

Esperet, Louis. (2010). Dynamic list coloring of bipartite graphs. Discrete Applied Mathematics. 158(17). 1963–1965. 17 indexed citations

17.

Esperet, Louis, Daniel Král͏̌, Petr Škoda, & Riste Škrekovski. (2009). An improved linear bound on the number of perfect matchings in cubic graphs. European Journal of Combinatorics. 31(5). 1316–1334. 7 indexed citations

18.

Addario‐Berry, Louigi, Louis Esperet, Ross J. Kang, Colin McDiarmid, & Alexandre Pinlou. (2008). Acyclic improper colourings of graphs with bounded maximum degree. Discrete Mathematics. 310(2). 223–229. 2 indexed citations

19.

Esperet, Louis, Mickaël Montassier, & André Raspaud. (2007). Linear choosability of graphs. Discrete Mathematics. 308(17). 3938–3950. 14 indexed citations

20.

Esperet, Louis & Alexandre Pinlou. (2007). Acyclic improper choosability of graphs. Electronic Notes in Discrete Mathematics. 28. 251–258. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact