World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
41
Citations
5573
World Ranking
8964
National Ranking
216

Mathematics

D-Index
41
Citations
5431
World Ranking
1953
National Ranking
118

Overview

Michel Habib is affiliated with Université Paris Cité in France. Their research focus centers on computer science and mathematics, with a significant emphasis on computational theory and mathematics. Other noted subfields include computer networks and communications, discrete mathematics and combinatorics, geometry and topology, and electrical and electronic engineering.

The scholar's main topics of work include:

  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Limits and Structures in Graph Theory
  • Graph Labeling and Dimension Problems
  • Graph theory and applications
  • Interconnection Networks and Systems
  • Opportunistic and Delay-Tolerant Networks

Habib has contributed extensively to the literature, with 63 publications in computer science and 15 in mathematics. Their articles have appeared most frequently in venues such as:

  • arXiv (Cornell University)
  • SIAM Journal on Discrete Mathematics
  • Theoretical Computer Science
  • SIAM Journal on Computing
  • Journal of Graph Theory

Recent papers include:

  • "Diagnosability for a family of matching composition networks," 2022, The Journal of Supercomputing
  • "Graph Classes and Forbidden Patterns on Three Vertices," 2021, SIAM Journal on Discrete Mathematics
  • "A novel edge connectivity based on edge partition for hypercube and folded hypercube," 2024, Applied Mathematics and Computation
  • "Fast Diameter Computation within Split Graphs," 2021, Lecture Notes in Computer Science
  • "Diameter in linear time for constant-dimension median graphs," 2021, Procedia Computer Science

Frequent co-authors collaborating with Habib include:

  • Guillaume Ducoffe
  • P. Bergé
  • Laurent Viennot
  • Lalla Mouatadid
  • Mengchuan Zou

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

  • A New Linear Algorithm for Modular Decomposition

    Alain Cournier;Michel Habib

  • Probabilistic methods for algorithmic discrete mathematics

    M. Habib

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

    Michel Habib;Christophe Paul

  • Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes

    Jin-Kao Hao;Philippe Galinier;Michel Habib

  • Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations

    Marc Tedder;Derek Corneil;Michel Habib;Christophe Paul

  • Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs

    Victor Chepoi;Feodor Dragan;Bertrand Estellon;Michel Habib

  • Polynomial Time Recognition of Clique-Width ≤ 3 Graphs

    Derek G. Corneil;Michel Habib;Jean-Marc Lanligne;Bruce Reed

  • A simple linear time algorithm for cograph recognition

    Michel Habib;Christophe Paul

  • Partitive hypergraphs

    M. Chein;M. Habib;M. C. Maurer

  • 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

  • On the X-join decomposition for undirected graphs

    Michel Habib;M. C. Maurer

  • Fast computation of empirically tight bounds for the diameter of massive graphs

    Clémence Magnien;Matthieu Latapy;Michel Habib

  • Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract)

    Derek G. Corneil;Michel Habib;Jean-Marc Lanlignel;Bruce A. Reed

  • A Simple Linear Time LexBFS Cograph Recognition Algorithm

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

  • LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs

    Derek G. Corneil;Barnaby Dalton;Michel Habib

  • On computing the diameter of real-world undirected graphs

    Pilu Crescenzi;Roberto Grossi;Michel Habib;Leonardo Lanzi

  • A Simple Linear Time LexBFS Cograph Recognition Algorithm

    Anna Bretscher;Derek Corneil;Michel Habib;Christophe Paul

  • On linear k-arboricity

    Jean-Claude Bermond;Jean-Luc Fouquet;Michel Habib;Bernard Péroche

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

    Michel Habib;Fabien de Montgolfier;Christophe Paul

  • A survey on algorithmic aspects of modular decomposition

    Michel Habib;Christophe Paul

Frequent Co-Authors

Christophe Paul
Christophe Paul University of Montpellier
Derek G. Corneil
Derek G. Corneil University of Toronto
Feodor F. Dragan
Feodor F. Dragan Kent State University
Victor Chepoi
Victor Chepoi Aix-Marseille University
Mireille Besson
Mireille Besson Aix-Marseille University
Pierluigi Crescenzi
Pierluigi Crescenzi Gran Sasso Science Institute
Bruce Reed
Bruce Reed McGill University
Kurt Mehlhorn
Kurt Mehlhorn Max Planck Institute for Informatics
Rolf H. Möhring
Rolf H. Möhring Technical University of Berlin
Emmanuel Bigand
Emmanuel Bigand University of Burgundy

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

For students studying Mathematics in the USA, expanding skill sets through related online degrees can open diverse career opportunities. Many professionals transition into business roles by pursuing an online MBA with transfer credits accepted. This flexibility allows them to leverage prior coursework efficiently while gaining valuable managerial expertise.

Another growing field aligned with Mathematics is data science and analytics. Enrolling in a masters in data analytics provides deep insight into interpreting complex datasets—an essential skill in today's data-driven economy.

For those seeking quicker routes to career advancement, exploring programs recognized as the easiest MBA programs offers a viable option. These programs often have more accessible admission criteria and flexible schedules.

Similarly, the easiest and fastest online MBA programs combine speed and affordability, making them attractive to professionals looking to bolster leadership skills without interrupting their careers.

Overall, integrating Mathematics with these complementary degrees can significantly enhance job prospects across industries such as finance, technology, and management.

Best Scientists Citing Michel Habib

Trending Scientists

Recently Published Articles