1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.CL2026
Claim Automation using Large Language Model
Zhengda Mo, Zhiyu Quan, Eli O'Donohue +1
While Large Language Models (LLMs) have achieved strong performance on general-purpose language tasks, their deployment in regulated and data-sensitive domains, including insurance…
math.CO2020
Characterization of saturated graphs related to pairs of disjoint matchings
Zhengda Mo, Sam Qunell, Anush Tserunyan +1
We study the ratio, in a finite graph, of the sizes of the largest matching in any pair of disjoint matchings with the maximum total number of edges and the largest possible matchi…
math.CO2020★ 1 cited
Pairs of disjoint matchings and related classes of graphs
Huizheng, Guo, Kieran Kaempen +6
For a finite graph , we study the maximum -edge colorable subgraph problem and a related ratio , where is the matching number of , and is…