Michel Habib
Michel Habib
Computer Science, Paris University
Verified email at irif.fr - Homepage
Cited by
Cited by
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
M Habib, R McConnell, C Paul, L Viennot
Theoretical Computer Science 234 (1-2), 59-84, 2000
A new linear algorithm for modular decomposition
A Cournier, M Habib
Colloquium on Trees in Algebra and Programming, 68-84, 1994
Métaheuristiques pour l’optimisation combinatoire et l’affectation sous contraintes
JK Hao, P Galinier, M Habib
Revue d’intelligence artificielle 13 (2), 283-324, 1999
A survey of the algorithmic aspects of modular decomposition
M Habib, C Paul
Computer Science Review 4 (1), 41-59, 2010
Polynomial time recognition of clique-width≤ 3 graphs
DG Corneil, M Habib, JM Lanligne, B Reed, U Rotics
Latin American Symposium on Theoretical Informatics, 126-134, 2000
Simpler linear-time modular decomposition via recursive factorizing permutations
M Tedder, D Corneil, M Habib, C Paul
International Colloquium on Automata, Languages, and Programming, 634-645, 2008
Probabilistic methods for algorithmic discrete mathematics
M Habib, C McDiarmid, J Ramirez-Alfonsin, B Reed
Springer Science & Business Media, 2013
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
V Chepoi, F Dragan, B Estellon, M Habib, Y Vaxès
Proceedings of the twenty-fourth annual symposium on Computational geometry …, 2008
Partitive hypergraphs
M Chein, M Habib, MC Maurer
Discrete mathematics 37 (1), 35-50, 1981
Chordal graphs and their clique graphs
P Galinier, M Habib, C Paul
International Workshop on Graph-Theoretic Concepts in Computer Science, 358-371, 1995
A simple linear time algorithm for cograph recognition
M Habib, C Paul
Discrete Applied Mathematics 145 (2), 183-197, 2005
Partition refinement techniques: An interesting algorithmic tool kit
M Habib, C Paul, L Viennot
International Journal of Foundations of Computer Science 10 (02), 147-170, 1999
On the X-join decomposition for undirected graphs
M Habib, MC Maurer
Discrete Applied Mathematics 1 (3), 201-207, 1979
Fast computation of empirically tight bounds for the diameter of massive graphs
C Magnien, M Latapy, M Habib
Journal of Experimental Algorithmics (JEA) 13, 1.10-1.9, 2009
A simple linear-time modular decomposition algorithm for graphs, using order extension
M Habib, F De Montgolfier, C Paul
Scandinavian Workshop on Algorithm Theory, 187-198, 2004
On linear k-arboricity
JC Bermond, JL Fouquet, M Habib, B Peroche
Discrete Mathematics 52 (2-3), 123-132, 1984
On computing the diameter of real-world undirected graphs
P Crescenzi, R Grossi, M Habib, L Lanzi, A Marino
Theoretical Computer Science 514, 84-95, 2013
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
G Damiand, M Habib, C Paul
Theoretical Computer Science 263 (1-2), 99-111, 2001
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games
M Borassi, P Crescenzi, M Habib, WA Kosters, A Marino, FW Takes
Theoretical Computer Science 586, 59-80, 2015
Into the square: On the complexity of some quadratic-time solvable problems
M Borassi, P Crescenzi, M Habib
Electronic Notes in Theoretical Computer Science 322, 51-67, 2016
The system can't perform the operation now. Try again later.
Articles 1–20