Michel Habib - RankMe

167 papers A* 3A 9B 19C 7Misc 1Journal 116Unranked 11

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. Algorithmica Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot
2026	J	`jnl`	Correction: Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. Algorithmica Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot
2025	A*	`conf`	Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs. SODA Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot
2025	J	`jnl`	Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs. CoRR Pierre Charbit, Michel Habib, Amalia Sorondo
2025	J	`jnl`	Forbidden patterns in temporal graphs resulting from encounters in a corridor. J. Comput. Syst. Sci. Mónika Csikós, Michel Habib, Minh-Hang Nguyen, Mikaël Rabie, Laurent Viennot
2025	J	`jnl`	On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs. CoRR Guillaume Aubian, Filippo Brunelli, Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Allen Ibiapina, Laurent Viennot
2025	A*	`conf`	Quasilinear-time eccentricities computation, and more, on median graphs. SODA Pierre Bergé, Guillaume Ducoffe, Michel Habib
2024	J	`jnl`	A novel edge connectivity based on edge partition for hypercube and folded hypercube. Appl. Math. Comput. Meirun Chen, Michel Habib, Cheng-Kuan Lin
2024	J	`jnl`	Bow Metrics and Hyperbolicity. CoRR Feodor F. Dragan, Guillaume Ducoffe, Michel Habib, Laurent Viennot
2024	J	`jnl`	Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications. Order Jérémie Dusart, Michel Habib, Derek G. Corneil
2024	J	`jnl`	Quasilinear-time eccentricities computation, and more, on median graphs. CoRR Pierre Bergé, Guillaume Ducoffe, Michel Habib
2024	J	`jnl`	Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs. Theory Comput. Syst. Pierre Bergé, Guillaume Ducoffe, Michel Habib
2024	J	`jnl`	\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs. SIAM J. Discret. Math. Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou
2023	J	`jnl`	A new graph parameter to measure linearity. J. Graph Theory Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
2023	J	`jnl`	Diagnosability for a family of matching composition networks. J. Supercomput. Meirun Chen, Michel Habib, Cheng-Kuan Lin
2023	C	`conf`	Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor. SSS Michel Habib, Minh-Hang Nguyen, Mikaël Rabie, Laurent Viennot
2023	J	`jnl`	Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor. CoRR Michel Habib, Minh-Hang Nguyen, Mikaël Rabie, Laurent Viennot
2023	J	`jnl`	Pattern detection in ordered graphs. CoRR Guillaume Ducoffe, Laurent Feuilloley, Michel Habib, François Pitois
2022	J	`jnl`	A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs. Theor. Comput. Sci. Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou
2022	J	`jnl`	Connectivity for some families of composition networks. Theor. Comput. Sci. Hong Chen, Meirun Chen, Michel Habib, Cheng-Kuan Lin
2022	J	`jnl`	Diameter, Eccentricities and Distance Oracle Computations on SIAM J. Comput. Guillaume Ducoffe, Michel Habib, Laurent Viennot
2022	—	`conf`	Guiding Random Walks by Effective Resistance for Effective Node Embedding. ICPRAI (1) Abderaouf Gacem, Mohammed Haddad, Hamida Seba, Gaétan Berthe, Michel Habib
2022	A	`conf`	Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs. STACS Pierre Bergé, Guillaume Ducoffe, Michel Habib
2021	J	`jnl`	(α, β)-Modules in Graphs. CoRR Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou
2021	J	`jnl`	Classifying grounded intersection graphs via ordered forbidden patterns. CoRR Laurent Feuilloley, Michel Habib
2021	J	`jnl`	Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. SIAM J. Comput. Jérémie Dusart, Derek G. Corneil, Michel Habib
2021	C	`conf`	Diameter in linear time for constant-dimension median graphs. LAGOS Pierre Bergé, Michel Habib
2021	J	`jnl`	Diameter, radius and all eccentricities in linear time for constant-dimension median graphs. CoRR Pierre Bergé, Michel Habib
2021	J	`jnl`	Fast Diameter Computation within Split Graphs. Discret. Math. Theor. Comput. Sci. Guillaume Ducoffe, Michel Habib, Laurent Viennot
2021	J	`jnl`	Graph Classes and Forbidden Patterns on Three Vertices. SIAM J. Discret. Math. Laurent Feuilloley, Michel Habib
2021	J	`jnl`	Subquadratic-time algorithm for the diameter and all eccentricities on median graphs. CoRR Pierre Bergé, Guillaume Ducoffe, Michel Habib
2020	—	`conf`	Approximating Modular Decomposition Is Hard. CALDAM Michel Habib, Lalla Mouatadid, Mengchuan Zou
2020	A*	`conf`	Diameter computation on SODA Guillaume Ducoffe, Michel Habib, Laurent Viennot
2020	J	`jnl`	Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. Algorithmica Michel Habib, Lalla Mouatadid
2019	C	`conf`	A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. IWOCA Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou
2019	J	`jnl`	Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. CoRR Guillaume Ducoffe, Michel Habib, Laurent Viennot
2019	C	`conf`	Fast Diameter Computation Within Split Graphs. COCOA Guillaume Ducoffe, Michel Habib, Laurent Viennot
2019	J	`jnl`	Fast Diameter Computation within Split Graphs. CoRR Guillaume Ducoffe, Michel Habib, Laurent Viennot
2019	J	`jnl`	Fast approximation of eccentricities and distances in hyperbolic graphs. J. Graph Algorithms Appl. Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
2019	J	`jnl`	When an optimal dominating set with given constraints exists. Theor. Comput. Sci. Omid Etesami, Narges Ghareghani, Michel Habib, Mohammad Reza Hooshmandasl, Reza Naserasr, Pouyeh Sharifani
2018	C	`conf`	Fast Approximation of Centrality and Distances in Hyperbolic Graphs. COCOA Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Alrasheed
2018	J	`jnl`	Fast approximation of centrality and distances in hyperbolic graphs. CoRR Victor Chepoi, Feodor F. Dragan, Michel Habib, Yann Vaxès, Hend Al-Rasheed
2018	J	`jnl`	Graph classes and forbidden patterns on three vertices. CoRR Laurent Feuilloley, Michel Habib
2018	J	`jnl`	Representation of lattices via set-colored posets. Discret. Appl. Math. Michel Habib, Lhouari Nourine
2018	J	`jnl`	Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates. CoRR Feodor F. Dragan, Michel Habib, Laurent Viennot
2017	—	`conf`	A New Graph Parameter to Measure Linearity. COCOA (2) Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
2017	J	`jnl`	A new LBFS-based algorithm for cocomparability graph recognition. Discret. Appl. Math. Jérémie Dusart, Michel Habib
2017	B	`conf`	Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. ISAAC Michel Habib, Lalla Mouatadid
2017	J	`jnl`	Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. CoRR Michel Habib, Lalla Mouatadid
2017	J	`jnl`	Towards A Unified View of Linear Structure on Graph Classes. CoRR Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
2016	J	`jnl`	A tie-break model for graph search. Discret. Appl. Math. Derek G. Corneil, Jérémie Dusart, Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
2016	J	`jnl`	Algorithmic aspects of switch cographs. Discret. Appl. Math. Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier
2016	J	`jnl`	Maximal cliques structure for cocomparability graphs and applications. CoRR Jérémie Dusart, Michel Habib, Derek G. Corneil
2016	J	`jnl`	On the Power of Graph Searching for Cocomparability Graphs. SIAM J. Discret. Math. Derek G. Corneil, Jérémie Dusart, Michel Habib, Ekkehard Köhler
2016	J	`jnl`	Preface. RAIRO Oper. Res. Mourad Baïou, Michel Habib, Lhouari Nourine
2016	J	`jnl`	Read networks and k-laminar graphs. CoRR Finn Völkel, Eric Bapteste, Michel Habib, Philippe Lopez, Chloe Vigliotti
2016	—	`ch.`	Unified View of Graph Searching and LDFS-Based Certifying Algorithms. Encyclopedia of Algorithms Derek G. Corneil, Michel Habib
2015	J	`jnl`	A tie-break model for graph search. CoRR Derek G. Corneil, Jérémie Dusart, Michel Habib, Fabien de Montgolfier
2015	J	`jnl`	Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games. Theor. Comput. Sci. Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
2015	—	`conf`	Into the Square: On the Complexity of Some Quadratic-time Solvable Problems. ICTCS Michele Borassi, Pierluigi Crescenzi, Michel Habib
2014	B	`conf`	Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs. WG Michel Habib, Antoine Mamcarz
2014	J	`jnl`	Computing H-Joins with Application to 2-Modular Decomposition. Algorithmica Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
2014	J	`jnl`	Influence of the tie-break rule on the end-vertex problem. Discret. Math. Theor. Comput. Sci. Pierre Charbit, Michel Habib, Antoine Mamcarz
2014	J	`jnl`	Into the Square - On the Complexity of Quadratic-Time Solvable Problems. CoRR Michele Borassi, Pierluigi Crescenzi, Michel Habib
2014	Misc	`conf`	On the Solvability of the Six Degrees of Kevin Bacon Game - A Faster Graph Diameter and Radius Computation Method. FUN Michele Borassi, Pierluigi Crescenzi, Michel Habib, Walter A. Kosters, Andrea Marino, Frank W. Takes
2013	J	`jnl`	A general method for common intervals. CoRR Ismael Belghiti, Michel Habib
2013	J	`jnl`	Algorithmic Aspects of Switch Cographs. CoRR Vincent Cohen-Addad, Michel Habib, Fabien de Montgolfier
2013	J	`jnl`	LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. SIAM J. Comput. Derek G. Corneil, Barnaby Dalton, Michel Habib
2013	J	`jnl`	On computing the diameter of real-world undirected graphs. Theor. Comput. Sci. Pilu Crescenzi, Roberto Grossi, Michel Habib, Leonardo Lanzi, Andrea Marino
2013	J	`jnl`	The Arboreal Jump Number of an Order. Order Adriana P. Figueiredo, Michel Habib, Sulamita Klein, Jayme Luiz Szwarcfiter
2013	J	`jnl`	Unique perfect phylogeny is intractable. Theor. Comput. Sci. Michel Habib, Juraj Stacho
2012	J	`jnl`	Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Algorithmica Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang
2012	B	`conf`	Algorithms for Some H-Join Decompositions. LATIN Michel Habib, Antoine Mamcarz, Fabien de Montgolfier
2012	J	`jnl`	Constructing a Minimum phylogenetic Network from a Dense triplet Set. J. Bioinform. Comput. Biol. Michel Habib, Thu-Hien To
2012	J	`jnl`	Detecting 2-joins faster. J. Discrete Algorithms Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic
2012	J	`jnl`	Polynomial-time recognition of clique-width ≤3 graphs. Discret. Appl. Math. Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics
2012	J	`jnl`	Reduced clique graphs of chordal graphs. Eur. J. Comb. Michel Habib, Juraj Stacho
2012	J	`jnl`	Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao
2011	J	`jnl`	Complexity issues for the sandwich homogeneous set problem. Discret. Appl. Math. Arnaud Durand, Michel Habib
2011	J	`jnl`	Detecting 2-joins faster CoRR Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic
2011	C	`conf`	On a Conjecture about Compatibility of Multi-states Characters. WABI Michel Habib, Thu-Hien To
2011	J	`jnl`	On a conjecture of compatibility of multi-states characters CoRR Michel Habib, Thu-Hien To
2011	B	`conf`	Unique Perfect Phylogeny Is CPM Michel Habib, Juraj Stacho
2010	J	`jnl`	A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. Michel Habib, Christophe Paul
2010	B	`ed.`	Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers WG Christophe Paul, Michel Habib
2010	J	`jnl`	Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time CoRR Michel Habib, Thu-Hien To
2010	J	`jnl`	Unique perfect phylogeny is NP-hard CoRR Michel Habib, Juraj Stacho
2009	J	`jnl`	A Decomposition Theorem for Chordal Graphs and its Applications. Electron. Notes Discret. Math. Michel Habib, Juraj Stacho
2009	J	`jnl`	A survey on algorithmic aspects of modular decomposition CoRR Michel Habib, Christophe Paul
2009	J	`jnl`	Algorithmic aspects of a general modular decomposition theory. Discret. Appl. Math. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2009	C	`conf`	Diameter and Center Computations in Networks. CTW Michel Habib
2009	J	`jnl`	Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs CoRR Clémence Magnien, Matthieu Latapy, Michel Habib
2009	B	`conf`	Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time. CPM Thu-Hien To, Michel Habib
2009	J	`jnl`	Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage. Electron. Notes Discret. Math. Michel Habib, Juraj Stacho
2009	J	`jnl`	On some simplicial elimination schemes for chordal graphs CoRR Michel Habib, Vincent Limouzy
2009	J	`jnl`	On some simplicial elimination schemes for chordal graphs. Electron. Notes Discret. Math. Michel Habib, Vincent Limouzy
2009	A	`conf`	Polynomial-Time Algorithm for the Leafage of Chordal Graphs. ESA Michel Habib, Juraj Stacho
2009	J	`jnl`	Unifying the representation of symmetric crossing families and weakly partitive families. Electron. Notes Discret. Math. Binh-Minh Bui-Xuan, Michel Habib
2008	B	`conf`	A Representation Theorem for Union-Difference Families and Application. LATIN Binh-Minh Bui-Xuan, Michel Habib
2008	J	`jnl`	A Simple Linear Time LexBFS Cograph Recognition Algorithm. SIAM J. Discret. Math. Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
2008	J	`jnl`	A note on computing set overlap classes. Inf. Process. Lett. Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
2008	J	`jnl`	Competitive graph searches. Theor. Comput. Sci. Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
2008	—	`conf`	Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. SCG Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès
2008	J	`jnl`	Fast computation of empirically tight bounds for the diameter of massive graphs. ACM J. Exp. Algorithmics Clémence Magnien, Matthieu Latapy, Michel Habib
2008	J	`jnl`	Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. Electron. Notes Discret. Math. Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès
2008	—	`conf`	Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
2007	J	`jnl`	A Note On Computing Set Overlap Classes CoRR Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
2007	J	`jnl`	Can transitive orientation make sandwich problems easier? Discret. Math. Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul
2007	J	`jnl`	On transitive orientations with restricted covering graphs. Inf. Process. Lett. Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter
2007	J	`jnl`	Simple, linear-time modular decomposition CoRR Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
2007	B	`conf`	Unifying Two Graph Decompositions with Modular Decomposition. ISAAC Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	Algorithmic Aspects of a Novel Modular Decomposition Theory CoRR Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	Foreword. Theory Comput. Syst. Volker Diekert, Michel Habib
2006	B	`conf`	Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	Homogeneity vs. Adjacency: generalising some graph decomposition algorithms CoRR Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	On Modular Decomposition Concepts: the case for Homogeneous Relations. Electron. Notes Discret. Math. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2006	J	`jnl`	Unifying two Graph Decompositions with Modular Decomposition CoRR Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
2005	J	`jnl`	A simple linear time algorithm for cograph recognition. Discret. Appl. Math. Michel Habib, Christophe Paul
2005	B	`conf`	Revisiting T. Uno and M. Yagiura's Algorithm . ISAAC Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
2005	J	`jnl`	The number of Moore families on Discret. Math. Michel Habib, Lhouari Nourine
2004	—	`conf`	A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. SWAT Michel Habib, Fabien de Montgolfier, Christophe Paul
2004	B	`conf`	Bimodular Decomposition of Bipartite Graphs. WG Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe
2004	J	`jnl`	Computational aspects of the 2-dimension of partially ordered sets. Theor. Comput. Sci. Michel Habib, Lhouari Nourine, Olivier Raynaud, Eric Thierry
2004	B	`conf`	Maximal Common Connected Sets of Interval Graphs. CPM Michel Habib, Christophe Paul, Mathieu Raffinot
2004	A	`ed.`	STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings STACS Volker Diekert, Michel Habib
2003	B	`conf`	A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
2003	J	`jnl`	A note on finding all homogeneous set sandwiches. Inf. Process. Lett. Michel Habib, Emmanuelle Lebhar, Christophe Paul
2003	A	`ed.`	STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings STACS Helmut Alt, Michel Habib
2002	J	`jnl`	Graph Decompositions andFactorizing Permutations. Discret. Math. Theor. Comput. Sci. Christian Capelle, Michel Habib, Fabien de Montgolfier
2002	A	`conf`	The perception of stop consonant sequences in dyslexic and normal children. INTERSPEECH Noël Nguyen, Ludovic Jankowski, Michel Habib
2001	J	`jnl`	A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. Theor. Comput. Sci. Guillaume Damiand, Michel Habib, Christophe Paul
2001	J	`jnl`	Diameter determination on restricted graph families. Discret. Appl. Math. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
2001	J	`jnl`	Efficient algorithms on distributive lattices. Discret. Appl. Math. Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner
2001	J	`jnl`	Linear time recognition of P4-indifference graphs. Discret. Math. Theor. Comput. Sci. Michel Habib, Christophe Paul, Laurent Viennot
2000	J	`jnl`	Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot
2000	B	`conf`	Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract). LATIN Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics
1999	J	`jnl`	Encoding of Multiple Inheritance Hierarchies and Partial Orders. Comput. Intell. Yves Caseau, Michel Habib, Lhouari Nourine, Olivier Raynaud
1999	J	`jnl`	Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. Int. J. Found. Comput. Sci. Michel Habib, Christophe Paul, Laurent Viennot
1998	A	`conf`	A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. STACS Michel Habib, Christophe Paul, Laurent Viennot
1998	B	`conf`	Diameter Determination on Restricted Graph Faminlies. WG Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
1998	—	`conf`	Representation of stereochemistry using combinatorial maps. Discrete Mathematical Chemistry Andreas Dietz, Christophe Fiorio, Michel Habib, Claude Laurenço
1997	—	`conf`	Graph decompositions and factorizing permutations. ISTCS Christian Capelle, Michel Habib
1997	J	`jnl`	Gray Codes for the Ideals of Interval Orders. J. Algorithms Michel Habib, Lhouari Nourine, George Steiner
1997	J	`jnl`	Preface: Orders, Algorithms and Applications. Theor. Comput. Sci. Vincent Bouchitté, Michel Habib, Michel Morvan
1996	J	`jnl`	Tree Structure for Distributive Lattices and its Applications. Theor. Comput. Sci. Michel Habib, Lhouari Nourine
1995	J	`jnl`	A Linear Algorithm To Decompose Inheritance Graphs Into Modules. Algorithmica Michel Habib, Marianne Huchard, Jeremy P. Spinrad
1995	B	`conf`	Chordal Graphs and Their Clique Graphs. WG Philippe Galinier, Michel Habib, Christophe Paul
1994	—	`conf`	A New Linear Algorithm for Modular Decomposition. CAAP Alain Cournier, Michel Habib
1994	—	`conf`	Bit-Vector Encoding for Partially Ordered Sets. ORDAL Michel Habib, Lhouari Nourine
1994	J	`jnl`	On the Interplay Between Interval Dimension and Dimension. SIAM J. Discret. Math. Stefan Felsner, Michel Habib, Rolf H. Möhring
1994	A	`conf`	Proposal for a Monotonic Multiple Inheritance Linearization. OOPSLA Roland Ducournau, Michel Habib, Marianne Huchard, Marie-Laure Mugnier
1993	J	`jnl`	On the calculation of transitive reduction - closure of orders. Discret. Math. Michel Habib, Michel Morvan, Jean-Xavier Rampon
1992	B	`conf`	An Efficient Algorithm to Recognize Prime Undirected Graphs. WG Alain Cournier, Michel Habib
1992	A	`conf`	Monotonic Conflict Resolution Mechanisms for Inheritance. OOPSLA Roland Ducournau, Michel Habib, Marianne Huchard, Marie-Laure Mugnier
1991	J	`jnl`	Interval dimension is a comparability invariant. Discret. Math. Michel Habib, David Kelly, Rolf H. Möhring
1990	B	`conf`	Remarks on Some Concurrency Measures. WG Michel Habib, Michel Morvan, Jean-Xavier Rampon
1987	A	`conf`	On Some Algorithms for Multiple Inheritance in Object-Oriented Programming. ECOOP Roland Ducournau, Michel Habib
1987	J	`jnl`	On some complexity properties of N-free posets and posets with bounded decomposition diameter. Discret. Math. Michel Habib, Rolf H. Möhring
1986	B	`conf`	CABRI, An Interactive System for Graph Manipulation. WG M. Dao, Michel Habib, J. P. Richard, Didier Tallot
1985	J	`jnl`	1-Intersecting families. Discret. Math. Michel Habib, M. C. Maurer
1985	J	`jnl`	N-free posets as generalizations of series-parallel posets. Discret. Appl. Math. Michel Habib, Roland Jégou
1984	J	`jnl`	Jump number of dags having Dilworth number 2. Discret. Appl. Math. Michel Chein, Michel Habib
1984	J	`jnl`	On linear k-arboricity. Discret. Math. Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche
1982	J	`jnl`	Some problems about linear arboricity. Discret. Math. Michel Habib, Bernard Péroche
1981	J	`jnl`	Partitive hypergraphs. Discret. Math. Michel Chein, Michel Habib, M. C. Maurer
1979	J	`jnl`	Nombre de sauts et graphes série-parallèles. RAIRO Theor. Informatics Appl. Olivier Cogis, Michel Habib
1979	J	`jnl`	On the X-join decomposition for undirected graphs. Discret. Appl. Math. Michel Habib, M. C. Maurer