3 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.DS2023
MMS Allocations of Chores with Connectivity Constraints: New Methods and New Results
Mingyu Xiao, Guoliang Qiu, Sen Huang
We study the problem of allocating indivisible chores to agents under the Maximin share (MMS) fairness notion. The chores are embedded on a graph and each bundle of chores assigned…
cs.DS2021★ 1 cited
Exact algorithms for maximum weighted independent set on sparse graphs
Sen Huang, Mingyu Xiao, Xiaoyu Chen
The maximum independent set problem is one of the most important problems in graph algorithms and has been extensively studied in the line of research on the worst-case analysis of…
cs.DS2019★ 3 cited
Object Reachability via Swaps under Strict and Weak Preferences
Sen Huang, Mingyu Xiao
The \textsc{Housing Market} problem is a widely studied resource allocation problem. In this problem, each agent can only receive a single object and has preferences over all objec…