default search action
Lalla Mouatadid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Michel Habib, Lalla Mouatadid
, Éric Sopena, Mengchuan Zou:
\(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs. SIAM J. Discret. Math. 38(1): 566-589 (2024) - [c10]Xiang Gao, Jiaxin Zhang, Lalla Mouatadid, Kamalika Das:
SPUQ: Perturbation-Based Uncertainty Quantification for Large Language Models. EACL (1) 2024: 2336-2346 - [c9]Pritika Ramu, Sijia Wang, Lalla Mouatadid, Joy Rimchala, Lifu Huang:
RE²: Region-Aware Relation Extraction from Visually Rich Documents. NAACL-HLT 2024: 8731-8747 - [c8]Jiaxin Zhang, Joy Rimchala, Lalla Mouatadid, Kamalika Das, Kumar Sricharan:
DECDM: Document Enhancement using Cycle-Consistent Diffusion Models. WACV 2024: 8021-8030 - [i9]Xiang Gao, Jiaxin Zhang, Lalla Mouatadid, Kamalika Das:
SPUQ: Perturbation-Based Uncertainty Quantification for Large Language Models. CoRR abs/2403.02509 (2024) - 2023
- [j4]Pierre Charbit, Michel Habib, Lalla Mouatadid
A new graph parameter to measure linearity. J. Graph Theory 103(3): 462-485 (2023) - [i8]Sudhir Agarwal, Anu Sreepathy, Lalla Mouatadid:
A Scalable Technique for Weak-Supervised Learning with Domain Constraints. CoRR abs/2301.05253 (2023) - [i7]Pritika Ramu, Sijia Wang, Lalla Mouatadid, Joy Rimchala, Lifu Huang:
RE2: Region-Aware Relation Extraction from Visually Rich Documents. CoRR abs/2305.14590 (2023) - [i6]Jiaxin Zhang, Joy Rimchala, Lalla Mouatadid, Kamalika Das, Kumar Sricharan:
DECDM: Document Enhancement using Cycle-Consistent Diffusion Models. CoRR abs/2311.09625 (2023) - 2022
- [j3]Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou:
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs. Theor. Comput. Sci. 923: 56-73 (2022) - [c7]Sudhir Agarwal, Lalla Mouatadid, Anu Sreepathy, Kevin Furbish, Morgen Kimbrell, Mike Gabriel:
Actionable Recommendations for Small Businesses With Hybrid AI. AAAI Spring Symposium: MAKE 2022 - [c6]Lalla Mouatadid:
Mining Frequent Patterns on Knowledge Graphs. WSDM 2022: 1647 - 2021
- [i5]Michel Habib, Lalla Mouatadid, Éric Sopena, Mengchuan Zou:
(α, β)-Modules in Graphs. CoRR abs/2101.08881 (2021) - 2020
- [j2]Michel Habib, Lalla Mouatadid
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. Algorithmica 82(2): 260-278 (2020) - [c5]Michel Habib, Lalla Mouatadid, Mengchuan Zou:
Approximating Modular Decomposition Is Hard. CALDAM 2020: 53-66
2010 – 2019
- 2019
- [c4]Michel Habib
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications. IWOCA 2019: 251-264 - 2018
- [b1]Lalla Mouatadid:
Efficient Algorithms on Cocomparability Graphs via Vertex Orderings. University of Toronto, Canada, 2018 - 2017
- [c3]Pierre Charbit
A New Graph Parameter to Measure Linearity. COCOA (2) 2017: 154-168 - [c2]Michel Habib
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. ISAAC 2017: 43:1-43:12 - [i4]Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr:
Towards A Unified View of Linear Structure on Graph Classes. CoRR abs/1702.02133 (2017) - [i3]Michel Habib, Lalla Mouatadid:
Maximum Induced Matching Algorithms via Vertex Ordering Characterizations. CoRR abs/1707.01245 (2017) - 2016
- [j1]Ekkehard Köhler, Lalla Mouatadid:
A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs. Inf. Process. Lett. 116(6): 391-395 (2016) - 2015
- [i2]Lalla Mouatadid, Robert Robere:
Path Graphs, Clique Trees, and Flowers. CoRR abs/1505.07702 (2015) - 2014
- [c1]Ekkehard Köhler, Lalla Mouatadid:
Linear Time LexDFS on Cocomparability Graphs. SWAT 2014: 319-330 - [i1]Ekkehard Köhler, Lalla Mouatadid:
Linear Time LexDFS on Cocomparability Graphs. CoRR abs/1404.5996 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-30 21:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: