On the X-join decomposition for undirected graphs. - Michel Habib; M. C. Maurer (Discret. Appl. Math., 1979)

Nombre de sauts et graphes série-parallèles. - Olivier Cogis; Michel Habib (RAIRO Theor. Informatics Appl., 1979)

Partitive hypergraphs. - Michel Chein; Michel Habib; M. C. Maurer (Discret. Math., 1981)

Some problems about linear arboricity. - Michel Habib; Bernard Péroche (Discret. Math., 1982)

Jump number of dags having Dilworth number 2. - Michel Chein; Michel Habib (Discret. Appl. Math., 1984)

On linear k-arboricity. - Jean-Claude Bermond; Jean-Luc Fouquet; Michel Habib; Bernard Péroche (Discret. Math., 1984)

N-free posets as generalizations of series-parallel posets. - Michel Habib; Roland Jégou (Discret. Appl. Math., 1985)

1-Intersecting families. - Michel Habib; M. C. Maurer (Discret. Math., 1985)

CABRI, An Interactive System for Graph Manipulation. - M. Dao; Michel Habib; J. P. Richard; Didier Tallot (WG, 1986)

On Some Algorithms for Multiple Inheritance in Object-Oriented Programming. - Roland Ducournau; Michel Habib (ECOOP, 1987)

On some complexity properties of N-free posets and posets with bounded decomposition diameter. - Michel Habib; Rolf H. Möhring (Discret. Math., 1987)

Remarks on Some Concurrency Measures. - Michel Habib; Michel Morvan; Jean-Xavier Rampon (WG, 1990)

Interval dimension is a comparability invariant. - Michel Habib; David Kelly; Rolf H. Möhring (Discret. Math., 1991)

Monotonic Conflict Resolution Mechanisms for Inheritance. - Roland Ducournau; Michel Habib; Marianne Huchard; Marie-Laure Mugnier (OOPSLA, 1992)

An Efficient Algorithm to Recognize Prime Undirected Graphs. - Alain Cournier; Michel Habib (WG, 1992)

On the calculation of transitive reduction - closure of orders. - Michel Habib; Michel Morvan; Jean-Xavier Rampon (Discret. Math., 1993)

A New Linear Algorithm for Modular Decomposition. - Alain Cournier; Michel Habib (CAAP, 1994)

Proposal for a Monotonic Multiple Inheritance Linearization. - Roland Ducournau; Michel Habib; Marianne Huchard; Marie-Laure Mugnier (OOPSLA, 1994)

Bit-Vector Encoding for Partially Ordered Sets. - Michel Habib; Lhouari Nourine (ORDAL, 1994)

On the Interplay Between Interval Dimension and Dimension. - Stefan Felsner; Michel Habib; Rolf H. Möhring (SIAM J. Discret. Math., 1994)

Chordal Graphs and Their Clique Graphs. - Philippe Galinier; Michel Habib; Christophe Paul (WG, 1995)

A Linear Algorithm To Decompose Inheritance Graphs Into Modules. - Michel Habib; Marianne Huchard; Jeremy P. Spinrad (Algorithmica, 1995)

Tree Structure for Distributive Lattices and its Applications. - Michel Habib; Lhouari Nourine (Theor. Comput. Sci., 1996)

Graph decompositions and factorizing permutations. - Christian Capelle; Michel Habib (ISTCS, 1997)

Gray Codes for the Ideals of Interval Orders. - Michel Habib; Lhouari Nourine; George Steiner (J. Algorithms, 1997)

Preface: Orders, Algorithms and Applications. - Vincent Bouchitté; Michel Habib; Michel Morvan (Theor. Comput. Sci., 1997)

Representation of stereochemistry using combinatorial maps. - Andreas Dietz; Christophe Fiorio; Michel Habib; Claude Laurenço (Discrete Mathematical Chemistry, 1998)

A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. - Michel Habib; Christophe Paul; Laurent Viennot (STACS, 1998)

Diameter Determination on Restricted Graph Faminlies. - Derek G. Corneil; Feodor F. Dragan; Michel Habib; Christophe Paul (WG, 1998)

