Lalla Mouatadid
Lalla Mouatadid
Bestätigte E-Mail-Adresse bei cs.toronto.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Linear Time LexDFS on Cocomparability Graphs.
E Köhler, L Mouatadid
Scandinavian Workshop on Algorithm Theory, 319-330, 2014
182014
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
E Köhler, L Mouatadid
Information Processing Letters 116 (6), 391-395, 2016
142016
A new graph parameter to measure linearity
P Charbit, M Habib, L Mouatadid, R Naserasr
International Conference on Combinatorial Optimization and Applications, 154-168, 2017
7*2017
Maximum induced matching algorithms via vertex ordering characterizations
M Habib, L Mouatadid
Algorithmica 82 (2), 260-278, 2020
42020
A general algorithmic scheme for modular decompositions of hypergraphs and applications
M Habib, F de Montgolfier, L Mouatadid, M Zou
International Workshop on Combinatorial Algorithms, 251-264, 2019
12019
Approximating Modular Decomposition Is Hard
M Habib, L Mouatadid, M Zou
Conference on Algorithms and Discrete Applied Mathematics, 53-66, 2020
2020
A Fast, Simple Algorithm for Computing the Bump Number of a Poset
G Pruesse, D Corneil, L Mouatadid
2018
Efficient Algorithms on Cocomparability Graphs via Vertex Orderings
L Mouatadid
2018
Path Graphs, Clique Trees, and Flowers
L Mouatadid, R Robere
arXiv preprint arXiv:1505.07702, 2015
2015
A De Bruijn-Erdos Theorem for Asteroidal-Triple Free Graphs
L Mouatadid
fMRI Classification of Cognitive States Across Multiple Subjects
L Mouatadid
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–11