| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | 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  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib, Michaël Rao |
Tree-representation of set families and applications to combinatorial decompositions.  |
Eur. J. Comb.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Juraj Stacho |
Reduced clique graphs of chordal graphs.  |
Eur. J. Comb.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics |
Polynomial-time recognition of clique-width ≤3 graphs.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Antoine Mamcarz, Fabien de Montgolfier |
Algorithms for Some H-Join Decompositions.  |
LATIN  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Thu-Hien To |
On a conjecture of compatibility of multi-states characters  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic |
Detecting 2-joins faster  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arnaud Durand, Michel Habib |
Complexity issues for the sandwich homogeneous set problem.  |
Discrete Applied Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Thu-Hien To |
On a Conjecture about Compatibility of Multi-states Characters.  |
WABI  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Juraj Stacho |
Unique Perfect Phylogeny Is NP-Hard.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul |
A survey of the algorithmic aspects of modular decomposition.  |
Computer Science Review  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Thu-Hien To |
Structure and Recognition of 3,4-leaf Powers of Galled Phylogenetic Networks in Polynomial Time  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michel Habib, Juraj Stacho |
Unique perfect phylogeny is NP-hard  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Christophe Paul, Michel Habib (eds.) |
Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers  |
WG  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib |
Unifying the representation of symmetric crossing families and weakly partitive families.  |
Electronic Notes in Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Juraj Stacho |
A Decomposition Theorem for Chordal Graphs and its Applications.  |
Electronic Notes in Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Vincent Limouzy |
On some simplicial elimination schemes for chordal graphs.  |
Electronic Notes in Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Juraj Stacho |
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage.  |
Electronic Notes in Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul |
A survey on algorithmic aspects of modular decomposition  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Clémence Magnien, Matthieu Latapy, Michel Habib |
Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Michel Habib, Vincent Limouzy |
On some simplicial elimination schemes for chordal graphs  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier |
Algorithmic aspects of a general modular decomposition theory.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Juraj Stacho |
Polynomial-Time Algorithm for the Leafage of Chordal Graphs.  |
ESA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Thu-Hien To, Michel Habib |
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time.  |
CPM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib |
Diameter and Center Computations in Networks.  |
CTW  |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao |
A note on computing set overlap classes.  |
Inf. Process. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul |
Competitive graph searches.  |
Theor. Comput. Sci.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul |
A Simple Linear Time LexBFS Cograph Recognition Algorithm.  |
SIAM J. Discrete Math.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Clémence Magnien, Matthieu Latapy, Michel Habib |
Fast computation of empirically tight bounds for the diameter of massive graphs.  |
ACM Journal of Experimental Algorithmics  |
2008 |
DBLP DOI BibTeX RDF |
Diameter bounds, graph diameter |
| 1 | Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul |
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations.  |
ICALP  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib |
A Representation Theorem for Union-Difference Families and Application.  |
LATIN  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
delta-hyperbolic space, diameter, center, radius |
| 1 | Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter |
On transitive orientations with restricted covering graphs.  |
Inf. Process. Lett.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, David Kelly, Emmanuelle Lebhar, Christophe Paul |
Can transitive orientation make sandwich problems easier?  |
Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao |
A Note On Computing Set Overlap Classes  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul |
Simple, linear-time modular decomposition  |
CoRR  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier |
Unifying Two Graph Decompositions with Modular Decomposition.  |
ISAAC  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier |
Unifying two Graph Decompositions with Modular Decomposition  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier |
Algorithmic Aspects of a Novel Modular Decomposition Theory  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier |
Homogeneity vs. Adjacency: generalising some graph decomposition algorithms  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Michel Habib |
Foreword.  |
Theory Comput. Syst.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier |
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms.  |
WG  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Lhouari Nourine |
The number of Moore families on n=6.  |
Discrete Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul |
A simple linear time algorithm for cograph recognition.  |
Discrete Applied Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul |
Revisiting T. Uno and M. Yagiura's Algorithm .  |
ISAAC  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Lhouari Nourine, Olivier Raynaud, Eric Thierry |
Computational aspects of the 2-dimension of partially ordered sets.  |
Theor. Comput. Sci.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe |
Bimodular Decomposition of Bipartite Graphs.  |
WG  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Michel Habib (eds.) |
STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings  |
STACS  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michel Habib, Fabien de Montgolfier, Christophe Paul |
A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension.  |
SWAT  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul, Mathieu Raffinot |
Maximal Common Connected Sets of Interval Graphs.  |
CPM  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Emmanuelle Lebhar, Christophe Paul |
A note on finding all homogeneous set sandwiches.  |
Inf. Process. Lett.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul |
A Simple Linear Time LexBFS Cograph Recognition Algorithm.  |
WG  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Helmut Alt, Michel Habib (eds.) |
STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings  |
STACS  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Christian Capelle, Michel Habib, Fabien de Montgolfier |
Graph Decompositions andFactorizing Permutations.  |
Discrete Mathematics & Theoretical Computer Science  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Noël Nguyen, Ludovic Jankowski, Michel Habib |
The perception of stop consonant sequences in dyslexic and normal children.  |
INTERSPEECH  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Guillaume Damiand, Michel Habib, Christophe Paul |
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs.  |
Theor. Comput. Sci.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul, Laurent Viennot |
Linear time recognition of P4-indifference graphs.  |
Discrete Mathematics & Theoretical Computer Science  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Michel Habib, Raoul Medina, Lhouari Nourine, George Steiner |
Efficient algorithms on distributive lattices.  |
Discrete Applied Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul |
Diameter determination on restricted graph families.  |
Discrete Applied Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul, Laurent Viennot |
Partition Refinement Techniques: An Interesting Algorithmic Tool Kit.  |
Int. J. Found. Comput. Sci.  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Yves Caseau, Michel Habib, Lhouari Nourine, Olivier Raynaud |
Encoding of Multiple Inheritance Hierarchies and Partial Orders.  |
Computational Intelligence  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Derek G. Corneil, Feodor F. Dragan, Michel Habib, Christophe Paul |
Diameter Determination on Restricted Graph Faminlies.  |
WG  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Christophe Paul, Laurent Viennot |
A Synthesis on Partition Refinement: A Useful Routine for Strings, Graphs, Boolean Matrices and Automata.  |
STACS  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Bouchitté, Michel Habib, Michel Morvan |
Preface: Orders, Algorithms and Applications.  |
Theor. Comput. Sci.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Lhouari Nourine, George Steiner |
Gray Codes for the Ideals of Interval Orders.  |
J. Algorithms  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Capelle, Michel Habib |
Graph decompositions and factorizing permutations. (PDF / PS)  |
ISTCS  |
1997 |
DBLP DOI BibTeX RDF |
factorizing permutations, decomposition sets, inheritance graph decomposition, optimization, graph theory, vertices, undirected graph, chordal graphs, graph decompositions, decomposition algorithms, linear algorithm, modular decomposition, decomposition tree |
| 1 | Michel Habib, Lhouari Nourine |
Tree Structure for Distributive Lattices and its Applications.  |
Theor. Comput. Sci.  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Marianne Huchard, Jeremy Spinrad |
A Linear Algorithm To Decompose Inheritance Graphs Into Modules.  |
Algorithmica  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Galinier, Michel Habib, Christophe Paul |
Chordal Graphs and Their Clique Graphs.  |
WG  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Felsner, Michel Habib, Rolf H. Möhring |
On the Interplay Between Interval Dimension and Dimension.  |
SIAM J. Discrete Math.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Lhouari Nourine |
Bit-Vector Encoding for Partially Ordered Sets.  |
ORDAL  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Cournier, Michel Habib |
A New Linear Algorithm for Modular Decomposition.  |
CAAP  |
1994 |
DBLP DOI BibTeX RDF |
autonomous subsets, clans, graph decomposition trees, vertex-splitting. cotrees, Graphs, modules, substitution, cographs, prime graphs |
| 1 | Roland Ducournau, Michel Habib, Marianne Huchard, Marie-Laure Mugnier |
Proposal for a Monotonic Multiple Inheritance Linearization.  |
OOPSLA  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Michel Morvan, Jean-Xavier Rampon |
On the calculation of transitive reduction - closure of orders.  |
Discrete Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Cournier, Michel Habib |
An Efficient Algorithm to Recognize Prime Undirected Graphs.  |
WG  |
1992 |
DBLP DOI BibTeX RDF |
substitution decomposition, autonomous subsets, modules, Undirected graphs, prime graphs |
| 1 | Roland Ducournau, Michel Habib, Marianne Huchard, Marie-Laure Mugnier |
Monotonic Conflict Resolution Mechanisms for Inheritance.  |
OOPSLA  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, David Kelly, Rolf H. Möhring |
Interval dimension is a comparability invariant.  |
Discrete Mathematics  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Michel Morvan, Jean-Xavier Rampon |
Remarks on Some Concurrency Measures.  |
WG  |
1990 |
DBLP DOI BibTeX RDF |
disgraphs, computational complexity, parallelism, concurrency, distributed computations, partial orders, interval orders, antichains |
| 1 | Michel Habib, Rolf H. Möhring |
On some complexity properties of N-free posets and posets with bounded decomposition diameter.  |
Discrete Mathematics  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Roland Ducournau, Michel Habib |
On Some Algorithms for Multiple Inheritance in Object-Oriented Programming.  |
ECOOP  |
1987 |
DBLP DOI BibTeX RDF |
inheritance with exceptions, Object oriented language, depth-first-search, partial ordered sets, multiple inheritance, linear extensions |
| 1 | M. Dao, Michel Habib, J. P. Richard, D. Tallot |
CABRI, An Interactive System for Graph Manipulation.  |
WG  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, M. C. Maurer |
1-Intersecting families.  |
Discrete Mathematics  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Claude Bermond, Jean-Luc Fouquet, Michel Habib, Bernard Péroche |
On linear k-arboricity.  |
Discrete Mathematics  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Habib, Bernard Péroche |
Some problems about linear arboricity.  |
Discrete Mathematics  |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Chein, Michel Habib, M. C. Maurer |
Partitive hypergraphs.  |
Discrete Mathematics  |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Cogis, Michel Habib |
Nombre de sauts et graphes série-parallèles.  |
ITA  |
1979 |
DBLP BibTeX RDF |
|