| 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 | 332 | 2000 |
| A new linear algorithm for modular decomposition A Cournier, M Habib Colloquium on Trees in Algebra and Programming, 68-84, 1994 | 282 | 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 | 196 | 1999 |
| 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 | 160* | 2000 |
| A survey of the algorithmic aspects of modular decomposition M Habib, C Paul Computer Science Review 4 (1), 41-59, 2010 | 156 | 2010 |
| 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 | 150 | 2008 |
| 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 | 129 | 2008 |
| Probabilistic methods for algorithmic discrete mathematics M Habib, C McDiarmid, J Ramirez-Alfonsin, B Reed Springer Science & Business Media, 2013 | 126 | 2013 |
| Chordal graphs and their clique graphs P Galinier, M Habib, C Paul International Workshop on Graph-Theoretic Concepts in Computer Science, 358-371, 1995 | 112 | 1995 |
| Partitive hypergraphs M Chein, M Habib, MC Maurer Discrete mathematics 37 (1), 35-50, 1981 | 109 | 1981 |
| 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 | 107 | 1999 |
| A simple linear time algorithm for cograph recognition M Habib, C Paul Discrete Applied Mathematics 145 (2), 183-197, 2005 | 106 | 2005 |
| On the X-join decomposition for undirected graphs M Habib, MC Maurer Discrete Applied Mathematics 1 (3), 201-207, 1979 | 91 | 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 | 83 | 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 | 77 | 2004 |
| On linear k-arboricity JC Bermond, JL Fouquet, M Habib, B Peroche Discrete Mathematics 52 (2-3), 123-132, 1984 | 75 | 1984 |
| 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 | 69 | 2001 |
| Monotonic conflict resolution mechanisms for inheritance R Ducournau, M Habib, M Huchard, ML Mugnier ACM SIGPLAN Notices 27 (10), 16-24, 1992 | 67 | 1992 |
| Additive spanners and distance and routing labeling schemes for hyperbolic graphs V Chepoi, FF Dragan, B Estellon, M Habib, Y Vaxes, Y Xiang Algorithmica 62 (3), 713-732, 2012 | 65 | 2012 |
| A simple linear time LexBFS cograph recognition algorithm A Bretscher, D Corneil, M Habib, C Paul International Workshop on Graph-Theoretic Concepts in Computer Science, 119-130, 2003 | 65 | 2003 |
Christophe PaulCNRS LIRMMVerified email at lirmm.fr
