Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. - Jianer Chen; Qin Huang 008; Iyad Kanj; Qian Li 012; Ge Xia (ISAAC, 2021)

Optimal Streaming Algorithms for Graph Matching. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (CoRR, 2021)

Near-Optimal Algorithms for Point-Line Covering Problems. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (STACS, 2022)

Linear-time parameterized algorithms with limited local resources. - Jianer Chen; Ying Guo; Qin Huang 008 (Inf. Comput., 2022)

Near-optimal algorithms for point-line fitting problems. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (J. Comput. Geom., 2022)

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data. - Jianer Chen; Qin Huang 008; Iyad Kanj; Ge Xia (Algorithmica, 2024)