Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michel Habib
2010 – today
- 2013
[j49]Adriana P. Figueiredo, Michel Habib, Sulamita Klein, Jayme Luiz Szwarcfiter: The Arboreal Jump Number of an Order. Order 30(1): 339-350 (2013)- [j48]Michel Habib, Juraj Stacho: Unique perfect phylogeny is intractable. Theor. Comput. Sci. 476: 47-66 (2013)
- 2012
- [j47]Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, Yang Xiang: Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs. Algorithmica 62(3-4): 713-732 (2012)
- [j46]Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics: Polynomial-time recognition of clique-width ≤3 graphs. Discrete Applied Mathematics 160(6): 834-865 (2012)
- [j45]Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao: Tree-representation of set families and applications to combinatorial decompositions. Eur. J. Comb. 33(5): 688-711 (2012)
- [j44]Michel Habib, Juraj Stacho: Reduced clique graphs of chordal graphs. Eur. J. Comb. 33(5): 712-735 (2012)
- [j43]Michel Habib, Thu-Hien To: Constructing a Minimum phylogenetic Network from a Dense triplet Set. J. Bioinformatics and Computational Biology 10(5) (2012)
- [j42]Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic: Detecting 2-joins faster. J. Discrete Algorithms 17: 60-66 (2012)
- [c30]Michel Habib, Antoine Mamcarz, Fabien de Montgolfier: Algorithms for Some H-Join Decompositions. LATIN 2012: 446-457
- 2011
- [j41]Arnaud Durand, Michel Habib: Complexity issues for the sandwich homogeneous set problem. Discrete Applied Mathematics 159(7): 574-580 (2011)
- [c29]
- [c28]Michel Habib, Thu-Hien To: On a Conjecture about Compatibility of Multi-states Characters. WABI 2011: 116-127
- [i12]Michel Habib, Thu-Hien To: On a conjecture of compatibility of multi-states characters. CoRR abs/1105.1109 (2011)
- [i11]Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic: Detecting 2-joins faster. CoRR abs/1107.3977 (2011)
- 2010
- [j40]Michel Habib, Christophe Paul: A survey of the algorithmic aspects of modular decomposition. Computer Science Review 4(1): 41-59 (2010)
- [e3]Christophe Paul, Michel Habib (Eds.): Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers. Lecture Notes in Computer Science 5911, 2010, ISBN 978-3-642-11408-3
- [i10]
- [i9]Michel Habib, Thu-Hien To: Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time. CoRR abs/1012.4084 (2010)
2000 – 2009
- 2009
- [j39]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)
- [j38]Michel Habib, Juraj Stacho: Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage. Electronic Notes in Discrete Mathematics 32: 99-108 (2009)
- [j37]Michel Habib, Vincent Limouzy: On some simplicial elimination schemes for chordal graphs. Electronic Notes in Discrete Mathematics 32: 125-132 (2009)
- [j36]Binh-Minh Bui-Xuan, Michel Habib: Unifying the representation of symmetric crossing families and weakly partitive families. Electronic Notes in Discrete Mathematics 34: 329-333 (2009)
- [j35]Michel Habib, Juraj Stacho: A Decomposition Theorem for Chordal Graphs and its Applications. Electronic Notes in Discrete Mathematics 34: 561-565 (2009)
- [c27]
- [c26]Thu-Hien To, Michel Habib: Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time. CPM 2009: 275-288
- [c25]Michel Habib, Juraj Stacho: Polynomial-Time Algorithm for the Leafage of Chordal Graphs. ESA 2009: 290-300
- [i8]Michel Habib, Vincent Limouzy: On some simplicial elimination schemes for chordal graphs. CoRR abs/0901.2645 (2009)
- [i7]Clémence Magnien, Matthieu Latapy, Michel Habib: Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs. CoRR abs/0904.2728 (2009)
- [i6]Michel Habib, Christophe Paul: A survey on algorithmic aspects of modular decomposition. CoRR abs/0912.1457 (2009)
- 2008
- [j34]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)
- [j33]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)
- [j32]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)
- [j31]Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul: A Simple Linear Time LexBFS Cograph Recognition Algorithm. SIAM J. Discrete Math. 22(4): 1277-1296 (2008)
- [j30]Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul: Competitive graph searches. Theor. Comput. Sci. 393(1-3): 72-80 (2008)
- [c24]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
- [c23]Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. ICALP (1) 2008: 634-645
- [c22]Binh-Minh Bui-Xuan, Michel Habib: A Representation Theorem for Union-Difference Families and Application. LATIN 2008: 492-503
- 2007
- [j29]Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul: Can transitive orientation make sandwich problems easier? Discrete Mathematics 307(16): 2030-2041 (2007)
- [j28]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)
- [c21]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier: Unifying Two Graph Decompositions with Modular Decomposition. ISAAC 2007: 52-64
- [i5]Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul: Simple, linear-time modular decomposition. CoRR abs/0710.3901 (2007)
- [i4]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)
- 2006
- [j27]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)
- [j26]
- [c20]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier: Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. WG 2006: 278-288
- [i3]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier: Homogeneity vs. Adjacency: generalising some graph decomposition algorithms. CoRR abs/cs/0603048 (2006)
- [i2]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier: Unifying two Graph Decompositions with Modular Decomposition. CoRR abs/cs/0604065 (2006)
- [i1]Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier: Algorithmic Aspects of a Novel Modular Decomposition Theory. CoRR abs/cs/0611019 (2006)
- 2005
- [j25]Michel Habib, Christophe Paul: A simple linear time algorithm for cograph recognition. Discrete Applied Mathematics 145(2): 183-197 (2005)
- [j24]Michel Habib, Lhouari Nourine: The number of Moore families on n=6. Discrete Mathematics 294(3): 291-296 (2005)
- [c19]Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul: Revisiting T. Uno and M. Yagiura's Algorithm . ISAAC 2005: 146-155
- 2004
- [j23]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)
- [c18]Michel Habib, Christophe Paul, Mathieu Raffinot: Maximal Common Connected Sets of Interval Graphs. CPM 2004: 359-372
- [c17]Michel Habib, Fabien de Montgolfier, Christophe Paul: A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. SWAT 2004: 187-198
- [c16]Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe: Bimodular Decomposition of Bipartite Graphs. WG 2004: 117-128
- [e2]Volker Diekert, Michel Habib (Eds.): STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings. Lecture Notes in Computer Science 2996, Springer 2004, ISBN 3-540-21236-1
- 2003
- [j22]Michel Habib, Emmanuelle Lebhar, Christophe Paul: A note on finding all homogeneous set sandwiches. Inf. Process. Lett. 87(3): 147-151 (2003)
- [c15]Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul: A Simple Linear Time LexBFS Cograph Recognition Algorithm. WG 2003: 119-130
- [e1]Helmut Alt, Michel Habib (Eds.): STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings. Lecture Notes in Computer Science 2607, Springer 2003, ISBN 3-540-00623-0
- 2002
- [j21]Christian Capelle, Michel Habib, Fabien de Montgolfier: Graph Decompositions andFactorizing Permutations. Discrete Mathematics & Theoretical Computer Science 5(1): 55-70 (2002)
- [c14]Noël Nguyen, Ludovic Jankowski, Michel Habib: The perception of stop consonant sequences in dyslexic and normal children. INTERSPEECH 2002
- 2001
- [j20]Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner: Efficient algorithms on distributive lattices. Discrete Applied Mathematics 110(2-3): 169-187 (2001)
- [j19]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)
- [j18]Michel Habib, Christophe Paul, Laurent Viennot: Linear time recognition of P4-indifference graphs. Discrete Mathematics & Theoretical Computer Science 4(2): 173-178 (2001)
- [j17]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
- [j16]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)
- [c13]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
1990 – 1999
- 1999
- [j15]Yves Caseau, Michel Habib, Lhouari Nourine, Olivier Raynaud: Encoding of Multiple Inheritance Hierarchies and Partial Orders. Computational Intelligence 15: 50-62 (1999)
- [j14]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
- [c12]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
- [c11]Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul: Diameter Determination on Restricted Graph Faminlies. WG 1998: 192-202
- 1997
- [j13]Michel Habib, Lhouari Nourine, George Steiner: Gray Codes for the Ideals of Interval Orders. J. Algorithms 25(1): 52-66 (1997)
- [j12]Vincent Bouchitté, Michel Habib, Michel Morvan: Preface: Orders, Algorithms and Applications. Theor. Comput. Sci. 175(2): 223 (1997)
- [c10]Christian Capelle, Michel Habib: Graph decompositions and factorizing permutations. ISTCS 1997: 132-143
- 1996
- [j11]Michel Habib, Lhouari Nourine: Tree Structure for Distributive Lattices and its Applications. Theor. Comput. Sci. 165(2): 391-405 (1996)
- 1995
- [j10]Michel Habib, Marianne Huchard, Jeremy Spinrad: A Linear Algorithm To Decompose Inheritance Graphs Into Modules. Algorithmica 13(6): 573-591 (1995)
- [c9]Philippe Galinier, Michel Habib, Christophe Paul: Chordal Graphs and Their Clique Graphs. WG 1995: 358-371
- 1994
- [j9]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)
- [c8]
- [c7]Roland Ducournau, Michel Habib, Marianne Huchard, Marie-Laure Mugnier: Proposal for a Monotonic Multiple Inheritance Linearization. OOPSLA 1994: 164-175
- [c6]
- 1993
- [j8]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
- [c5]Roland Ducournau, Michel Habib, Marianne Huchard, Marie-Laure Mugnier: Monotonic Conflict Resolution Mechanisms for Inheritance. OOPSLA 1992: 16-24
- [c4]Alain Cournier, Michel Habib: An Efficient Algorithm to Recognize Prime Undirected Graphs. WG 1992: 212-224
- 1991
- [j7]Michel Habib, David Kelly, Rolf H. Möhring: Interval dimension is a comparability invariant. Discrete Mathematics 88(2-3): 211-229 (1991)
- 1990
- [c3]Michel Habib, Michel Morvan, Jean-Xavier Rampon: Remarks on Some Concurrency Measures. WG 1990: 221-238
1980 – 1989
- 1987
- [j6]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)
- [c2]Roland Ducournau, Michel Habib: On Some Algorithms for Multiple Inheritance in Object-Oriented Programming. ECOOP 1987: 243-252
- 1986
- [c1]M. Dao, Michel Habib, J. P. Richard, D. Tallot: CABRI, An Interactive System for Graph Manipulation. WG 1986: 58-67
- 1985
- [j5]
- 1984
- [j4]Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche: On linear k-arboricity. Discrete Mathematics 52(2-3): 123-132 (1984)
- 1982
- [j3]Michel Habib, Bernard Péroche: Some problems about linear arboricity. Discrete Mathematics 41(2): 219-220 (1982)
- 1981
- [j2]M. Chein, Michel Habib, M. C. Maurer: Partitive hypergraphs. Discrete Mathematics 37(1): 35-50 (1981)
1970 – 1979
- 1979
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-27 20:29 CET by the dblp team