Lalla Mouatadid

From MaRDI portal
(Redirected from Lalla Mouatadid)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
SIAM Journal on Discrete Mathematics
2024-02-07Paper
A new graph parameter to measure linearity
Journal of Graph Theory
2023-10-12Paper
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
Theoretical Computer Science
2022-06-13Paper
Maximum induced matching algorithms via vertex ordering characterizations2020-11-25Paper
Approximating modular decomposition is hard2020-07-21Paper
Maximum induced matching algorithms via vertex ordering characterizations
Algorithmica
2020-04-09Paper
A general algorithmic scheme for modular decompositions of hypergraphs and applications2020-02-25Paper
A new graph parameter to measure linearity
Lecture Notes in Computer Science
2018-03-26Paper
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
Information Processing Letters
2016-04-06Paper
Path Graphs, Clique Trees, and Flowers2015-05-28Paper
Path Graphs, Clique Trees, and Flowers
(available as arXiv preprint)
2015-01-01Paper
Linear time LexDFS on cocomparability graphs
Algorithm Theory – SWAT 2014
2014-09-02Paper


Research outcomes over time


This page was built for person: Lalla Mouatadid