The following pages link to Michel A. Habib (Q406261):
Displaying 50 items.
- (Q187125) (redirect page) (← links)
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- Reinsurance or securitization: the case of natural catastrophe risk (Q406263) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Reduced clique graphs of chordal graphs (Q412263) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
- Complexity issues for the sandwich homogeneous set problem (Q531596) (← links)
- NP-completeness properties about linear extensions (Q581427) (← links)
- (Q686477) (redirect page) (← links)
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- On linear k-arboricity (Q761470) (← links)
- Approximating modular decomposition is hard (Q779173) (← links)
- Jump number of dags having Dilworth number 2 (Q791537) (← links)
- On the greedy dimension of a partial order (Q802583) (← links)
- On transitive orientations with restricted covering graphs (Q845912) (← links)
- A tie-break model for graph search (Q896657) (← links)
- Algorithmic aspects of switch cographs (Q906430) (← links)
- A note on computing set overlap classes (Q975443) (← links)
- A note on finding all homogeneous set sandwiches (Q1014412) (← links)
- 1-intersecting families (Q1062056) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
- Computing the bump number is easy (Q1106863) (← links)
- On the X-join decomposition for undirected graphs (Q1142232) (← links)
- Partitive hypergraphs (Q1160636) (← links)
- Some problems about linear arboricity (Q1164649) (← links)
- Underpricing and IPO proceeds: a note (Q1274440) (← links)
- Interval dimension and MacNeille completion (Q1318360) (← links)
- Treewidth of cocomparability graphs and a new order-theoretic parameter (Q1337573) (← links)
- Tree structure for distributive lattices and its applications (Q1366682) (← links)
- (Q1390162) (redirect page) (← links)
- Calculation of turblent flow and heat transfer in periodically converging-diverging channels (Q1390165) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- The number of Moore families on \(n=6\) (Q1781981) (← links)
- Representation of lattices via set-colored posets (Q1800386) (← links)
- Computational aspects of the 2-dimension of partially ordered sets (Q1884957) (← links)
- Skills, core capabilities, and the choice between merging, allying, and trading assets (Q1940390) (← links)
- The arboreal jump number of an order (Q1943701) (← links)
- Unique perfect phylogeny is intractable (Q1945932) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- The generalized kudryashov method for new closed form traveling wave solutions to some NLEEs (Q2127803) (← links)
- Fast diameter computation within split graphs (Q2180143) (← links)
- A general algorithmic scheme for modular decompositions of hypergraphs and applications (Q2301749) (← links)
- Fast approximation of centrality and distances in hyperbolic graphs (Q2327101) (← links)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
