| Lex-BFS a partition refining technique, application to transitive orientation and consecutive 1's testing M Habib, R Mac Connell, C Paul, L Viennot Theoretical Computer Science 234, 2000 | 391 | 2000 |
| A new linear algorithm for modular decomposition A Cournier, M Habib Trees in Algebra and Programming—CAAP'94: 19th International Colloquium …, 1994 | 308 | 1994 |
| A survey of the algorithmic aspects of modular decomposition M Habib, C Paul Computer Science Review 4 (1), 41-59, 2010 | 226 | 2010 |
| Méthaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes JK Hao, P Galinier, M Habib Revue d'intelligence artificielle 13 (2), 283-324, 1999 | 226 | 1999 |
| Simpler linear-time modular decomposition via recursive factorizing permutations M Tedder, D Corneil, M Habib, C Paul Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008 | 222 | 2008 |
| Polynomial time recognition of clique-width≤ 3 graphs DG Corneil, M Habib, JM Lanligne, B Reed, U Rotics LATIN 2000: Theoretical Informatics: 4th Latin American Symposium, Punta del …, 2000 | 174* | 2000 |
| Probabilistic methods for algorithmic discrete mathematics M Habib, C McDiarmid, J Ramirez-Alfonsin, B Reed Springer Science & Business Media, 2013 | 151 | 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 | 147 | 2008 |
| A simple linear time algorithm for cograph recognition M Habib, C Paul Discrete Applied Mathematics 145 (2), 183-197, 2005 | 142 | 2005 |
| Chordal graphs and their clique graphs P Galinier, M Habib, C Paul International Workshop on Graph-Theoretic Concepts in Computer Science, 358-371, 1995 | 135 | 1995 |
| Partitive hypergraphs M Chein, M Habib, MC Maurer Discrete mathematics 37 (1), 35-50, 1981 | 126 | 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 | 120 | 1999 |
| 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 | 104 | 2009 |
| On the X-join decomposition for undirected graphs M Habib, MC Maurer Discrete Applied Mathematics 1 (3), 201-207, 1979 | 103 | 1979 |
| 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 | 95 | 2016 |
| 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 | 88 | 2004 |
| Diameter determination on restricted graph families DG Corneil, FF Dragan, M Habib, C Paul Discrete Applied Mathematics 113 (2-3), 143-166, 2001 | 87 | 2001 |
| On linear k-arboricity JC Bermond, JL Fouquet, M Habib, B Peroche Discrete Mathematics 52 (2-3), 123-132, 1984 | 87 | 1984 |
| 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 | 86* | 2015 |
| 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 | 81 | 2013 |
Christophe PaulCNRS LIRMM在 lirmm.fr 的电子邮件经过验证
