The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michel Habib: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Roland Ducournau, Michel Habib, Marianne Huchard, Marie-Laure Mugnier
    Monotonic Conflict Resolution Mechanisms for Inheritance. [Citation Graph (1, 0)][DBLP]
    OOPSLA, 1992, pp:16-24 [Conf]
  2. Alain Cournier, Michel Habib
    A New Linear Algorithm for Modular Decomposition. [Citation Graph (0, 0)][DBLP]
    CAAP, 1994, pp:68-84 [Conf]
  3. Michel Habib, Christophe Paul, Mathieu Raffinot
    Maximal Common Connected Sets of Interval Graphs. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:359-372 [Conf]
  4. Roland Ducournau, Michel Habib
    On Some Algorithms for Multiple Inheritance in Object-Oriented Programming. [Citation Graph (0, 0)][DBLP]
    ECOOP, 1987, pp:243-252 [Conf]
  5. Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
    Revisiting T. Uno and M. Yagiura's Algorithm . [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:146-155 [Conf]
  6. Christian Capelle, Michel Habib
    Graph decompositions and factorizing permutations. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:132-143 [Conf]
  7. 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). [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:126-134 [Conf]
  8. Roland Ducournau, Michel Habib, Marianne Huchard, Marie-Laure Mugnier
    Proposal for a Monotonic Multiple Inheritance Linearization. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 1994, pp:164-175 [Conf]
  9. Michel Habib, Lhouari Nourine
    Bit-Vector Encoding for Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    ORDAL, 1994, pp:1-12 [Conf]
  10. Michel Habib, Christophe Paul, Laurent Viennot
    A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:25-38 [Conf]
  11. Michel Habib, Fabien de Montgolfier, Christophe Paul
    A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:187-198 [Conf]
  12. Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
    A Simple Linear Time LexBFS Cograph Recognition Algorithm. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:119-130 [Conf]
  13. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
    Diameter Determination on Restricted Graph Faminlies. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:192-202 [Conf]
  14. Alain Cournier, Michel Habib
    An Efficient Algorithm to Recognize Prime Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1992, pp:212-224 [Conf]
  15. M. Dao, Michel Habib, J. P. Richard, D. Tallot
    CABRI, An Interactive System for Graph Manipulation. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:58-67 [Conf]
  16. Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe
    Bimodular Decomposition of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:117-128 [Conf]
  17. Philippe Galinier, Michel Habib, Christophe Paul
    Chordal Graphs and Their Clique Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:358-371 [Conf]
  18. Michel Habib, Michel Morvan, Jean-Xavier Rampon
    Remarks on Some Concurrency Measures. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:221-238 [Conf]
  19. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
    Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:278-288 [Conf]
  20. Michel Habib, Marianne Huchard, Jeremy Spinrad
    A Linear Algorithm To Decompose Inheritance Graphs Into Modules. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:6, pp:573-591 [Journal]
  21. Yves Caseau, Michel Habib, Lhouari Nourine, Olivier Raynaud
    Encoding of Multiple Inheritance Hierarchies and Partial Orders. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1999, v:15, n:, pp:50-62 [Journal]
  22. Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul
    Diameter determination on restricted graph families. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:2-3, pp:143-166 [Journal]
  23. Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner
    Efficient algorithms on distributive lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:169-187 [Journal]
  24. Michel Habib, Christophe Paul
    A simple linear time algorithm for cograph recognition. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:183-197 [Journal]
  25. Michel Habib, Lhouari Nourine
    The number of Moore families on n=6. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:294, n:3, pp:291-296 [Journal]
  26. Christian Capelle, Michel Habib, Fabien de Montgolfier
    Graph Decompositions andFactorizing Permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2002, v:5, n:1, pp:55-70 [Journal]
  27. Michel Habib, Christophe Paul, Laurent Viennot
    Linear time recognition of P4-indifference graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:173-178 [Journal]
  28. Michel Habib, Christophe Paul, Laurent Viennot
    Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:147-170 [Journal]
  29. Michel Habib, Emmanuelle Lebhar, Christophe Paul
    A note on finding all homogeneous set sandwiches. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:3, pp:147-151 [Journal]
  30. Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter
    On transitive orientations with restricted covering graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:3, pp:119-125 [Journal]
  31. Olivier Cogis, Michel Habib
    Nombre de sauts et graphes série-parallèles. [Citation Graph (0, 0)][DBLP]
    ITA, 1979, v:13, n:1, pp:- [Journal]
  32. Michel Habib, Lhouari Nourine, George Steiner
    Gray Codes for the Ideals of Interval Orders. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:1, pp:52-66 [Journal]
  33. Volker Diekert, Michel Habib
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:1, pp:1- [Journal]
  34. Stefan Felsner, Michel Habib, Rolf H. Möhring
    On the Interplay Between Interval Dimension and Dimension. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:32-40 [Journal]
  35. Vincent Bouchitté, Michel Habib, Michel Morvan
    Preface: Orders, Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:175, n:2, pp:223- [Journal]
  36. Guillaume Damiand, Michel Habib, Christophe Paul
    A simple paradigm for graph recognition: application to cographs and distance hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:99-111 [Journal]
  37. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:59-84 [Journal]
  38. Michel Habib, Lhouari Nourine
    Tree Structure for Distributive Lattices and its Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:165, n:2, pp:391-405 [Journal]
  39. Michel Habib, Lhouari Nourine, Olivier Raynaud, Eric Thierry
    Computational aspects of the 2-dimension of partially ordered sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:2-3, pp:401-431 [Journal]
  40. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
    Algorithmic Aspects of a Novel Modular Decomposition Theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  41. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
    Homogeneity vs. Adjacency: generalising some graph decomposition algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  42. Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier
    Unifying two Graph Decompositions with Modular Decomposition [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  43. Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
    Simple, linear-time modular decomposition [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  44. M. Chein, Michel Habib, M. C. Maurer
    Partitive hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:1, pp:35-50 [Journal]
  45. Michel Habib, Bernard Péroche
    Some problems about linear arboricity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:2, pp:219-220 [Journal]
  46. Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche
    On linear k-arboricity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:2-3, pp:123-132 [Journal]
  47. Michel Habib, M. C. Maurer
    1-Intersecting families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:53, n:, pp:91-101 [Journal]
  48. Michel Habib, Rolf H. Möhring
    On some complexity properties of N-free posets and posets with bounded decomposition diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:157-182 [Journal]
  49. Michel Habib, David Kelly, Rolf H. Möhring
    Interval dimension is a comparability invariant. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:88, n:2-3, pp:211-229 [Journal]
  50. Michel Habib, Michel Morvan, Jean-Xavier Rampon
    On the calculation of transitive reduction - closure of orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:289-303 [Journal]
  51. Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul
    Can transitive orientation make sandwich problems easier? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:16, pp:2030-2041 [Journal]

  52. Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs. [Citation Graph (, )][DBLP]


  53. Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time. [Citation Graph (, )][DBLP]


  54. Polynomial-Time Algorithm for the Leafage of Chordal Graphs. [Citation Graph (, )][DBLP]


  55. Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. [Citation Graph (, )][DBLP]


  56. Unifying Two Graph Decompositions with Modular Decomposition. [Citation Graph (, )][DBLP]


  57. A Representation Theorem for Union-Difference Families and Application. [Citation Graph (, )][DBLP]


  58. Diameter and Center Computations in Networks. [Citation Graph (, )][DBLP]


  59. A Note On Computing Set Overlap Classes [Citation Graph (, )][DBLP]


  60. On some simplicial elimination schemes for chordal graphs [Citation Graph (, )][DBLP]


  61. Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs [Citation Graph (, )][DBLP]


  62. A survey on algorithmic aspects of modular decomposition [Citation Graph (, )][DBLP]


  63. Algorithmic aspects of a general modular decomposition theory. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002