| 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 | 388 | 2000 |
| A survey of the algorithmic aspects of modular decomposition M Habib, C Paul Computer Science Review 4 (1), 41-59, 2010 | 228 | 2010 |
| 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 | 217 | 2008 |
| A simple linear time LexBFS cograph recognition algorithm A Bretscher, D Corneil, M Habib, C Paul SIAM Journal on Discrete Mathematics 22 (4), 1277-1296, 2008 | 145* | 2008 |
| A simple linear time algorithm for cograph recognition M Habib, C Paul Discrete Applied Mathematics 145 (2), 183-197, 2005 | 144 | 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 |
| Linear kernels and single-exponential algorithms via protrusion decompositions EJ Kim, A Langer, C Paul, F Reidl, P Rossmanith, I Sau, S Sikdar ACM Transactions on Algorithms (TALG) 12 (2), 1-41, 2015 | 122 | 2015 |
| Approximate distance labeling schemes C Gavoille, M Katz, NA Katz, C Paul, D Peleg Algorithms—ESA 2001: 9th Annual European Symposium Århus, Denmark, August …, 2001 | 120 | 2001 |
| 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 |
| Interval completion is fixed parameter tractable Y Villanger, P Heggernes, C Paul, JA Telle SIAM Journal on Computing 38 (5), 2007-2020, 2009 | 103* | 2009 |
| Eclecticism shrinks even small worlds P Fraigniaud, C Gavoille, C Paul Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004 | 95 | 2004 |
| Fully dynamic recognition algorithm and certificate for directed cographs C Crespelle, C Paul Discrete Applied Mathematics 154 (12), 1722-1741, 2006 | 92 | 2006 |
| 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 |
| Computing galled networks from real data DH Huson, R Rupp, V Berry, P Gambette, C Paul Bioinformatics 25 (12), i85-i93, 2009 | 85 | 2009 |
| Perfect sorting by reversals is not always difficult S Bérard, A Bergeron, C Chauve, C Paul IEEE/ACM transactions on computational biology and bioinformatics 4 (1), 4-16, 2007 | 82 | 2007 |
| On the (Non-)Existence of Polynomial Kernels for P l -Free Edge Modification Problems S Guillemot, F Havet, C Paul, A Perez Algorithmica 65, 900-926, 2013 | 81 | 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 | 81 | 2001 |
| Diameter determination on restricted graph families DG Corneil, FF Dragan, M Habib, C Paul Discrete Applied Mathematics 113 (2-3), 143-166, 2001 | 79 | 2001 |
| Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs E Gioan, C Paul Discrete Applied Mathematics 160 (6), 708-733, 2012 | 76* | 2012 |
| Kernels for feedback arc set in tournaments S Bessy, FV Fomin, S Gaspers, C Paul, A Perez, S Saurabh, S Thomassé Journal of Computer and System Sciences 77 (6), 1071-1078, 2011 | 74 | 2011 |
Michel HabibComputer Science, Université Paris CitéVerified email at irif.fr
