Lalla Mouatadid

Orcid: 0000-0002-2274-6773

According to our database1, Lalla Mouatadid authored at least 19 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs.
SIAM J. Discret. Math., March, 2024

DECDM: Document Enhancement using Cycle-Consistent Diffusion Models.
Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2024

RE²: Region-Aware Relation Extraction from Visually Rich Documents.
Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers), 2024

SPUQ: Perturbation-Based Uncertainty Quantification for Large Language Models.
Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics, 2024

2023
A new graph parameter to measure linearity.
J. Graph Theory, July, 2023

RE<sup>2</sup>: Region-Aware Relation Extraction from Visually Rich Documents.
CoRR, 2023

A Scalable Technique for Weak-Supervised Learning with Domain Constraints.
CoRR, 2023

2022
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs.
Theor. Comput. Sci., 2022

Mining Frequent Patterns on Knowledge Graphs.
Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022

Actionable Recommendations for Small Businesses With Hybrid AI.
Proceedings of the AAAI 2022 Spring Symposium on Machine Learning and Knowledge Engineering for Hybrid Intelligence (AAAI-MAKE 2022), 2022

2021
(α, β)-Modules in Graphs.
CoRR, 2021

2020
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations.
Algorithmica, 2020

Approximating Modular Decomposition Is Hard.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018
Efficient Algorithms on Cocomparability Graphs via Vertex Orderings.
PhD thesis, 2018

2017
Towards A Unified View of Linear Structure on Graph Classes.
CoRR, 2017

2016
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs.
Inf. Process. Lett., 2016

2015
Path Graphs, Clique Trees, and Flowers.
CoRR, 2015

2014
Linear Time LexDFS on Cocomparability Graphs.
Proceedings of the Algorithm Theory - SWAT 2014, 2014


  Loading...