Encoding of Multiple Inheritance Hierarchies and Partial Orders. - Yves Caseau; Michel Habib; Lhouari Nourine; Olivier Raynaud (Comput. Intell., 1999)

Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. - Michel Habib; Christophe Paul; Laurent Viennot (Int. J. Found. Comput. Sci., 1999)

Polynomial Time Recognition of Clique-Width le leq 3 Graphs (Extended Abstract). - Derek G. Corneil; Michel Habib; Jean-Marc Lanlignel; Bruce A. Reed; Udi Rotics (LATIN, 2000)

Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. - Michel Habib; Ross M. McConnell; Christophe Paul; Laurent Viennot (Theor. Comput. Sci., 2000)

Diameter determination on restricted graph families. - Derek G. Corneil; Feodor F. Dragan; Michel Habib; Christophe Paul (Discret. Appl. Math., 2001)

Efficient algorithms on distributive lattices. - Michel Habib; Raoul Medina; Lhouari Nourine; George Steiner (Discret. Appl. Math., 2001)

Linear time recognition of P4-indifference graphs. - Michel Habib; Christophe Paul; Laurent Viennot (Discret. Math. Theor. Comput. Sci., 2001)

A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. - Guillaume Damiand; Michel Habib; Christophe Paul (Theor. Comput. Sci., 2001)

The perception of stop consonant sequences in dyslexic and normal children. - Noël Nguyen; Ludovic Jankowski; Michel Habib (INTERSPEECH, 2002)

Graph Decompositions andFactorizing Permutations. - Christian Capelle; Michel Habib; Fabien de Montgolfier (Discret. Math. Theor. Comput. Sci., 2002)

A note on finding all homogeneous set sandwiches. - Michel Habib; Emmanuelle Lebhar; Christophe Paul (Inf. Process. Lett., 2003)

Maximal Common Connected Sets of Interval Graphs. - Michel Habib; Christophe Paul; Mathieu Raffinot (CPM, 2004)

A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. - Michel Habib; Fabien de Montgolfier; Christophe Paul (SWAT, 2004)

Bimodular Decomposition of Bipartite Graphs. - Jean-Luc Fouquet; Michel Habib; Fabien de Montgolfier; Jean-Marie Vanherpe (WG, 2004)

Computational aspects of the 2-dimension of partially ordered sets. - Michel Habib; Lhouari Nourine; Olivier Raynaud; Eric Thierry (Theor. Comput. Sci., 2004)

Revisiting T. Uno and M. Yagiura's Algorithm . - Binh-Minh Bui-Xuan; Michel Habib; Christophe Paul (ISAAC, 2005)

A simple linear time algorithm for cograph recognition. - Michel Habib; Christophe Paul (Discret. Appl. Math., 2005)

The number of Moore families on n=6. - Michel Habib; Lhouari Nourine (Discret. Math., 2005)

Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (WG, 2006)

Algorithmic Aspects of a Novel Modular Decomposition Theory - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (CoRR, 2006)

On Modular Decomposition Concepts: the case for Homogeneous Relations. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (Electron. Notes Discret. Math., 2006)

Foreword. - Volker Diekert; Michel Habib (Theory Comput. Syst., 2006)

Unifying Two Graph Decompositions with Modular Decomposition. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (ISAAC, 2007)

Simple, linear-time modular decomposition - Marc Tedder; Derek G. Corneil; Michel Habib; Christophe Paul (CoRR, 2007)

Can transitive orientation make sandwich problems easier? - Michel Habib; David Kelly; Emmanuelle Lebhar; Christophe Paul (Discret. Math., 2007)

On transitive orientations with restricted covering graphs. - Maria Patricia Dobson; Marisa Gutierrez; Michel Habib; Jayme Luiz Szwarcfiter (Inf. Process. Lett., 2007)

Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès (SCG, 2008)

Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. - Marc Tedder; Derek G. Corneil; Michel Habib; Christophe Paul (ICALP (1), 2008)

A Representation Theorem for Union-Difference Families and Application. - Binh-Minh Bui-Xuan; Michel Habib (LATIN, 2008)

Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès (Electron. Notes Discret. Math., 2008)

