Pascal Ochem

840 total citations
64 papers, 352 citations indexed

About

Pascal Ochem is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence. According to data from OpenAlex, Pascal Ochem has authored 64 papers receiving a total of 352 indexed citations (citations by other indexed papers that have themselves been cited), including 58 papers in Computational Theory and Mathematics, 22 papers in Discrete Mathematics and Combinatorics and 22 papers in Artificial Intelligence. Recurrent topics in Pascal Ochem's work include Advanced Graph Theory Research (35 papers), semigroups and automata theory (23 papers) and Graph Labeling and Dimension Problems (21 papers). Pascal Ochem is often cited by papers focused on Advanced Graph Theory Research (35 papers), semigroups and automata theory (23 papers) and Graph Labeling and Dimension Problems (21 papers). Pascal Ochem collaborates with scholars based in France, Canada and United Kingdom. Pascal Ochem's co-authors include Mickaël Montassier, Alexandre Pinlou, André Raspaud, Michaël Rao, Louis Esperet, Daniel Gonçalves, Jeffrey Shallit, A. O. Ivanova, O. V. Borodin and Xuding Zhu and has published in prestigious journals such as Mathematics of Computation, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Pascal Ochem

54 papers receiving 330 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Pascal Ochem France 12 317 126 68 43 41 64 352
Vít Jelínek Czechia 9 104 0.3× 120 1.0× 47 0.7× 36 0.8× 32 0.8× 30 187
Tomáš Kaiser Czechia 12 348 1.1× 194 1.5× 19 0.3× 73 1.7× 41 1.0× 60 404
Jarosław Grytczuk Poland 13 515 1.6× 276 2.2× 69 1.0× 124 2.9× 14 0.3× 52 549
Madhu Raka India 10 104 0.3× 81 0.6× 223 3.3× 122 2.8× 15 0.4× 39 284
Rudi Pendavingh Netherlands 7 89 0.3× 43 0.3× 24 0.4× 19 0.4× 12 0.3× 26 138
Kolja Knauer France 8 118 0.4× 51 0.4× 12 0.2× 21 0.5× 37 0.9× 43 165
Arnfried Kemnitz Germany 10 210 0.7× 142 1.1× 9 0.1× 35 0.8× 15 0.4× 39 251
Hunter S. Snevily United States 11 162 0.5× 159 1.3× 39 0.6× 99 2.3× 9 0.2× 23 232
Heinz‐Jürgen Voss Germany 10 223 0.7× 127 1.0× 19 0.3× 108 2.5× 36 0.9× 22 269
Michael Stiebitz Germany 14 504 1.6× 366 2.9× 19 0.3× 79 1.8× 31 0.8× 51 555

Countries citing papers authored by Pascal Ochem

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Pascal Ochem

This figure shows the co-authorship network connecting the top 25 collaborators of Pascal Ochem. A scholar is included among the top collaborators of Pascal Ochem 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 Pascal Ochem. Pascal Ochem 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.
Currie, James D., et al.. (2025). Complement Avoidance in Binary Words. The Electronic Journal of Combinatorics. 32(4).
2.
Ochem, Pascal, et al.. (2024). Critical Exponent of Binary Words with Few Distinct Palindromes. The Electronic Journal of Combinatorics. 31(2). 1 indexed citations
3.
Currie, James D., Pascal Ochem, Narad Rampersad, & Jeffrey Shallit. (2023). Properties of a ternary infinite word. SPIRE - Sciences Po Institutional REpository. 57. 1–1. 1 indexed citations
4.
Ochem, Pascal, et al.. (2019). On Some Interesting Ternary Formulas. The Electronic Journal of Combinatorics. 26(1). 1 indexed citations
5.
Bessy, Stéphane, Pascal Ochem, & Dieter Rautenbach. (2018). On the Kőnig‐Egerváry theorem for ‐paths. Journal of Graph Theory. 91(1). 73–87. 1 indexed citations
6.
Ochem, Pascal, et al.. (2017). Avoidability of circular formulas. Theoretical Computer Science. 726. 1–4. 2 indexed citations
7.
Ochem, Pascal, et al.. (2015). Complexity dichotomy for oriented homomorphism of planar graphs with large girth. Theoretical Computer Science. 596. 142–148. 1 indexed citations
8.
Ochem, Pascal, et al.. (2015). Characterization of some binary words with few squares. Theoretical Computer Science. 588. 73–80. 2 indexed citations
9.
Ochem, Pascal & Michaël Rao. (2014). Another Remark on the Radical of an Odd Perfect Number. ˜The œFibonacci quarterly. 52(3). 215–217. 1 indexed citations
10.
Ochem, Pascal, et al.. (2013). Strong edge-colouring and induced matchings. Information Processing Letters. 113(19-21). 836–843. 10 indexed citations
11.
Nielsen, Pace P., et al.. (2012). Sieve methods for odd perfect numbers. Mathematics of Computation. 81(279). 1753–1776. 3 indexed citations
12.
Ochem, Pascal. (2011). Pattern Avoidance and HDOL Words. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
13.
Ochem, Pascal, et al.. (2011). Thue choosability of trees. Discrete Applied Mathematics. 159(17). 2045–2049. 15 indexed citations
14.
Ochem, Pascal, et al.. (2010). Bounds for the generalized repetition threshold. Theoretical Computer Science. 412(27). 2955–2963. 1 indexed citations
15.
Ochem, Pascal, et al.. (2009). Homomorphisms of 2-edge-colored graphs. Discrete Applied Mathematics. 158(12). 1365–1379. 13 indexed citations
16.
Gonçalves, Daniel & Pascal Ochem. (2008). On star and caterpillar arboricity. Discrete Mathematics. 309(11). 3694–3702. 8 indexed citations
17.
Ochem, Pascal. (2007). Letter frequency in infinite repetition-free words. Theoretical Computer Science. 380(3). 388–392. 6 indexed citations
18.
Ochem, Pascal, Alexandre Pinlou, & Éric Sopena. (2007). On the oriented chromatic index of oriented graphs. Journal of Graph Theory. 57(4). 313–332. 4 indexed citations
19.
Ilie, Lucian, Pascal Ochem, & Jeffrey Shallit. (2005). A generalization of repetition threshold. Theoretical Computer Science. 345(2-3). 359–369. 13 indexed citations
20.
Kucherov, Grégory, Pascal Ochem, & Michaël Rao. (2003). How Many Square Occurrences Must a Binary Sequence Contain?. The Electronic Journal of Combinatorics. 10(1). 7 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 Vít Jelínek Breakdown of academic impact, for papers by Tomáš Kaiser Breakdown of academic impact, for papers by Jarosław Grytczuk Breakdown of academic impact, for papers by Madhu Raka Breakdown of academic impact, for papers by Rudi Pendavingh Breakdown of academic impact, for papers by Kolja Knauer Breakdown of academic impact, for papers by Arnfried Kemnitz Breakdown of academic impact, for papers by Hunter S. Snevily Breakdown of academic impact, for papers by Heinz‐Jürgen Voss Breakdown of academic impact, for papers by Michael Stiebitz
Rankless by CCL
2026