Michel Habib

From MaRDI portal
Person:6074591

Available identifiers

zbMath Open habib.michelMaRDI QIDQ6074591

List of research outcomes





PublicationDate of PublicationType
Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications2024-04-29Paper
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs2024-04-23Paper
Chordal graphs and their clique graphs2024-02-28Paper
Subquadratic-time algorithm for the diameter and all eccentricities on median graphs2024-02-09Paper
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs2024-02-07Paper
A new graph parameter to measure linearity2023-10-12Paper
Classifying grounded intersection graphs via ordered forbidden patterns2021-12-01Paper
Diameter, radius and all eccentricities in linear time for constant-dimension median graphs2021-05-25Paper
A new graph parameter to measure linearity2018-03-26Paper
A new LBFS-based algorithm for cocomparability graph recognition2016-11-24Paper
On the power of graph searching for cocomparability graphs2016-04-07Paper
Influence of the tie-break rule on the end-vertex problem2014-11-10Paper
A survey of the algorithmic aspects of modular decomposition2014-10-07Paper
On computing the diameter of real-world undirected graphs2013-12-11Paper
Unifying the representation of symmetric crossing families and weakly partitive families2013-10-10Paper
A decomposition theorem for chordal graphs and its applications2013-10-10Paper
LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs2013-09-25Paper
On some simplicial elimination schemes for chordal graphs2013-07-04Paper
Linear algorithms for chordal graphs of bounded directed vertex leafage2013-07-04Paper
Algorithms for Some H-Join Decompositions2012-06-29Paper
Polynomial-time recognition of clique-width \(\leq 3\) graphs2012-05-11Paper
Reduced clique graphs of chordal graphs2012-05-04Paper
Tree-representation of set families and applications to combinatorial decompositions2012-05-04Paper
Diameter determination on restricted graph families2002-08-14Paper
Efficient algorithms on distributive lattices2002-01-30Paper
A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs2001-08-20Paper

Research outcomes over time

This page was built for person: Michel Habib