World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
33
Citations
3984
World Ranking
12775
National Ranking
326

Mathematics

D-Index
33
Citations
3955
World Ranking
3065
National Ranking
183

Overview

Christophe Paul is affiliated with the University of Montpellier in France and has contributed extensively to research in computer science and mathematics. Their work primarily spans computational theory and mathematics, with additional focus on computer networks, geometry, topology, management science, operations research, and applied mathematics.

The scientist's research covers several key topics including advanced graph theory research, complexity and algorithms in graphs, graph theory and applications, topological and geometric data analysis, optimization and search problems, game theory and applications, and complex network analysis techniques.

Christophe Paul has published in various venues. Frequent publication venues include:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Discrete Applied Mathematics
  • Theory of Computing Systems
  • Theoretical Computer Science

Some recent papers authored or co-authored by Christophe Paul are:

  • "Front Matter, Table of Contents, Preface, Conference Organization," 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Graph Parameters, Universal Obstructions, and WQO," 2023, arXiv (Cornell University)
  • "Edge degeneracy: Algorithmic and structural results," 2020, Theoretical Computer Science (co-authored by Stratis Limnios)
  • "Hierarchical Clusterings of Unweighted Graphs," 2020, HAL (Le Centre pour la Communication Scientifique Directe) (co-authored by Svein Høgemo)
  • "A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth," 2022, SIAM Journal on Discrete Mathematics (co-authored by Mamadou Moustapha Kanté)

Their frequent co-authors include:

  • Dimitrios M. Thilikos (9 publications)
  • Evangelos Protopapas (6 publications)
  • Svein Høgemo (4 publications)
  • Jan Arne Telle (4 publications)
  • Guillaume Mescoff (4 publications)

Christophe Paul's academic contributions focus heavily on graph theory and its applications, addressing both theoretical and algorithmic challenges. This combination of topics indicates a research profile that bridges pure and applied aspects of mathematics and computer science.

Best Publications

  • Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

    Michel Habib;Ross McConnell;Christophe Paul;Laurent Viennot

  • Survey: A survey of the algorithmic aspects of modular decomposition

    Michel Habib;Christophe Paul

  • Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations

    Marc Tedder;Derek Corneil;Michel Habib;Christophe Paul

  • Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions

    Eun Jung Kim;Alexander Langer;Christophe Paul;Felix Reidl

  • A simple linear time algorithm for cograph recognition

    Michel Habib;Christophe Paul

  • Approximate Distance Labeling Schemes

    Cyril Gavoille;Michal Katz;Nir A. Katz;Christophe Paul

  • Chordal Graphs and Their Clique Graphs

    Philippe Galinier;Michel Habib;Christophe Paul

  • PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT

    Michel Habib;Christophe Paul;Laurent Viennot

  • A Simple Linear Time LexBFS Cograph Recognition Algorithm

    Anna Bretscher;Derek G. Corneil;Michel Habib;Christophe Paul

  • Eclecticism shrinks even small worlds

    Pierre Fraigniaud;Cyril Gavoille;Christophe Paul

  • Fully dynamic recognition algorithm and certificate for directed cograph

    C. Crespelle;C. Paul

  • Computing galled networks from real data

    Daniel H. Huson;Regula Rupp;Vincent Berry;Philippe Gambette

  • A Simple Linear Time LexBFS Cograph Recognition Algorithm

    Anna Bretscher;Derek Corneil;Michel Habib;Christophe Paul

  • A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension

    Michel Habib;Fabien de Montgolfier;Christophe Paul

  • A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

    Guillaume Damiand;Michel Habib;Christophe Paul

  • On the (Non-)Existence of Polynomial Kernels for Pl-Free Edge Modification Problems

    Sylvain Guillemot;Frédéric Havet;Christophe Paul;Anthony Perez

  • Diameter determination on restricted graph families

    Derek G. Corneil;Feodor E. Dragan;Michel Habib;Christophe Paul

  • Perfect Sorting by Reversals Is Not Always Difficult

    Severine Berard;Anne Bergeron;Cedric Chauve;Christophe Paul

  • Obtaining a Bipartite Graph by Contracting Few Edges

    Pinar Heggernes;Pim van 't Hof;Daniel Lokshtanov;Christophe Paul

  • Kernels for feedback arc set in tournaments

    Stéphane Bessy;Fedor V. Fomin;Serge Gaspers;Christophe Paul

  • On the (non-)existence of polynomial kernels for Pl-free edge modification problems

    Sylvain Guillemot;Christophe Paul;Anthony Perez

  • A survey on algorithmic aspects of modular decomposition

    Michel Habib;Christophe Paul

Frequent Co-Authors

Dimitrios M. Thilikos
Dimitrios M. Thilikos National and Kapodistrian University of Athens
Michel Habib
Michel Habib Université Paris Cité
Derek G. Corneil
Derek G. Corneil University of Toronto
Cyril Gavoille
Cyril Gavoille University of Bordeaux
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Michał Pilipczuk
Michał Pilipczuk University of Warsaw
Rolf Niedermeier
Rolf Niedermeier Technical University of Berlin
Peter Rossmanith
Peter Rossmanith RWTH Aachen University
Fedor V. Fomin
Fedor V. Fomin University of Bergen

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Mathematics in the USA opens doors to diverse career and educational opportunities. For those interested in advanced business leadership, pursuing the cheapest aacsb online dba programs can provide a cost-effective route to a Doctorate in Business Administration with recognized accreditation.

Finance professionals looking to leverage their analytical skills can benefit from a cheap online masters in finance. These programs often balance affordability with quality, enabling graduates to excel in financial analysis, modeling, and risk management roles.

For students aiming to accelerate their career growth, considering the fastest mba programs online helps in gaining vital leadership and management skills without a long academic commitment. This option appeals especially to working professionals seeking quick advancement.

Marketing graduates who want to combine creativity with data-driven strategies will find that specialized marketing graduate programs offer programs that are both affordable and have strong salary potential post-graduation.

Overall, these aligned online degrees complement a Mathematics background by expanding career paths into business, finance, and marketing, all critical sectors in today’s economy.

Best Scientists Citing Christophe Paul

Trending Scientists