Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs. - Mingyu Xiao 001; Shaowei Kou (FAW, 2015)

An Improved Approximation Algorithm for the Traveling Tournament Problem with Maximum Trip Length Two. - Mingyu Xiao 001; Shaowei Kou (MFCS, 2016)

Almost Induced Matching: Linear Kernels and Parameterized Algorithms. - Mingyu Xiao 001; Shaowei Kou (WG, 2016)

Kernelization and Parameterized Algorithms for 3-Path Vertex Cover. - Mingyu Xiao 001; Shaowei Kou (TAMC, 2017)

Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems. - Mingyu Xiao 001; Shaowei Kou (Theor. Comput. Sci., 2017)

Parameterized algorithms and kernels for almost induced matching. - Mingyu Xiao 001; Shaowei Kou (Theor. Comput. Sci., 2020)

A simple and improved parameterized algorithm for bicluster editing. - Mingyu Xiao 001; Shaowei Kou (Inf. Process. Lett., 2022)

A 5k-vertex kernel for 3-path vertex cover. - Mingyu Xiao 001; Shaowei Kou (Theor. Comput. Sci., 2023)