1 citations · 1 across the 1 of their papers we have counts for
2 papers
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
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…