Florent Foucaud

616 total citations
38 papers, 215 citations indexed

About

Florent Foucaud is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Florent Foucaud has authored 38 papers receiving a total of 215 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Computational Theory and Mathematics, 11 papers in Discrete Mathematics and Combinatorics and 10 papers in Electrical and Electronic Engineering. Recurrent topics in Florent Foucaud's work include Advanced Graph Theory Research (30 papers), Graph Labeling and Dimension Problems (21 papers) and graph theory and CDMA systems (10 papers). Florent Foucaud is often cited by papers focused on Advanced Graph Theory Research (30 papers), Graph Labeling and Dimension Problems (21 papers) and graph theory and CDMA systems (10 papers). Florent Foucaud collaborates with scholars based in France, South Africa and India. Florent Foucaud's co-authors include Michael A. Henning, Reza Naserasr, Aline Parreau, Guillem Perarnau, Christian Löwenstein, Pavol Hell, Ralf Klasing, George B. Mertzios, Michael Krivelevich and C. Balbuena and has published in prestigious journals such as Theoretical Computer Science, Networks and Discrete Applied Mathematics.

In The Last Decade

Florent Foucaud

29 papers receiving 206 citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author Last Decade Papers Cites
Florent Foucaud 181 51 51 48 31 38 215
Luérbio Faria 175 1.0× 61 1.2× 37 0.7× 49 1.0× 12 0.4× 56 212
Yota Otachi 196 1.1× 104 2.0× 26 0.5× 21 0.4× 27 0.9× 66 244
R. Sritharan 287 1.6× 123 2.4× 51 1.0× 67 1.4× 15 0.5× 33 307
Somnath Sikdar 238 1.3× 77 1.5× 31 0.6× 42 0.9× 36 1.2× 23 264
Reza Naserasr 224 1.2× 29 0.6× 57 1.1× 98 2.0× 11 0.4× 45 260
Bert Gerards 229 1.3× 60 1.2× 65 1.3× 80 1.7× 12 0.4× 19 248
Dalibor Fronček 316 1.7× 25 0.5× 156 3.1× 56 1.2× 39 1.3× 69 360
Erik Jan van Leeuwen 170 0.9× 67 1.3× 19 0.4× 26 0.5× 15 0.5× 44 194
Rudini Sampaio 155 0.9× 27 0.5× 16 0.3× 84 1.8× 31 1.0× 49 198
Charis Papadopoulos 145 0.8× 52 1.0× 17 0.3× 39 0.8× 9 0.3× 31 167

Countries citing papers authored by Florent Foucaud

Since Specialization
Citations

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

Fields of papers citing papers by Florent Foucaud

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Florent Foucaud

This figure shows the co-authorship network connecting the top 25 collaborators of Florent Foucaud. A scholar is included among the top collaborators of Florent Foucaud 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 Florent Foucaud. Florent Foucaud 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.
Foucaud, Florent, et al.. (2025). Bounds and extremal graphs for monitoring edge-geodetic sets in graphs. Discrete Applied Mathematics. 366. 106–119.
2.
Fernau, Henning, et al.. (2024). Parameterizing path partitions. Theoretical Computer Science. 1028. 115029–115029.
3.
Foucaud, Florent, et al.. (2024). On Graphs Coverable by \({k}\) Shortest Paths. SIAM Journal on Discrete Mathematics. 38(2). 1840–1862. 1 indexed citations
4.
Foucaud, Florent, et al.. (2024). Extremal digraphs for open neighbourhood location-domination and identifying codes. Discrete Applied Mathematics. 347. 62–74.
5.
Foucaud, Florent, et al.. (2023). Identifying codes in bipartite graphs of given maximum degree. Procedia Computer Science. 223. 157–165.
6.
Bonnet, Édouard, et al.. (2023). Neighbourhood complexity of graphs of bounded twin-width. European Journal of Combinatorics. 115. 103772–103772. 3 indexed citations
7.
Foucaud, Florent, et al.. (2019). Broadcast domination and multipacking: bounds and the integrality gap. HAL (Le Centre pour la Communication Scientifique Directe).
8.
Foucaud, Florent, et al.. (2019). Strengthening the Murty–Simon conjecture on diameter 2 critical graphs. Discrete Mathematics. 342(11). 3142–3159.
9.
Foucaud, Florent, et al.. (2017). Identification, location–domination and metric dimension on interval and permutation graphs. I. Bounds. Theoretical Computer Science. 668. 43–58. 16 indexed citations
10.
Foucaud, Florent, et al.. (2017). The complexity of tropical graph homomorphisms. Discrete Applied Mathematics. 229. 64–81. 4 indexed citations
11.
Foucaud, Florent, et al.. (2016). The complexity of signed graph and edge-coloured graph homomorphisms. Discrete Mathematics. 340(2). 223–235. 17 indexed citations
12.
Foucaud, Florent & Michael A. Henning. (2016). Location-domination in line graphs. Discrete Mathematics. 340(1). 3140–3153. 5 indexed citations
13.
Foucaud, Florent, et al.. (2015). Locating–dominating sets in twin-free graphs. Discrete Applied Mathematics. 200. 52–58. 27 indexed citations
14.
Foucaud, Florent & Michael A. Henning. (2015). Location-domination and matching in cubic graphs. Discrete Mathematics. 339(4). 1221–1231. 7 indexed citations
15.
Foucaud, Florent. (2014). Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes. Journal of Discrete Algorithms. 31. 48–68. 12 indexed citations
16.
Foucaud, Florent, et al.. (2013). On the structure of arbitrarily partitionable graphs with given connectivity. Discrete Applied Mathematics. 162. 381–385. 7 indexed citations
17.
Foucaud, Florent, et al.. (2013). Identifying path covers in graphs. Journal of Discrete Algorithms. 23. 21–34. 5 indexed citations
18.
Foucaud, Florent, Iiro Honkala, Tero Laihonen, Aline Parreau, & Guillem Perarnau. (2012). Locally identifying colourings for graphs with given maximum degree. Discrete Mathematics. 312(10). 1832–1837. 6 indexed citations
19.
Foucaud, Florent, Ralf Klasing, Adrian Kosowski, & André Raspaud. (2012). On the size of identifying codes in triangle-free graphs. Discrete Applied Mathematics. 160(10-11). 1532–1546. 10 indexed citations
20.
Foucaud, Florent, et al.. (2011). Extremal graphs for the identifying code problem. European Journal of Combinatorics. 32(4). 628–638. 17 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