Antoine Lobstein
Impact in
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
-
- Interconnection Networks and Systems
- Cooperative Communication and Network Coding
- Optimization and Search Problems
Papers in
-
- Coding theory and cryptography 35
-
- Advanced Graph Theory Research 22
- Graph Labeling and Dimension Problems 17
- semigroups and automata theory 5
- Co-authors
- Olivier Hudry (36 shared papers)Irène Charon (25 shared papers)Gérard Cohen (13 shared papers)Iiro Honkala (16 shared papers)N. J. A. Sloane (2 shared papers)Nathalie Bertrand (2 shared papers)Gilles Zémor (4 shared papers)H. F. Mattson (2 shared papers)
In The Last Decade
Antoine Lobstein
53 papers receiving 870 citations
Peers
Comparison fields: 5 of 56
- Computational Theory and Mathematics 454
- Computer Networks and Communications 538
- Discrete Mathematics and Combinatorics 74
- Artificial Intelligence 466
- Electrical and Electronic Engineering 457
Countries citing papers authored by Antoine Lobstein
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
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-authors
The 20 scholars most cited alongside Antoine Lobstein, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 62 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1986 | 111 | |
| 2 | 2003 | 94 | |
| 3 | 2004 | 70 | |
| 4 | 2002 | 57 | |
| 5 | 2006 | 42 | |
| 6 | 2001 | 37 | |
| 7 | 2000 | 37 | |
| 8 | 2002 | 37 | |
| 9 | 2003 | 36 | |
| 10 | 1999 | 34 | |
| 11 | 2001 | 33 | |
| 12 | 2002 | 32 | |
| 13 | 1997 | 27 | |
| 14 | 1990 | 26 | |
| 15 | 1989 | 26 | |
| 16 | 2002 | 23 | |
| 17 | 1-identifying codes on trees. | 2005 | 20 |
| 18 | 2007 | 19 | |
| 19 | 2005 | 16 | |
| 20 | 2006 | 12 |
About Antoine Lobstein
Antoine Lobstein is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Electrical and Electronic Engineering, Computer Networks and Communications and Discrete Mathematics and Combinatorics, having authored 62 papers that have together received 940 indexed citations. Recurring topics across this work include Coding theory and cryptography (35 papers), graph theory and CDMA systems (33 papers), Advanced Graph Theory Research (22 papers), Graph Labeling and Dimension Problems (17 papers), Cooperative Communication and Network Coding (13 papers), Interconnection Networks and Systems (12 papers), semigroups and automata theory (5 papers) and Graph theory and applications (4 papers). The work is most often cited by research in Computational Theory and Mathematics (454 citations), Computer Networks and Communications (538 citations), Discrete Mathematics and Combinatorics (74 citations), Artificial Intelligence (466 citations) and Electrical and Electronic Engineering (457 citations). Antoine Lobstein has collaborated with scholars based in France, Finland and Israel. Frequent 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 Sylvain Gravier. Their work appears in journals such as IEEE Transactions on Information Theory, Discrete Applied Mathematics, The Electronic Journal of Combinatorics, Theoretical Computer Science and European Journal of Combinatorics.
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.