Christophe Paul

3.1k total citations
71 papers, 859 citations indexed

About

Christophe Paul is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Christophe Paul has authored 71 papers receiving a total of 859 indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Computational Theory and Mathematics, 21 papers in Computer Networks and Communications and 15 papers in Artificial Intelligence. Recurrent topics in Christophe Paul's work include Advanced Graph Theory Research (52 papers), Complexity and Algorithms in Graphs (30 papers) and Graph Labeling and Dimension Problems (16 papers). Christophe Paul is often cited by papers focused on Advanced Graph Theory Research (52 papers), Complexity and Algorithms in Graphs (30 papers) and Graph Labeling and Dimension Problems (16 papers). Christophe Paul collaborates with scholars based in France, Canada and Norway. Christophe Paul's co-authors include Michel Habib, Laurent Viennot, Ross M. McConnell, Cyril Gavoille, Pinar Heggernes, Derek G. Corneil, Philippe Gambette, Vincent Berry, Anthony Perez and Jan Arne Telle and has published in prestigious journals such as Bioinformatics, BMC Bioinformatics and SIAM Journal on Computing.

In The Last Decade

Christophe Paul

64 papers receiving 803 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Christophe Paul France 18 613 221 145 138 116 71 859
Ross M. McConnell United States 19 928 1.5× 269 1.2× 136 0.9× 345 2.5× 55 0.5× 43 1.2k
Guillaume Fertin France 15 275 0.4× 92 0.4× 327 2.3× 169 1.2× 324 2.8× 71 788
Łászló A. Székely United States 19 586 1.0× 91 0.4× 192 1.3× 80 0.6× 139 1.2× 76 1.1k
Danny Hermelin Israel 13 548 0.9× 249 1.1× 85 0.6× 134 1.0× 25 0.2× 59 799
Pinar Heggernes Norway 16 790 1.3× 328 1.5× 44 0.3× 106 0.8× 20 0.2× 90 940
Henning Fernau Germany 18 1.0k 1.6× 354 1.6× 292 2.0× 394 2.9× 15 0.1× 190 1.3k
Van Bang Lê Germany 14 1.3k 2.1× 419 1.9× 59 0.4× 137 1.0× 26 0.2× 77 1.5k
Marek Cygan Poland 16 1.2k 2.0× 509 2.3× 87 0.6× 220 1.6× 18 0.2× 85 1.6k
Moshe Lewenstein Israel 19 494 0.8× 188 0.9× 350 2.4× 604 4.4× 39 0.3× 64 1.0k
Joe Sawada Canada 14 376 0.6× 43 0.2× 54 0.4× 294 2.1× 34 0.3× 62 578

Countries citing papers authored by Christophe Paul

Since Specialization
Citations

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

Fields of papers citing papers by Christophe Paul

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Christophe Paul

This figure shows the co-authorship network connecting the top 25 collaborators of Christophe Paul. A scholar is included among the top collaborators of Christophe Paul 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 Christophe Paul. Christophe Paul 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.
Adler, Isolde, et al.. (2021). Connected search for a lazy robber. Journal of Graph Theory. 97(4). 510–552. 1 indexed citations
2.
Niedermeier, Rolf & Christophe Paul. (2019). 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). 126. 9 indexed citations
3.
Kim, Eun Jung, Christophe Paul, Ignasi Sau, & Dimitrios M. Thilikos. (2017). Parameterized algorithms for min-max multiway cut and list digraph homomorphism. Journal of Computer and System Sciences. 86. 191–206. 1 indexed citations
4.
Paul, Christophe, et al.. (2017). Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. Bulletin of Mathematical Biology. 79(4). 920–938. 4 indexed citations
5.
Kim, Eun Jung, Christophe Paul, & Geevarghese Philip. (2014). A single-exponential FPT algorithm for the K4-minor cover problem. Journal of Computer and System Sciences. 81(1). 186–207. 3 indexed citations
6.
Heggernes, Pinar, Pim van ’t Hof, Benjamin Lévêque, & Christophe Paul. (2013). Contracting chordal graphs and bipartite graphs to paths and trees. Discrete Applied Mathematics. 164. 444–449. 6 indexed citations
7.
Paul, Christophe, et al.. (2011). Circle Graph Recognition in Time O(n+m) α(n+m). arXiv (Cornell University). 1 indexed citations
8.
Bessy, Stéphane, Christophe Paul, & Anthony Perez. (2010). Polynomial kernels for 3-leaf power graph modification problems. Discrete Applied Mathematics. 158(16). 1732–1744. 7 indexed citations
9.
Bessy, Stéphane, Fedor V. Fomin, Serge Gaspers, et al.. (2010). Kernels for feedback arc set in tournaments. Journal of Computer and System Sciences. 77(6). 1071–1078. 24 indexed citations
10.
Paul, Christophe & Michel Habib. (2009). Graph-Theoretic Concepts in Computer Science: 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. DIAL (Catholic University of Leuven). 1 indexed citations
11.
Guillemot, Sylvain, François Nicolas, Vincent Berry, & Christophe Paul. (2008). On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. Discrete Applied Mathematics. 157(7). 1555–1570. 1 indexed citations
12.
Corneil, Derek G., et al.. (2007). Simple, Linear-Time Modular Decomposition. arXiv (Cornell University). 634–645. 4 indexed citations
13.
Bérard, Sèverine, Anne Bergeron, Cédric Chauve, & Christophe Paul. (2007). Perfect Sorting by Reversals Is Not Always Difficult. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 4(1). 4–16. 31 indexed citations
14.
Bui-Xuan, Binh-Minh, Michel Habib, & Christophe Paul. (2007). Competitive graph searches. Theoretical Computer Science. 393(1-3). 72–80. 3 indexed citations
15.
Habib, Michel & Christophe Paul. (2004). A simple linear time algorithm for cograph recognition. Discrete Applied Mathematics. 145(2). 183–197. 43 indexed citations
16.
Habib, Michel, et al.. (2003). Identifying Common Connected Components of Graphs. HAL (Le Centre pour la Communication Scientifique Directe). 6 indexed citations
17.
Gavoille, Cyril & Christophe Paul. (2003). Distance labeling scheme and split decomposition. Discrete Mathematics. 273(1-3). 115–130. 16 indexed citations
18.
Habib, Michel, Christophe Paul, & Laurent Viennot. (2001). Linear time recognition of P4-indifference graphs. Discrete Mathematics & Theoretical Computer Science. Vol. 4 no. 2. 2 indexed citations
19.
Habib, Michel, et al.. (2000). Lex-BFS a partition refining technique, application to transitive orientation and consecutive 1's testing. Theoretical Computer Science. 234. 2 indexed citations
20.
Habib, Michel, Ross M. McConnell, Christophe Paul, & Laurent Viennot. (2000). Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoretical Computer Science. 234(1-2). 59–84. 127 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 Ross M. McConnell Breakdown of academic impact, for papers by Guillaume Fertin Breakdown of academic impact, for papers by Łászló A. Székely Breakdown of academic impact, for papers by Danny Hermelin Breakdown of academic impact, for papers by Pinar Heggernes Breakdown of academic impact, for papers by Henning Fernau Breakdown of academic impact, for papers by Van Bang Lê Breakdown of academic impact, for papers by Marek Cygan Breakdown of academic impact, for papers by Moshe Lewenstein Breakdown of academic impact, for papers by Joe Sawada
Rankless by CCL
2026