◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Zhengda Mo

3 papers hereh-index 00 citations3 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2

Across the 2 of 3 papers where every author was matched, so the position is known.

fields
  • math.CO2
  • cs.CL1

identity via Semantic Scholar / OpenAlex

most citedPairs of disjoint matchings and related classes of graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

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 G, we study the maximum 2-edge colorable subgraph problem and a related ratio ν(G)μ(G)​, where ν(G) is the matching number of G, and μ(G) is…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.