Pascal Ochem
Impact in
-
- Advanced Graph Theory Research
- semigroups and automata theory
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
-
- Analytic Number Theory Research
Papers in
-
- Advanced Graph Theory Research 45
- semigroups and automata theory 37
- Graph Labeling and Dimension Problems 4
-
- Analytic Number Theory Research 4
- Co-authors
- Mickaël Montassier (8 shared papers)Alexandre Pinlou (15 shared papers)Louis Esperet (6 shared papers)André Raspaud B (5 shared papers)Michaël Rao (5 shared papers)Daniel Gonçalves (5 shared papers)Jeffrey O. Shallit (8 shared papers)Oleg Veniaminovich Borodin (1 shared paper)
In The Last Decade
Pascal Ochem
79 papers receiving 560 citations
Peers
Comparison fields: 5 of 13
- Computational Theory and Mathematics 537
- Algebra and Number Theory 31
- Discrete Mathematics and Combinatorics 28
- Theoretical Computer Science 3
- Artificial Intelligence 23
Countries citing papers authored by Pascal Ochem
This map shows the geographic impact of Pascal Ochem'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 Pascal Ochem with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pascal Ochem more than expected).
Fields of papers citing papers by Pascal Ochem
This network shows the impact of papers produced by Pascal Ochem. 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 Pascal Ochem. The network helps show where Pascal Ochem may publish in the future.
Co-authors
The 25 scholars most cited alongside Pascal Ochem, 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 88 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2006 | 41 | |
| 2 | 2009 | 33 | |
| 3 | 2005 | 28 | |
| 4 | 2015 | 27 | |
| 5 | 2012 | 24 | |
| 6 | 2016 | 20 | |
| 7 | 2009 | 19 | |
| 8 | 2011 | 19 | |
| 9 | 2004 | 18 | |
| 10 | 2012 | 18 | |
| 11 | 2005 | 17 | |
| 12 | 2005 | 15 | |
| 13 | 2008 | 14 | |
| 14 | 2014 | 14 | |
| 15 | 2013 | 12 | |
| 16 | 2003 | 11 | |
| 17 | 2008 | 11 | |
| 18 | 2008 | 11 | |
| 19 | 2013 | 11 | |
| 20 | 2006 | 10 |
About Pascal Ochem
Pascal Ochem is a scholar working on Computational Theory and Mathematics, Algebra and Number Theory, Discrete Mathematics and Combinatorics, Artificial Intelligence and Nuclear Energy and Engineering, having authored 88 papers that have together received 590 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (45 papers), semigroups and automata theory (37 papers), Graph Labeling and Dimension Problems (4 papers), Analytic Number Theory Research (4 papers), Algorithms and Data Compression (1 paper) and Limits and Structures in Graph Theory (1 paper). The work is most often cited by research in Computational Theory and Mathematics (537 citations), Algebra and Number Theory (31 citations), Discrete Mathematics and Combinatorics (28 citations), Theoretical Computer Science (3 citations) and Artificial Intelligence (23 citations). Pascal Ochem has collaborated with scholars based in France, Canada and Germany. Frequent co-authors include Mickaël Montassier, Alexandre Pinlou, Louis Esperet, André Raspaud B, Michaël Rao, Daniel Gonçalves, Jeffrey O. Shallit, Oleg Veniaminovich Borodin, Anna O. Ivanova and Jérémie Chalopin. Their work appears in journals such as The Electronic Journal of Combinatorics, Theoretical Computer Science, Journal of Graph Theory, Discrete Mathematics and Discrete Applied Mathematics.
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.