A note on computing set overlap classes. - Pierre Charbit; Michel Habib; Vincent Limouzy; Fabien de Montgolfier; Mathieu Raffinot; Michaël Rao (Inf. Process. Lett., 2008)

Fast computation of empirically tight bounds for the diameter of massive graphs. - Clémence Magnien; Matthieu Latapy; Michel Habib (ACM J. Exp. Algorithmics, 2008)

A Simple Linear Time LexBFS Cograph Recognition Algorithm. - Anna Bretscher; Derek G. Corneil; Michel Habib; Christophe Paul (SIAM J. Discret. Math., 2008)

Competitive graph searches. - Binh-Minh Bui-Xuan; Michel Habib; Christophe Paul (Theor. Comput. Sci., 2008)

Diameter and Center Computations in Networks. - Michel Habib (CTW, 2009)

Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time. - Thu-Hien To; Michel Habib (CPM, 2009)

Polynomial-Time Algorithm for the Leafage of Chordal Graphs. - Michel Habib; Juraj Stacho (ESA, 2009)

Algorithmic aspects of a general modular decomposition theory. - Binh-Minh Bui-Xuan; Michel Habib; Vincent Limouzy; Fabien de Montgolfier (Discret. Appl. Math., 2009)

Unifying the representation of symmetric crossing families and weakly partitive families. - Binh-Minh Bui-Xuan; Michel Habib (Electron. Notes Discret. Math., 2009)

On some simplicial elimination schemes for chordal graphs. - Michel Habib; Vincent Limouzy (Electron. Notes Discret. Math., 2009)

Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage. - Michel Habib; Juraj Stacho (Electron. Notes Discret. Math., 2009)

A Decomposition Theorem for Chordal Graphs and its Applications. - Michel Habib; Juraj Stacho (Electron. Notes Discret. Math., 2009)

Unique perfect phylogeny is NP-hard - Michel Habib; Juraj Stacho (CoRR, 2010)

Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time - Michel Habib; Thu-Hien To (CoRR, 2010)

A survey of the algorithmic aspects of modular decomposition. - Michel Habib; Christophe Paul (Comput. Sci. Rev., 2010)

Unique Perfect Phylogeny Is NP-Hard. - Michel Habib; Juraj Stacho (CPM, 2011)

On a Conjecture about Compatibility of Multi-states Characters. - Michel Habib; Thu-Hien To (WABI, 2011)

On a conjecture of compatibility of multi-states characters - Michel Habib; Thu-Hien To (CoRR, 2011)

Complexity issues for the sandwich homogeneous set problem. - Arnaud Durand 001; Michel Habib (Discret. Appl. Math., 2011)

Algorithms for Some H-Join Decompositions. - Michel Habib; Antoine Mamcarz; Fabien de Montgolfier (LATIN, 2012)

Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. - Victor Chepoi; Feodor F. Dragan; Bertrand Estellon; Michel Habib; Yann Vaxès; Yang Xiang (Algorithmica, 2012)

Polynomial-time recognition of clique-width ≤3 graphs. - Derek G. Corneil; Michel Habib; Jean-Marc Lanlignel; Bruce A. Reed; Udi Rotics (Discret. Appl. Math., 2012)

Tree-representation of set families and applications to combinatorial decompositions. - Binh-Minh Bui-Xuan; Michel Habib; Michaël Rao (Eur. J. Comb., 2012)

Reduced clique graphs of chordal graphs. - Michel Habib; Juraj Stacho (Eur. J. Comb., 2012)

Constructing a Minimum phylogenetic Network from a Dense triplet Set. - Michel Habib; Thu-Hien To (J. Bioinform. Comput. Biol., 2012)

Detecting 2-joins faster. - Pierre Charbit; Michel Habib; Nicolas Trotignon; Kristina Vuskovic (J. Discrete Algorithms, 2012)

A general method for common intervals. - Ismael Belghiti; Michel Habib (CoRR, 2013)

The Arboreal Jump Number of an Order. - Adriana P. Figueiredo; Michel Habib; Sulamita Klein; Jayme Luiz Szwarcfiter (Order, 2013)

LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. - Derek G. Corneil; Barnaby Dalton; Michel Habib (SIAM J. Comput., 2013)

On computing the diameter of real-world undirected graphs. - Pilu Crescenzi; Roberto Grossi; Michel Habib; Leonardo Lanzi; Andrea Marino 001 (Theor. Comput. Sci., 2013)

Unique perfect phylogeny is intractable. - Michel Habib; Juraj Stacho (Theor. Comput. Sci., 2013)

On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. - Michele Borassi; Pierluigi Crescenzi; Michel Habib; Walter A. Kosters; Andrea Marino 001; Frank W. Takes (FUN, 2014)

Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs. - Michel Habib; Antoine Mamcarz (WG, 2014)

Computing H-Joins with Application to 2-Modular Decomposition. - Michel Habib; Antoine Mamcarz; Fabien de Montgolfier (Algorithmica, 2014)

Into the Square - On the Complexity of Quadratic-Time Solvable Problems. - Michele Borassi; Pierluigi Crescenzi; Michel Habib (CoRR, 2014)

Influence of the tie-break rule on the end-vertex problem. - Pierre Charbit; Michel Habib; Antoine Mamcarz (Discret. Math. Theor. Comput. Sci., 2014)

A tie-break model for graph search. - Derek G. Corneil; Jérémie Dusart; Michel Habib; Fabien de Montgolfier (CoRR, 2015)

Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. - Michele Borassi; Pierluigi Crescenzi; Michel Habib (ICTCS, 2015)

Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. - Michele Borassi; Pierluigi Crescenzi; Michel Habib; Walter A. Kosters; Andrea Marino 001; Frank W. Takes (Theor. Comput. Sci., 2015)

Maximal cliques structure for cocomparability graphs and applications. - Jérémie Dusart; Michel Habib; Derek G. Corneil (CoRR, 2016)

Read networks and k-laminar graphs. - Finn Völkel; Eric Bapteste; Michel Habib; Philippe Lopez; Chloe Vigliotti (CoRR, 2016)

Algorithmic aspects of switch cographs. - Vincent Cohen-Addad; Michel Habib; Fabien de Montgolfier (Discret. Appl. Math., 2016)

A tie-break model for graph search. - Derek G. Corneil; Jérémie Dusart; Michel Habib; Antoine Mamcarz; Fabien de Montgolfier (Discret. Appl. Math., 2016)

Preface. - Mourad Baïou; Michel Habib; Lhouari Nourine (RAIRO Oper. Res., 2016)

On the Power of Graph Searching for Cocomparability Graphs. - Derek G. Corneil; Jérémie Dusart; Michel Habib; Ekkehard Köhler (SIAM J. Discret. Math., 2016)

Unified View of Graph Searching and LDFS-Based Certifying Algorithms. - Derek G. Corneil; Michel Habib (Encyclopedia of Algorithms, 2016)

Towards A Unified View of Linear Structure on Graph Classes. - Pierre Charbit; Michel Habib; Lalla Mouatadid; Reza Naserasr (CoRR, 2017)

A new LBFS-based algorithm for cocomparability graph recognition. - Jérémie Dusart; Michel Habib (Discret. Appl. Math., 2017)

Fast Approximation of Centrality and Distances in Hyperbolic Graphs. - Victor Chepoi; Feodor F. Dragan; Michel Habib; Yann Vaxès; Hend Alrasheed (COCOA, 2018)

Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. - Feodor F. Dragan; Michel Habib; Laurent Viennot (CoRR, 2018)

Representation of lattices via set-colored posets. - Michel Habib; Lhouari Nourine (Discret. Appl. Math., 2018)

A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. - Michel Habib; Fabien de Montgolfier; Lalla Mouatadid; Mengchuan Zou (IWOCA, 2019)

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (CoRR, 2019)

Fast approximation of eccentricities and distances in hyperbolic graphs. - Victor Chepoi; Feodor F. Dragan; Michel Habib; Yann Vaxès; Hend Alrasheed (J. Graph Algorithms Appl., 2019)

