8 papers
Weighted Envy-Freeness Revisited: Indivisible Resource and House Allocations
Yuxi Liu, Mingyu Xiao
Envy-Freeness is one of the most fundamental and important concepts in fair allocation. Some recent studies have focused on the concept of weighted envy-freeness. Under this concep…
Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth
Yuxi Liu, Kangyi Tian, Mingyu Xiao
The \textsc{Co-Path Packing} (resp., \textsc{Co-Path Set}) problem asks whether a given graph can be edited to a collection of induced paths by deleting at most vertices (resp.…
Linear Kernels for -Exact Component Order Connectivity
Yuxi Liu, Mingyu Xiao
The \textsc{-Exact Component Order Connectivity} problem asks whether, given an input graph and an integer , there exists a vertex subset of size at mos…
Faster Parameterized Vertex Multicut
Huairui Chu, Yuxi Liu, Daniel Lokshtanov +3
In the {\sc Vertex Multicut} problem the input consists of a graph , integer , and a set of pairs of vertices of . The ta…
The Complexity of Tournament Fixing: Subset FAS Number and Acyclic Neighborhoods
Yuxi Liu, Junqiang Peng, Mingyu Xiao
The \textsc{Tournament Fixing Problem} (TFP) asks whether a knockout tournament can be scheduled to guarantee that a given player wins. Although TFP is NP-hard in general, it…
Aggregation Queries over Unstructured Text: Benchmark and Agentic Method
Haojia Zhu, Qinyuan Xu, Haoyu Li +4
Aggregation query over free text is a long-standing yet underexplored problem. Unlike ordinary question answering, aggregate queries require exhaustive evidence collection and syst…