Antoine Lobstein

1.6k total citations
62 papers, 938 citations indexed

About

Antoine Lobstein is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Antoine Lobstein has authored 62 papers receiving a total of 938 indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Artificial Intelligence, 33 papers in Computational Theory and Mathematics and 33 papers in Electrical and Electronic Engineering. Recurrent topics in Antoine Lobstein's work include Coding theory and cryptography (35 papers), graph theory and CDMA systems (33 papers) and Advanced Graph Theory Research (22 papers). Antoine Lobstein is often cited by papers focused on Coding theory and cryptography (35 papers), graph theory and CDMA systems (33 papers) and Advanced Graph Theory Research (22 papers). Antoine Lobstein collaborates with scholars based in France, Finland and United States. Antoine Lobstein's co-authors include Olivier Hudry, Irène Charon, Gérard Cohen, Iiro Honkala, N. J. A. Sloane, Nathalie Bertrand, Gilles Zémor, H. F. Mattson, Simon Litsyn and Julien Moncel and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Computers and Theoretical Computer Science.

In The Last Decade

Antoine Lobstein

52 papers receiving 867 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Antoine Lobstein France 18 538 466 457 453 142 62 938
Iiro Honkala Finland 20 542 1.0× 519 1.1× 522 1.1× 341 0.8× 171 1.2× 78 922
Swastik Kopparty United States 13 316 0.6× 387 0.8× 194 0.4× 226 0.5× 34 0.2× 50 652
Parikshit Gopalan United States 19 1.3k 2.4× 714 1.5× 145 0.3× 694 1.5× 77 0.5× 68 1.8k
H. van Tilborg Netherlands 11 427 0.8× 814 1.7× 522 1.1× 220 0.5× 116 0.8× 26 1.0k
Philippe Gaborit France 20 229 0.4× 1.1k 2.3× 628 1.4× 257 0.6× 160 1.1× 77 1.2k
Stephen Suen United States 12 495 0.9× 89 0.2× 300 0.7× 209 0.5× 39 0.3× 23 752
Nicolas Sendrier France 13 224 0.4× 618 1.3× 300 0.7× 152 0.3× 23 0.2× 29 659
Shachar Lovett United States 15 119 0.2× 402 0.9× 125 0.3× 353 0.8× 31 0.2× 103 680
Ivan M. Havel Czechia 13 184 0.3× 246 0.5× 125 0.3× 381 0.8× 66 0.5× 46 576
Martin Fürer United States 13 201 0.4× 294 0.6× 108 0.2× 473 1.0× 19 0.1× 38 744

Countries citing papers authored by Antoine Lobstein

Since Specialization
Citations

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

Fields of papers citing papers by Antoine Lobstein

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Antoine Lobstein

This figure shows the co-authorship network connecting the top 25 collaborators of Antoine Lobstein. A scholar is included among the top collaborators of Antoine Lobstein 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 Antoine Lobstein. Antoine Lobstein 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.
Hudry, Olivier & Antoine Lobstein. (2016). More results on the complexity of identifying problems in graphs. Theoretical Computer Science. 626. 1–12. 5 indexed citations
3.
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
4.
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
5.
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
6.
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
7.
Ben‐Haim, Yael, Sylvain Gravier, Antoine Lobstein, & Julien Moncel. (2008). Adaptive identification in graphs. Journal of Combinatorial Theory Series A. 115(7). 1114–1126. 7 indexed citations
8.
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
9.
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
10.
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
11.
Bertrand, Nathalie, Irène Charon, Olivier Hudry, & Antoine Lobstein. (2005). 1-identifying codes on trees.. Australas. J Comb.. 31. 21–36. 20 indexed citations
12.
Charon, Irène, Olivier Hudry, & Antoine Lobstein. (2005). Possible cardinalities for identifying codes in graphs.. Australas. J Comb.. 32. 177–196. 3 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.
Honkala, Iiro & Antoine Lobstein. (2003). On Identification in ZZ 2 Using Translates of Given Patterns. JUCS - Journal of Universal Computer Science. 9. 1204–1219. 5 indexed citations
15.
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
16.
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
17.
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
18.
Honkala, Iiro & Antoine Lobstein. (2002). On the Density of Identifying Codes in the Square Lattice. Journal of Combinatorial Theory Series B. 85(2). 297–306. 23 indexed citations
19.
Honkala, Iiro & Antoine Lobstein. (2002). On Identifying Codes in Binary Hamming Spaces. Journal of Combinatorial Theory Series A. 99(2). 232–243. 32 indexed citations
20.
Lobstein, Antoine, et al.. (1990). Correction to "On normal and subnormal q-ary codes". IEEE Transactions on Information Theory. 36(6). 1498–1498. 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

Breakdown of academic impact, for papers by Iiro Honkala Breakdown of academic impact, for papers by Swastik Kopparty Breakdown of academic impact, for papers by Parikshit Gopalan Breakdown of academic impact, for papers by H. van Tilborg Breakdown of academic impact, for papers by Philippe Gaborit Breakdown of academic impact, for papers by Stephen Suen Breakdown of academic impact, for papers by Nicolas Sendrier Breakdown of academic impact, for papers by Shachar Lovett Breakdown of academic impact, for papers by Ivan M. Havel Breakdown of academic impact, for papers by Martin Fürer
Rankless by CCL
2026