When an optimal dominating set with given constraints exists. - Omid Etesami; Narges Ghareghani; Michel Habib; Mohammad Reza Hooshmandasl; Reza Naserasr; Pouyeh Sharifani (Theor. Comput. Sci., 2019)

Approximating Modular Decomposition Is Hard. - Michel Habib; Lalla Mouatadid; Mengchuan Zou (CALDAM, 2020)

Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (SODA, 2020)

Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. - Michel Habib; Lalla Mouatadid (Algorithmica, 2020)

Diameter in linear time for constant-dimension median graphs. - Pierre Bergé; Michel Habib (LAGOS, 2021)

(α, β)-Modules in Graphs. - Michel Habib; Lalla Mouatadid; Éric Sopena; Mengchuan Zou (CoRR, 2021)

Diameter, radius and all eccentricities in linear time for constant-dimension median graphs. - Pierre Bergé; Michel Habib (CoRR, 2021)

Classifying grounded intersection graphs via ordered forbidden patterns. - Laurent Feuilloley; Michel Habib (CoRR, 2021)

Fast Diameter Computation within Split Graphs. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (Discret. Math. Theor. Comput. Sci., 2021)

Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. - Jérémie Dusart; Derek G. Corneil; Michel Habib (SIAM J. Comput., 2021)

Graph Classes and Forbidden Patterns on Three Vertices. - Laurent Feuilloley; Michel Habib (SIAM J. Discret. Math., 2021)

Guiding Random Walks by Effective Resistance for Effective Node Embedding. - Abderaouf Gacem; Mohammed Haddad 001; Hamida Seba; Gaétan Berthe; Michel Habib (ICPRAI (1), 2022)

Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension. - Guillaume Ducoffe; Michel Habib; Laurent Viennot (SIAM J. Comput., 2022)

Connectivity for some families of composition networks. - Hong Chen; Meirun Chen; Michel Habib; Cheng-Kuan Lin (Theor. Comput. Sci., 2022)

A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs. - Michel Habib; Fabien de Montgolfier; Lalla Mouatadid; Mengchuan Zou (Theor. Comput. Sci., 2022)

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor. - Michel Habib; Minh-Hang Nguyen; Mikaël Rabie; Laurent Viennot (SSS, 2023)

Pattern detection in ordered graphs. - Guillaume Ducoffe; Laurent Feuilloley; Michel Habib; François Pitois (CoRR, 2023)

Diagnosability for a family of matching composition networks. - Meirun Chen; Michel Habib; Cheng-Kuan Lin (J. Supercomput., 2023)

A new graph parameter to measure linearity. - Pierre Charbit; Michel Habib; Lalla Mouatadid; Reza Naserasr (J. Graph Theory, 2023)

A novel edge connectivity based on edge partition for hypercube and folded hypercube. - Meirun Chen; Michel Habib; Cheng-Kuan Lin (Appl. Math. Comput., 2024)

Bow Metrics and Hyperbolicity. - Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Laurent Viennot (CoRR, 2024)

Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs. - Pierre Bergé; Guillaume Ducoffe; Michel Habib (Theory Comput. Syst., 2024)

( boldsymbol{( alpha, beta )} )-Modules in Graphs. - Michel Habib; Lalla Mouatadid; Éric Sopena; Mengchuan Zou (SIAM J. Discret. Math., 2024)

Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications. - Jérémie Dusart; Michel Habib; Derek G. Corneil (Order, 2024)

Quasilinear-time eccentricities computation, and more, on median graphs. - Pierre Bergé; Guillaume Ducoffe; Michel Habib (SODA, 2025)

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. - Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Laurent Viennot (SODA, 2025)

Forbidden patterns in temporal graphs resulting from encounters in a corridor. - Mónika Csikós; Michel Habib; Minh-Hang Nguyen; Mikaël Rabie; Laurent Viennot (J. Comput. Syst. Sci., 2025)

On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs. - Guillaume Aubian; Filippo Brunelli; Feodor F. Dragan; Guillaume Ducoffe; Michel Habib; Allen Ibiapina; Laurent Viennot (CoRR, 2025)