Pascal Ochem

875 citations
70 papers · 464 · h-index 13

Impact in

Papers in

    • Advanced Graph Theory Research 36
    • semigroups and automata theory 28
    • Graph Labeling and Dimension Problems 22
    • Computability, Logic, AI Algorithms 6
    • Advanced Algebra and Logic 6
    • Algorithms and Data Compression 18
    • Coding theory and cryptography 7

Pascal Ochem

64 papers receiving 438 citations

Peers

Pascal Ochem
Comparison fields: 5 of 26
  • Discrete Mathematics and Combinatorics 153
  • Computational Theory and Mathematics 419
  • Computer Graphics and Computer-Aided Design 52
  • Theoretical Computer Science 12
  • Algebra and Number Theory 29
Replace Madhu Raka with:
Madhu Raka India
Péter Komjáth Hungary
N. Alon Israel
Hunter S. Snevily United States
Jarosław Grytczuk Poland
Robert Cowen United States
Ajai Kapoor Italy
Gábor Hetyei United States
Jozef Skokan United States
Bert Gerards Netherlands
Pascal Ochem relative to Madhu Raka India Madhu Raka's profile →
Citations per field
00.5×3.9×
Madhu Raka · 1×
Citations per year

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-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.

Border = papers with Pascal Ochem Line = papers co-authored together Pascal Ochem links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 70 papers — load more, or switch the sort, to bring in the rest.

#Work
1 200633
2 200929
3 200523
4 201523
5 201223
6 200420
7 201618
8 200917
9 201115
10 201214
11 200514
12 200514
13 200812
14 200812
15 201312
16
ISLANDS IN GRAPHS ON SURFACES
201611
17 200611
18 200310
19 200810
20 201310

About Pascal Ochem

Pascal Ochem is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design and Molecular Biology, having authored 70 papers that have together received 464 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (36 papers), semigroups and automata theory (28 papers), Graph Labeling and Dimension Problems (22 papers), Limits and Structures in Graph Theory (21 papers), Algorithms and Data Compression (18 papers), Coding theory and cryptography (7 papers), Computability, Logic, AI Algorithms (6 papers) and Advanced Algebra and Logic (6 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (153 citations), Computational Theory and Mathematics (419 citations), Computer Graphics and Computer-Aided Design (52 citations), Theoretical Computer Science (12 citations) and Algebra and Number Theory (29 citations). Pascal Ochem has collaborated with scholars based in France, Canada and India. Frequent co-authors include Mickaël Montassier, Alexandre Pinlou, Louis Esperet, André Raspaud, Michaël Rao, Daniel Gonçalves, Jeffrey Shallit, O. V. Borodin, Grégory Kucherov and Éric Sopena. Their work appears in journals such as The Electronic Journal of Combinatorics, Journal of Graph Theory, Theoretical Computer Science, Discrete Mathematics and Discrete Mathematics & Theoretical Computer Science.

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