Michel A. Habib

From MaRDI portal
Person:406261

Available identifiers

zbMath Open habib.michel-aMaRDI QIDQ406261

List of research outcomes

PublicationDate of PublicationType
A new graph parameter to measure linearity2023-10-12Paper
Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension2022-11-15Paper
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs2022-06-13Paper
The generalized kudryashov method for new closed form traveling wave solutions to some NLEEs2022-04-21Paper
Fast Diameter Computation within Split Graphs2022-01-27Paper
Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs2021-06-29Paper
Graph Classes and Forbidden Patterns on Three Vertices2021-03-18Paper
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension2021-02-02Paper
https://portal.mardi4nfdi.de/entity/Q51362632020-11-25Paper
Approximating modular decomposition is hard2020-07-21Paper
Fast diameter computation within split graphs2020-05-13Paper
Maximum induced matching algorithms via vertex ordering characterizations2020-04-09Paper
A general algorithmic scheme for modular decompositions of hypergraphs and applications2020-02-25Paper
Fast approximation of centrality and distances in hyperbolic graphs2019-10-11Paper
Fast approximation of eccentricities and distances in hyperbolic graphs2019-07-12Paper
When an optimal dominating set with given constraints exists2019-06-06Paper
Representation of lattices via set-colored posets2018-10-23Paper
A new graph parameter to measure linearity2018-03-26Paper
A new LBFS-based algorithm for cocomparability graph recognition2016-11-24Paper
Into the square: on the complexity of some quadratic-time solvable problems2016-08-05Paper
On the Power of Graph Searching for Cocomparability Graphs2016-04-07Paper
Algorithmic aspects of switch cographs2016-01-21Paper
A tie-break model for graph search2015-12-10Paper
Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs2015-09-09Paper
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs2015-05-26Paper
PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT2015-04-29Paper
https://portal.mardi4nfdi.de/entity/Q49823662015-04-09Paper
Computing \(H\)-joins with application to 2-modular decomposition2015-01-19Paper
https://portal.mardi4nfdi.de/entity/Q29285802014-11-10Paper
A survey of the algorithmic aspects of modular decomposition2014-10-07Paper
Reinsurance or securitization: the case of natural catastrophe risk2014-09-08Paper
Fast computation of empirically tight bounds for the diameter of massive graphs2014-04-01Paper
On computing the diameter of real-world undirected graphs2013-12-11Paper
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
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage2013-07-04Paper
On some simplicial elimination schemes for chordal graphs2013-07-04Paper
Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs2013-06-28Paper
Detecting 2-joins faster2013-06-24Paper
https://portal.mardi4nfdi.de/entity/Q49183892013-04-24Paper
Unique perfect phylogeny is intractable2013-04-17Paper
The arboreal jump number of an order2013-03-20Paper
Skills, core capabilities, and the choice between merging, allying, and trading assets2013-03-06Paper
Algorithms for Some H-Join Decompositions2012-06-29Paper
Polynomial-time recognition of clique-width \(\leq 3\) graphs2012-05-11Paper
Tree-representation of set families and applications to combinatorial decompositions2012-05-04Paper
Reduced clique graphs of chordal graphs2012-05-04Paper
Additive spanners and distance and routing labeling schemes for hyperbolic graphs2012-04-26Paper
Unique Perfect Phylogeny Is NP-Hard2011-06-29Paper
Complexity issues for the sandwich homogeneous set problem2011-04-19Paper
A note on computing set overlap classes2010-06-09Paper
On transitive orientations with restricted covering graphs2010-01-29Paper
Graph-Theoretic Concepts in Computer Science2010-01-12Paper
A Simple Linear Time LexBFS Cograph Recognition Algorithm2009-11-27Paper
Polynomial-Time Algorithm for the Leafage of Chordal Graphs2009-10-29Paper
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time2009-07-07Paper
A note on finding all homogeneous set sandwiches2009-04-28Paper
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs2009-02-12Paper
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms2008-09-04Paper
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations2008-08-28Paper
Unifying Two Graph Decompositions with Modular Decomposition2008-05-27Paper
Competitive graph searches2008-04-15Paper
On Modular Decomposition Concepts: the case for Homogeneous Relations2007-05-29Paper
Algorithms and Computation2006-11-14Paper
Graph-Theoretic Concepts in Computer Science2005-12-08Paper
Combinatorial Pattern Matching2005-09-07Paper
Algorithm Theory - SWAT 20042005-09-07Paper
The number of Moore families on \(n=6\)2005-06-10Paper
A simple linear time algorithm for cograph recognition2005-02-22Paper
Computational aspects of the 2-dimension of partially ordered sets2004-10-27Paper
Heat transfer to pulsating turbulent flow in an abrupt pipe expansion2004-03-07Paper
Monitoring, Implicit Contracting, and the Lack of Permanence of Leveraged Buyouts2003-03-12Paper
https://portal.mardi4nfdi.de/entity/Q43311902002-09-26Paper
Diameter determination on restricted graph families2002-08-14Paper
Efficient algorithms on distributive lattices2002-01-30Paper
https://portal.mardi4nfdi.de/entity/Q45083692001-05-13Paper
https://portal.mardi4nfdi.de/entity/Q45252572001-01-21Paper
https://portal.mardi4nfdi.de/entity/Q49544422000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q42538311999-12-14Paper
https://portal.mardi4nfdi.de/entity/Q42816471999-06-09Paper
https://portal.mardi4nfdi.de/entity/Q42327881999-04-26Paper
Calculation of turblent flow and heat transfer in periodically converging-diverging channels1999-02-16Paper
Underpricing and IPO proceeds: a note1999-01-12Paper
Gray Codes for the Ideals of Interval Orders1998-01-07Paper
Tree structure for distributive lattices and its applications1997-09-18Paper
Fluid flow and heat transfer characteristics in axisymmetric annular diffusers1997-05-14Paper
Models of information aggregation in financial markets: a review1996-01-01Paper
Treewidth of cocomparability graphs and a new order-theoretic parameter1994-11-10Paper
On the Interplay Between Interval Dimension and Dimension1994-10-25Paper
Interval dimension and MacNeille completion1994-03-27Paper
On the calculation of transitive reduction-closure of orders1994-03-13Paper
https://portal.mardi4nfdi.de/entity/Q40281181993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q33609161991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38238211989-01-01Paper
Computing the bump number is easy1988-01-01Paper
NP-completeness properties about linear extensions1987-01-01Paper
On some complexity properties of N-free posets and posets with bounded decomposition diameter1987-01-01Paper
On the greedy dimension of a partial order1985-01-01Paper
1-intersecting families1985-01-01Paper
N-free posets as generalizations of series-parallel posets1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849481984-01-01Paper
On linear k-arboricity1984-01-01Paper
Jump number of dags having Dilworth number 21984-01-01Paper
La k-Arboricité Linéaire Des Arbres1983-01-01Paper
Some problems about linear arboricity1982-01-01Paper
Partitive hypergraphs1981-01-01Paper
The Jump Number of Dags and Posets: An Introduction1980-01-01Paper
A Construction Method For Minimally K-Edge-Connected Graphs1980-01-01Paper
On the X-join decomposition for undirected graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38598051978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41755901978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40996681975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41083571975-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Michel A. Habib