 | 2009 |
|---|
| 71 |       | Thu-Hien To,
Michel Habib:
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time.
CPM 2009: 275-288 |
| 70 | | Michel Habib:
Diameter and Center Computations in Networks.
CTW 2009: 257-258 |
| 69 | | Michel Habib,
Juraj Stacho:
Polynomial-Time Algorithm for the Leafage of Chordal Graphs.
ESA 2009: 290-300 |
| 68 | | Michel Habib,
Vincent Limouzy:
On some simplicial elimination schemes for chordal graphs
CoRR abs/0901.2645: (2009) |
| 67 | | Clémence Magnien,
Matthieu Latapy,
Michel Habib:
Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs
CoRR abs/0904.2728: (2009) |
| 66 | | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
Algorithmic aspects of a general modular decomposition theory.
Discrete Applied Mathematics 157(9): 1993-2009 (2009) |
| 65 | | Michel Habib,
Vincent Limouzy:
On some simplicial elimination schemes for chordal graphs.
Electronic Notes in Discrete Mathematics 32: 125-132 (2009) |
| 64 | | Michel Habib,
Juraj Stacho:
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage.
Electronic Notes in Discrete Mathematics 32: 99-108 (2009) |
| 2008 |
|---|
| 63 | | Marc Tedder,
Derek G. Corneil,
Michel Habib,
Christophe Paul:
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations.
ICALP (1) 2008: 634-645 |
| 62 | | Binh-Minh Bui-Xuan,
Michel Habib:
A Representation Theorem for Union-Difference Families and Application.
LATIN 2008: 492-503 |
| 61 | | Victor Chepoi,
Feodor F. Dragan,
Bertrand Estellon,
Michel Habib,
Yann Vaxès:
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs.
Symposium on Computational Geometry 2008: 59-68 |
| 60 | | Clémence Magnien,
Matthieu Latapy,
Michel Habib:
Fast computation of empirically tight bounds for the diameter of massive graphs.
ACM Journal of Experimental Algorithmics 13: (2008) |
| 59 | | Victor Chepoi,
Feodor F. Dragan,
Bertrand Estellon,
Michel Habib,
Yann Vaxès:
Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs.
Electronic Notes in Discrete Mathematics 31: 231-234 (2008) |
| 58 | | Pierre Charbit,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier,
Mathieu Raffinot,
Michaël Rao:
A note on computing set overlap classes.
Inf. Process. Lett. 108(4): 186-191 (2008) |
| 57 | | Binh-Minh Bui-Xuan,
Michel Habib,
Christophe Paul:
Competitive graph searches.
Theor. Comput. Sci. 393(1-3): 72-80 (2008) |
| 2007 |
|---|
| 56 | | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
Unifying Two Graph Decompositions with Modular Decomposition.
ISAAC 2007: 52-64 |
| 55 | | Marc Tedder,
Derek G. Corneil,
Michel Habib,
Christophe Paul:
Simple, linear-time modular decomposition
CoRR abs/0710.3901: (2007) |
| 54 | | Pierre Charbit,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier,
Mathieu Raffinot,
Michaël Rao:
A Note On Computing Set Overlap Classes
CoRR abs/0711.4573: (2007) |
| 53 | | Michel Habib,
David Kelly,
Emmanuelle Lebhar,
Christophe Paul:
Can transitive orientation make sandwich problems easier?
Discrete Mathematics 307(16): 2030-2041 (2007) |
| 52 | | Maria Patricia Dobson,
Marisa Gutierrez,
Michel Habib,
Jayme Luiz Szwarcfiter:
On transitive orientations with restricted covering graphs.
Inf. Process. Lett. 101(3): 119-125 (2007) |
| 2006 |
|---|
| 51 | | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms.
WG 2006: 278-288 |
| 50 | | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
Homogeneity vs. Adjacency: generalising some graph decomposition algorithms
CoRR abs/cs/0603048: (2006) |
| 49 | | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
Unifying two Graph Decompositions with Modular Decomposition
CoRR abs/cs/0604065: (2006) |
| 48 | | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
Algorithmic Aspects of a Novel Modular Decomposition Theory
CoRR abs/cs/0611019: (2006) |
| 47 | | Binh-Minh Bui-Xuan,
Michel Habib,
Vincent Limouzy,
Fabien de Montgolfier:
On Modular Decomposition Concepts: the case for Homogeneous Relations.
Electronic Notes in Discrete Mathematics 27: 13-14 (2006) |
| 46 | | Volker Diekert,
Michel Habib:
Foreword.
Theory Comput. Syst. 39(1): 1 (2006) |
| 2005 |
|---|
| 45 | | Binh-Minh Bui-Xuan,
Michel Habib,
Christophe Paul:
Revisiting T. Uno and M. Yagiura's Algorithm .
ISAAC 2005: 146-155 |
| 44 | | Michel Habib,
Christophe Paul:
A simple linear time algorithm for cograph recognition.
Discrete Applied Mathematics 145(2): 183-197 (2005) |
| 43 | | Michel Habib,
Lhouari Nourine:
The number of Moore families on n=6.
Discrete Mathematics 294(3): 291-296 (2005) |
| 2004 |
|---|
| 42 |  | Volker Diekert,
Michel Habib:
STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings
Springer 2004 |
| 41 | | Michel Habib,
Christophe Paul,
Mathieu Raffinot:
Maximal Common Connected Sets of Interval Graphs.
CPM 2004: 359-372 |
| 40 | | Michel Habib,
Fabien de Montgolfier,
Christophe Paul:
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension.
SWAT 2004: 187-198 |
| 39 | | Jean-Luc Fouquet,
Michel Habib,
Fabien de Montgolfier,
Jean-Marie Vanherpe:
Bimodular Decomposition of Bipartite Graphs.
WG 2004: 117-128 |
| 38 | | Michel Habib,
Lhouari Nourine,
Olivier Raynaud,
Eric Thierry:
Computational aspects of the 2-dimension of partially ordered sets.
Theor. Comput. Sci. 312(2-3): 401-431 (2004) |
| 2003 |
|---|
| 37 | | Helmut Alt,
Michel Habib:
STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings
Springer 2003 |
| 36 | | Anna Bretscher,
Derek G. Corneil,
Michel Habib,
Christophe Paul:
A Simple Linear Time LexBFS Cograph Recognition Algorithm.
WG 2003: 119-130 |
| 35 | | Michel Habib,
Emmanuelle Lebhar,
Christophe Paul:
A note on finding all homogeneous set sandwiches.
Inf. Process. Lett. 87(3): 147-151 (2003) |
| 2002 |
|---|
| 34 | | Christian Capelle,
Michel Habib,
Fabien de Montgolfier:
Graph Decompositions andFactorizing Permutations.
Discrete Mathematics & Theoretical Computer Science 5(1): 55-70 (2002) |
| 2001 |
|---|
| 33 | | Michel Habib,
Raoul Medina,
Lhouari Nourine,
George Steiner:
Efficient algorithms on distributive lattices.
Discrete Applied Mathematics 110(2-3): 169-187 (2001) |
| 32 | | Derek G. Corneil,
Feodor F. Dragan,
Michel Habib,
Christophe Paul:
Diameter determination on restricted graph families.
Discrete Applied Mathematics 113(2-3): 143-166 (2001) |
| 31 | | Michel Habib,
Christophe Paul,
Laurent Viennot:
Linear time recognition of P4-indifference graphs.
Discrete Mathematics & Theoretical Computer Science 4(2): 173-178 (2001) |
| 30 | | Guillaume Damiand,
Michel Habib,
Christophe Paul:
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs.
Theor. Comput. Sci. 263(1-2): 99-111 (2001) |
| 2000 |
|---|
| 29 | | Derek G. Corneil,
Michel Habib,
Jean-Marc Lanlignel,
Bruce A. Reed,
Udi Rotics:
Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract).
LATIN 2000: 126-134 |
| 28 | | Michel Habib,
Ross M. McConnell,
Christophe Paul,
Laurent Viennot:
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing.
Theor. Comput. Sci. 234(1-2): 59-84 (2000) |
| 1999 |
|---|
| 27 | | Yves Caseau,
Michel Habib,
Lhouari Nourine,
Olivier Raynaud:
Encoding of Multiple Inheritance Hierarchies and Partial Orders.
Computational Intelligence 15: 50-62 (1999) |
| 26 | | Michel Habib,
Christophe Paul,
Laurent Viennot:
Partition Refinement Techniques: An Interesting Algorithmic Tool Kit.
Int. J. Found. Comput. Sci. 10(2): 147-170 (1999) |
| 1998 |
|---|
| 25 | | Michel Habib,
Christophe Paul,
Laurent Viennot:
A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata.
STACS 1998: 25-38 |
| 24 | | Derek G. Corneil,
Feodor F. Dragan,
Michel Habib,
Christophe Paul:
Diameter Determination on Restricted Graph Faminlies.
WG 1998: 192-202 |
| 1997 |
|---|
| 23 | | Christian Capelle,
Michel Habib:
Graph decompositions and factorizing permutations.
ISTCS 1997: 132-143 |
| 22 | | Michel Habib,
Lhouari Nourine,
George Steiner:
Gray Codes for the Ideals of Interval Orders.
J. Algorithms 25(1): 52-66 (1997) |
| 21 | | Vincent Bouchitté,
Michel Habib,
Michel Morvan:
Preface: Orders, Algorithms and Applications.
Theor. Comput. Sci. 175(2): 223 (1997) |
| 1996 |
|---|
| 20 | | Michel Habib,
Lhouari Nourine:
Tree Structure for Distributive Lattices and its Applications.
Theor. Comput. Sci. 165(2): 391-405 (1996) |
| 1995 |
|---|
| 19 | | Philippe Galinier,
Michel Habib,
Christophe Paul:
Chordal Graphs and Their Clique Graphs.
WG 1995: 358-371 |
| 18 | | Michel Habib,
Marianne Huchard,
Jeremy Spinrad:
A Linear Algorithm To Decompose Inheritance Graphs Into Modules.
Algorithmica 13(6): 573-591 (1995) |
| 1994 |
|---|
| 17 | | Alain Cournier,
Michel Habib:
A New Linear Algorithm for Modular Decomposition.
CAAP 1994: 68-84 |
| 16 | | Roland Ducournau,
Michel Habib,
Marianne Huchard,
Marie-Laure Mugnier:
Proposal for a Monotonic Multiple Inheritance Linearization.
OOPSLA 1994: 164-175 |
| 15 | | Michel Habib,
Lhouari Nourine:
Bit-Vector Encoding for Partially Ordered Sets.
ORDAL 1994: 1-12 |
| 14 | | Stefan Felsner,
Michel Habib,
Rolf H. Möhring:
On the Interplay Between Interval Dimension and Dimension.
SIAM J. Discrete Math. 7(1): 32-40 (1994) |
| 1993 |
|---|
| 13 | | Michel Habib,
Michel Morvan,
Jean-Xavier Rampon:
On the calculation of transitive reduction - closure of orders.
Discrete Mathematics 111(1-3): 289-303 (1993) |
| 1992 |
|---|
| 12 | | Roland Ducournau,
Michel Habib,
Marianne Huchard,
Marie-Laure Mugnier:
Monotonic Conflict Resolution Mechanisms for Inheritance.
OOPSLA 1992: 16-24 |
| 11 | | Alain Cournier,
Michel Habib:
An Efficient Algorithm to Recognize Prime Undirected Graphs.
WG 1992: 212-224 |
| 1991 |
|---|
| 10 | | Michel Habib,
David Kelly,
Rolf H. Möhring:
Interval dimension is a comparability invariant.
Discrete Mathematics 88(2-3): 211-229 (1991) |
| 1990 |
|---|
| 9 | | Michel Habib,
Michel Morvan,
Jean-Xavier Rampon:
Remarks on Some Concurrency Measures.
WG 1990: 221-238 |
| 1987 |
|---|
| 8 | | Roland Ducournau,
Michel Habib:
On Some Algorithms for Multiple Inheritance in Object-Oriented Programming.
ECOOP 1987: 243-252 |
| 7 | | Michel Habib,
Rolf H. Möhring:
On some complexity properties of N-free posets and posets with bounded decomposition diameter.
Discrete Mathematics 63(2-3): 157-182 (1987) |
| 1986 |
|---|
| 6 | | M. Dao,
Michel Habib,
J. P. Richard,
D. Tallot:
CABRI, An Interactive System for Graph Manipulation.
WG 1986: 58-67 |
| 1985 |
|---|
| 5 | | Michel Habib,
M. C. Maurer:
1-Intersecting families.
Discrete Mathematics 53: 91-101 (1985) |
| 1984 |
|---|
| 4 | | Jean-Claude Bermond,
Jean-Luc Fouquet,
Michel Habib,
Bernard Péroche:
On linear k-arboricity.
Discrete Mathematics 52(2-3): 123-132 (1984) |
| 1982 |
|---|
| 3 | | Michel Habib,
Bernard Péroche:
Some problems about linear arboricity.
Discrete Mathematics 41(2): 219-220 (1982) |
| 1981 |
|---|
| 2 | | M. Chein,
Michel Habib,
M. C. Maurer:
Partitive hypergraphs.
Discrete Mathematics 37(1): 35-50 (1981) |
| 1979 |
|---|
| 1 | | Olivier Cogis,
Michel Habib:
Nombre de sauts et graphes série-parallèles.
ITA 13(1): (1979) |
