Alexandre Pinlou

591 total citations
38 papers, 245 citations indexed

About

Alexandre Pinlou is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, Alexandre Pinlou has authored 38 papers receiving a total of 245 indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Computational Theory and Mathematics, 18 papers in Discrete Mathematics and Combinatorics and 6 papers in Computer Networks and Communications. Recurrent topics in Alexandre Pinlou's work include Advanced Graph Theory Research (36 papers), Graph Labeling and Dimension Problems (20 papers) and Limits and Structures in Graph Theory (18 papers). Alexandre Pinlou is often cited by papers focused on Advanced Graph Theory Research (36 papers), Graph Labeling and Dimension Problems (20 papers) and Limits and Structures in Graph Theory (18 papers). Alexandre Pinlou collaborates with scholars based in France, Spain and Australia. Alexandre Pinlou's co-authors include Pascal Ochem, Daniel Gonçalves, Marthe Bonamy, Benjamin Lévêque, Stéphan Thomassé, Michaël Rao, Éric Sopena, Mickaël Montassier, Louis Esperet and André Raspaud and has published in prestigious journals such as Applied Mathematics and Computation, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Alexandre Pinlou

33 papers receiving 234 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Alexandre Pinlou France 10 229 108 40 36 32 38 245
Marthe Bonamy France 9 175 0.8× 86 0.8× 33 0.8× 28 0.8× 29 0.9× 34 188
Robert Šámal Czechia 7 133 0.6× 98 0.9× 66 1.6× 26 0.7× 14 0.4× 34 165
Louis Esperet France 11 315 1.4× 183 1.7× 64 1.6× 41 1.1× 30 0.9× 51 344
Reza Naserasr France 10 224 1.0× 98 0.9× 59 1.5× 57 1.6× 29 0.9× 45 260
Vassilis Giakoumakis France 11 284 1.2× 119 1.1× 55 1.4× 42 1.2× 58 1.8× 21 294
Célia Picinin de Mello Brazil 10 231 1.0× 86 0.8× 51 1.3× 49 1.4× 35 1.1× 30 248
André Kündgen United States 10 292 1.3× 199 1.8× 80 2.0× 77 2.1× 16 0.5× 30 329
Gábor Bacsó Hungary 9 263 1.1× 142 1.3× 31 0.8× 68 1.9× 41 1.3× 33 284
Keith Edwards United Kingdom 10 295 1.3× 103 1.0× 38 0.9× 86 2.4× 32 1.0× 29 307
John Gimbel United States 9 242 1.1× 86 0.8× 46 1.1× 34 0.9× 18 0.6× 30 266

Countries citing papers authored by Alexandre Pinlou

Since Specialization
Citations

This map shows the geographic impact of Alexandre Pinlou'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 Alexandre Pinlou with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexandre Pinlou more than expected).

Fields of papers citing papers by Alexandre Pinlou

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Alexandre Pinlou. 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 Alexandre Pinlou. The network helps show where Alexandre Pinlou may publish in the future.

Co-authorship network of co-authors of Alexandre Pinlou

This figure shows the co-authorship network connecting the top 25 collaborators of Alexandre Pinlou. A scholar is included among the top collaborators of Alexandre Pinlou 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 Alexandre Pinlou. Alexandre Pinlou is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Gonçalves, Daniel, Mickaël Montassier, & Alexandre Pinlou. (2019). Acyclic coloring of graphs and entropy compression method. Discrete Mathematics. 343(4). 111772–111772. 5 indexed citations
2.
Montassier, Mickaël, et al.. (2019). r-hued coloring of planar graphs with girth at least 8.
3.
Montassier, Mickaël, et al.. (2018). A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. Discrete Mathematics. 342(4). 943–950. 2 indexed citations
4.
Montassier, Mickaël, et al.. (2018). Large induced forests in planar graphs with girth 4. Discrete Applied Mathematics. 254. 96–106. 5 indexed citations
5.
Bonamy, Marthe, Benjamin Lévêque, & Alexandre Pinlou. (2014). 2‐Distance Coloring of Sparse Graphs. Journal of Graph Theory. 77(3). 190–218. 17 indexed citations
6.
Bonamy, Marthe, Benjamin Lévêque, & Alexandre Pinlou. (2013). Graphs with maximum degreeΔ17and maximum average degree less than3are list2-distance(Δ+2)-colorable. Discrete Mathematics. 317. 19–32. 18 indexed citations
7.
Gonçalves, Daniel, Aline Parreau, & Alexandre Pinlou. (2013). Locally identifying coloring in bounded expansion classes of graphs. Discrete Applied Mathematics. 161(18). 2946–2951. 6 indexed citations
8.
Gonçalves, Daniel, Frédéric Havet, Alexandre Pinlou, & Stéphan Thomassé. (2011). On spanning galaxies in digraphs. Discrete Applied Mathematics. 160(6). 744–754. 2 indexed citations
9.
Ochem, Pascal & Alexandre Pinlou. (2011). Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs. Electronic Notes in Discrete Mathematics. 37. 123–128. 2 indexed citations
10.
Ochem, Pascal, et al.. (2009). Homomorphisms of 2-edge-colored graphs. Discrete Applied Mathematics. 158(12). 1365–1379. 13 indexed citations
11.
Pinlou, Alexandre, et al.. (2009). Chromatic number of sparse colored mixed planar graphs. Electronic Notes in Discrete Mathematics. 34. 363–367. 1 indexed citations
12.
Pinlou, Alexandre. (2008). An oriented coloring of planar graphs with girth at least five. Discrete Mathematics. 309(8). 2108–2118. 9 indexed citations
13.
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
14.
Montassier, Mickaël, Pascal Ochem, & Alexandre Pinlou. (2008). Strong Oriented Chromatic Number of Planar Graphs without Short Cycles. Discrete Mathematics & Theoretical Computer Science. Vol. 10 no. 1. 3 indexed citations
15.
Ochem, Pascal & Alexandre Pinlou. (2008). Oriented colorings of partial 2-trees. Information Processing Letters. 108(2). 82–86. 11 indexed citations
16.
Ochem, Pascal, Alexandre Pinlou, & Éric Sopena. (2007). On the oriented chromatic index of oriented graphs. Journal of Graph Theory. 57(4). 313–332. 4 indexed citations
17.
Esperet, Louis & Alexandre Pinlou. (2007). Acyclic improper choosability of graphs. Electronic Notes in Discrete Mathematics. 28. 251–258. 2 indexed citations
18.
Ochem, Pascal & Alexandre Pinlou. (2007). Oriented vertex and arc colorings of partial 2-trees. Electronic Notes in Discrete Mathematics. 29. 195–199. 2 indexed citations
19.
Pinlou, Alexandre, et al.. (2006). The acircuitic directed star arboricity of subcubic graphs is at most four. Discrete Mathematics. 306(24). 3281–3289. 1 indexed citations
20.
Pinlou, Alexandre. (2006). On Oriented Arc-Coloring of Subcubic Graphs. The Electronic Journal of Combinatorics. 13(1). 5 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

Rankless by CCL
2026