Olivier Hudry

2.1k total citations
81 papers, 1.1k citations indexed

About

Olivier Hudry is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Olivier Hudry has authored 81 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 32 papers in Artificial Intelligence and 27 papers in Computer Networks and Communications. Recurrent topics in Olivier Hudry's work include Advanced Graph Theory Research (32 papers), graph theory and CDMA systems (23 papers) and Coding theory and cryptography (18 papers). Olivier Hudry is often cited by papers focused on Advanced Graph Theory Research (32 papers), graph theory and CDMA systems (23 papers) and Coding theory and cryptography (18 papers). Olivier Hudry collaborates with scholars based in France, Finland and Kenya. Olivier Hudry's co-authors include Irène Charon, Antoine Lobstein, Iiro Honkala, Nathalie Bertrand, Alain Guénoche, Gérard Cohen, Sourour Elloumi, Graeme L. Cohen, Julien Moncel and Fred S. Roberts and has published in prestigious journals such as IEEE Transactions on Information Theory, European Journal of Operational Research and Annals of Operations Research.

In The Last Decade

Olivier Hudry

76 papers receiving 1.0k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Olivier Hudry France 19 496 450 386 286 173 81 1.1k
Irène Charon France 17 415 0.8× 393 0.9× 326 0.8× 252 0.9× 99 0.6× 47 879
Burkhard Monien Germany 25 723 1.5× 926 2.1× 365 0.9× 287 1.0× 276 1.6× 118 1.9k
Artur Czumaj Germany 20 511 1.0× 595 1.3× 415 1.1× 105 0.4× 308 1.8× 121 1.4k
Kazuo Iwama Japan 22 748 1.5× 452 1.0× 600 1.6× 155 0.5× 317 1.8× 120 1.5k
Kazuhisa Makino Japan 18 587 1.2× 329 0.7× 362 0.9× 88 0.3× 116 0.7× 146 1.1k
Magnús M. Halldórsson Iceland 25 1.0k 2.1× 1.3k 2.8× 327 0.8× 521 1.8× 235 1.4× 138 2.3k
Jiong Guo Germany 21 826 1.7× 345 0.8× 268 0.7× 101 0.4× 117 0.7× 83 1.3k
Adrian Vetta Canada 14 504 1.0× 392 0.9× 279 0.7× 100 0.3× 339 2.0× 48 1.4k
Claire Kenyon France 21 364 0.7× 571 1.3× 280 0.7× 111 0.4× 174 1.0× 55 1.4k
Fabrizio Grandoni Switzerland 19 870 1.8× 674 1.5× 222 0.6× 209 0.7× 74 0.4× 84 1.4k

Countries citing papers authored by Olivier Hudry

Since Specialization
Citations

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

Fields of papers citing papers by Olivier Hudry

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Olivier Hudry

This figure shows the co-authorship network connecting the top 25 collaborators of Olivier Hudry. A scholar is included among the top collaborators of Olivier Hudry 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 Olivier Hudry. Olivier Hudry 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.
Hudry, Olivier & Antoine Lobstein. (2023). Some Complexity Considerations on the Uniqueness of Graph Colouring. WSEAS TRANSACTIONS ON MATHEMATICS. 22. 483–493.
2.
Elloumi, Sourour, et al.. (2018). Optimization of wireless sensor networks deployment with coverage and connectivity constraints. Annals of Operations Research. 298(1-2). 183–206. 13 indexed citations
3.
Hudry, Olivier & Antoine Lobstein. (2016). More results on the complexity of identifying problems in graphs. Theoretical Computer Science. 626. 1–12. 5 indexed citations
4.
Honkala, Iiro, Olivier Hudry, & Antoine Lobstein. (2014). On the number of optimal identifying codes in a twin-free graph. Discrete Applied Mathematics. 180. 111–119. 3 indexed citations
5.
Charon, Irène, et al.. (2012). Maximum size of a minimum watching system and the graphs achieving the bound. Discrete Applied Mathematics. 164. 20–33. 2 indexed citations
6.
Charon, Irène, et al.. (2011). Watching systems in graphs: An extension of identifying codes. Discrete Applied Mathematics. 161(12). 1674–1685. 10 indexed citations
7.
Charon, Irène, et al.. (2010). On the sizes of the graphs G, G r , G r \ G: the directed case.. Australas. J Comb.. 48. 87–110. 1 indexed citations
8.
Hudry, Olivier. (2009). On the complexity of Slater’s problems. European Journal of Operational Research. 203(1). 216–221. 13 indexed citations
9.
Charon, Irène, Iiro Honkala, Olivier Hudry, & Antoine Lobstein. (2007). Structural Properties of Twin-Free Graphs. The Electronic Journal of Combinatorics. 14(1). 19 indexed citations
10.
Charon, Irène, Olivier Hudry, & Antoine Lobstein. (2006). Possible cardinalities for locating-dominating codes in graphs.. Australas. J Comb.. 34. 23–32. 4 indexed citations
11.
Charon, Irène, Olivier Hudry, & Antoine Lobstein. (2005). Possible cardinalities for identifying codes in graphs.. Australas. J Comb.. 32. 177–196. 3 indexed citations
12.
Bertrand, Nathalie, Irène Charon, Olivier Hudry, & Antoine Lobstein. (2005). 1-identifying codes on trees.. Australas. J Comb.. 31. 21–36. 20 indexed citations
13.
Bertrand, Nathalie, Irène Charon, Olivier Hudry, & Antoine Lobstein. (2004). Identifying and locating-dominating codes on chains and cycles. European Journal of Combinatorics. 25(7). 969–987. 70 indexed citations
14.
Charon, Irène, Olivier Hudry, & Antoine Lobstein. (2003). Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theoretical Computer Science. 290(3). 2109–2120. 94 indexed citations
15.
Charon, Irène, Olivier Hudry, & Antoine Lobstein. (2002). Identifying Codes with Small Radius in Some Infinite Regular Graphs. The Electronic Journal of Combinatorics. 9(1). 57 indexed citations
16.
Charon, Irène, Iiro Honkala, Olivier Hudry, & Antoine Lobstein. (2001). General Bounds for Identifying Codes in Some Infinite Regular Graphs. The Electronic Journal of Combinatorics. 8(1). 37 indexed citations
17.
Hudry, Olivier. (1999). A smallest tournament for which the Banks set and the Copeland set are disjoint. Social Choice and Welfare. 16(1). 137–143. 3 indexed citations
18.
Charon, Irène, et al.. (1997). Note: A 16-vertex Tournament for Which Banks Set and Slater Set Are Disjoint.. Discrete Applied Mathematics. 80. 211–215. 5 indexed citations
19.
Hudry, Olivier. (1996). Tournois et analyse des préférences ordinales. Avant-propos. French digital mathematics library (Numdam). 133. 5–6. 1 indexed citations
20.
Barthélemy, Jean‐Pierre, et al.. (1995). The reversing number of a diagraph. Discrete Applied Mathematics. 60(1-3). 39–76. 10 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