Irène Charon

1.6k total citations
47 papers, 879 citations indexed

About

Irène Charon is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, Irène Charon has authored 47 papers receiving a total of 879 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 21 papers in Artificial Intelligence and 18 papers in Electrical and Electronic Engineering. Recurrent topics in Irène Charon's work include Advanced Graph Theory Research (19 papers), graph theory and CDMA systems (17 papers) and Coding theory and cryptography (13 papers). Irène Charon is often cited by papers focused on Advanced Graph Theory Research (19 papers), graph theory and CDMA systems (17 papers) and Coding theory and cryptography (13 papers). Irène Charon collaborates with scholars based in France and Finland. Irène Charon's co-authors include Olivier Hudry, Antoine Lobstein, Iiro Honkala, Nathalie Bertrand, Alain Guénoche, Gérard Cohen, Graeme L. Cohen, Julien Moncel, Sylvain Gravier and Michel Mollard 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

Irène Charon

46 papers receiving 819 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Irène Charon France 17 415 393 326 252 124 47 879
Olivier Hudry France 19 496 1.2× 450 1.1× 386 1.2× 286 1.1× 134 1.1× 81 1.1k
Kazuhisa Makino Japan 18 587 1.4× 329 0.8× 362 1.1× 88 0.3× 109 0.9× 146 1.1k
Fabrizio Grandoni Switzerland 19 870 2.1× 674 1.7× 222 0.7× 209 0.8× 119 1.0× 84 1.4k
Marco Protasi Italy 8 500 1.2× 373 0.9× 300 0.9× 74 0.3× 175 1.4× 29 979
Giorgio Gambosi Italy 13 322 0.8× 362 0.9× 226 0.7× 71 0.3× 144 1.2× 58 878
Mohammad R. Salavatipour Canada 18 597 1.4× 458 1.2× 86 0.3× 238 0.9× 123 1.0× 60 1.0k
Hadas Shachnai Israel 20 323 0.8× 827 2.1× 138 0.4× 120 0.5× 279 2.3× 85 1.2k
Yoshiko Wakabayashi Brazil 14 352 0.8× 161 0.4× 126 0.4× 149 0.6× 412 3.3× 71 931
Jiřı́ Sgall Czechia 23 450 1.1× 863 2.2× 268 0.8× 133 0.5× 605 4.9× 86 1.6k
Friedhelm Meyer auf der Heide Germany 20 406 1.0× 725 1.8× 377 1.2× 98 0.4× 83 0.7× 116 1.3k

Countries citing papers authored by Irène Charon

Since Specialization
Citations

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

Fields of papers citing papers by Irène Charon

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Irène Charon

This figure shows the co-authorship network connecting the top 25 collaborators of Irène Charon. A scholar is included among the top collaborators of Irène Charon 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 Irène Charon. Irène Charon 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.
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
2.
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
3.
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
4.
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
5.
Charon, Irène, Sylvain Gravier, Olivier Hudry, et al.. (2006). A linear algorithm for minimum 1-identifying codes in oriented trees. Discrete Applied Mathematics. 154(8). 1246–1253. 12 indexed citations
6.
Charon, Irène, Olivier Hudry, & Antoine Lobstein. (2006). Extremal cardinalities for identifying and locating-dominating codes in graphs. Discrete Mathematics. 307(3-5). 356–366. 42 indexed citations
7.
Charon, Irène & Olivier Hudry. (2006). A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments. Discrete Applied Mathematics. 154(15). 2097–2116. 20 indexed citations
8.
Bertrand, Nathalie, Irène Charon, Olivier Hudry, & Antoine Lobstein. (2005). 1-identifying codes on trees.. Australas. J Comb.. 31. 21–36. 20 indexed citations
9.
Charon, Irène & Olivier Hudry. (2005). Noising methods for a clique partitioning problem. Discrete Applied Mathematics. 154(5). 754–769. 23 indexed citations
10.
Charon, Irène, Olivier Hudry, & Antoine Lobstein. (2005). Possible cardinalities for identifying codes in graphs.. Australas. J Comb.. 32. 177–196. 3 indexed citations
11.
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
12.
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
13.
Charon, Irène, Iiro Honkala, Olivier Hudry, & Antoine Lobstein. (2003). The minimum density of an identifying code in the king lattice. Discrete Mathematics. 276(1-3). 95–109. 36 indexed citations
14.
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
15.
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
16.
Charon, Irène & Olivier Hudry. (2000). Application of the noising method to the travelling salesman problem. European Journal of Operational Research. 125(2). 266–277. 15 indexed citations
17.
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
18.
Charon, Irène, et al.. (1997). Note. Discrete Applied Mathematics. 80(2-3). 211–215. 6 indexed citations
19.
Charon, Irène, et al.. (1997). New results on the computation of median orders. Discrete Mathematics. 165-166. 139–153. 18 indexed citations
20.
Charon, Irène, et al.. (1996). Random generation of tournaments and asymmetric graphs with given out-degrees. European Journal of Operational Research. 95(2). 411–419. 3 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