143 citations · 330 across the 36 of their papers we have counts for
37 papers
A -approximation Algorithm for the Traveling Tournament Problem
Jingyang Zhao, Mingyu Xiao
The Traveling Tournament Problem (TTP-) is a well-known benchmark problem in tournament timetabling, which asks us to design a double round-robin schedule such that the total tr…
A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering
Zimo Sheng, Mingyu Xiao
\textsc{Edge Triangle Packing} and \textsc{Edge Triangle Covering} are dual problems extensively studied in the field of parameterized complexity. Given a graph and an integer…
Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
Jingyang Zhao, Mingyu Xiao
The Multidepot Capacitated Vehicle Routing Problem (MCVRP) is a well-known variant of the classic Capacitated Vehicle Routing Problem (CVRP), where we need to route capacitated veh…
The APX-hardness of the Traveling Tournament Problem
Jingyang Zhao, Mingyu Xiao
The Traveling Tournament Problem (TTP-) is a well-known benchmark problem in sports scheduling, which asks us to design a double round-robin schedule such that each pair of team…
An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
Yuxi Liu, Mingyu Xiao
An induced subgraph is called an induced matching if each vertex is a degree-1 vertex in the subgraph. The \textsc{Almost Induced Matching} problem asks whether we can delete at mo…
Connectivity in the presence of an opponent
Zihui Liang, Bakh Khoussainov, Toru Takisaka +1
The paper introduces two player connectivity games played on finite bipartite graphs. Algorithms that solve these connectivity games can be used as subroutines for solving Müller g…