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
28 2016 Linear Time LexDFS on Cocomparability Graphs. E Köhler, L Mouatadid
Algorithm Theory–SWAT 2014: 14th Scandinavian Symposium and Workshops …, 2014
27 2014 A new graph parameter to measure linearity P Charbit, M Habib, L Mouatadid, R Naserasr
Journal of Graph Theory 103 (3), 462-485, 2023
11 * 2023 Maximum induced matching algorithms via vertex ordering characterizations M Habib, L Mouatadid
Algorithmica 82 (2), 260-278, 2020
9 2020 A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs M Habib, F de Montgolfier, L Mouatadid, M Zou
Theoretical Computer Science 923, 56-73, 2022
8 * 2022 Approximating modular decomposition is hard M Habib, L Mouatadid, M Zou
Conference on Algorithms and Discrete Applied Mathematics, 53-66, 2020
5 2020 Combinatorial optimization and applications X Gao, H Du, M Han
Proc. COCOA, 10628, 2017
5 2017 Maximal cliques structure for cocomparability graphs and applications J Dusart, M Habib, DG Corneil
arXiv preprint arXiv:1611.02002, 2016
5 2016 M Habib, L Mouatadid, É Sopena, M Zou
SIAM Journal on Discrete Mathematics 38 (1), 566-589, 2024
2 * 2024 SPUQ: Perturbation-Based Uncertainty Quantification for Large Language Models X Gao, J Zhang, L Mouatadid, K Das
arXiv preprint arXiv:2403.02509, 2024
2 2024 Mining frequent patterns on knowledge graphs L Mouatadid
Proceedings of the Fifteenth ACM International Conference on Web Search and …, 2022
2 2022 Efficient algorithms on cocomparability graphs via vertex orderings L Mouatadid
University of Toronto (Canada), 2018
2 2018 Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part II X Gao, H Du, M Han
Springer, 2017
2 2017 Graph-Theoretic Concepts in Computer Science: 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers D Kratsch, I Todinca
Springer, 2014
2 2014 Introduction to Complexity Theory: 3-Colouring is NP-complete L Mouatadid
2 2014 Model based document image enhancement J Zhang, TJ Rimchala, L Mouatadid, K Das, SKP Kumar
US Patent 11,769,239, 2023
1 2023 Verifiable Cacheable Calclulations GC Scott, MR Gabriel, RC Meike, L Mouatadid
US Patent App. 17/246,401, 2022
1 2022 Graph-Theoretic Concepts in Computer Science: 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers EW Mayr
Springer, 2016
1 2016 Path graphs, clique trees, and flowers L Mouatadid, R Robere
arXiv preprint arXiv:1505.07702, 2015
1 2015 Model based document image enhancement J Zhang, TJ Rimchala, L Mouatadid, K Das, SKP Kumar
US Patent 12,045,967, 2024
2024 