Multiple Constrained Routing Algorithms in Large-Scaled Software Defined Networks. - Chenyang Xu 002; Liangde Tao; Huajingling Wu; Deshi Ye; Guochuan Zhang (CoRR, 2019)

Scheduling Stochastic Jobs - Complexity and Approximation Algorithms. - Liangde Tao; Lin Chen 009; Guochuan Zhang (ICAPS, 2021)

Hardness and Algorithms for Electoral Manipulation Under Media Influence. - Liangde Tao; Lin Chen 009; Lei Xu 012; Shouhuai Xu; Zhimin Gao; Weidong Shi; Dian Huang (IJTCS-FAW, 2021)

Tight running times for minimum 𝓁p-norm load balancing: beyond exponential dependencies on 1/ε. - Lin Chen 009; Liangde Tao; José Verschae (CoRR, 2021)

How Hard is Bribery in Elections with Randomly Selected Voters. - Liangde Tao; Lin Chen 009; Lei Xu 012; Weidong Shi; Ahmed Sunny; Md Mahabub Uz Zaman (AAMAS, 2022)

Local Differential Privacy Meets Computational Social Choice - Resilience under Voter Deletion. - Liangde Tao; Lin Chen 009; Lei Xu 012; Weidong Shi (IJCAI, 2022)

Tight running times for minimum ℓq-norm load balancing: beyond exponential dependencies on 1/∊. - Lin Chen 009; Liangde Tao; José Verschae (SODA, 2022)

Optimally Blending Honeypots into Production Networks: Hardness and Algorithms. - Md Mahabub Uz Zaman; Liangde Tao; Mark Maldonado; Chang Liu; Ahmed Sunny; Shouhuai Xu; Lin Chen 009 (SciSec, 2023)

Electoral manipulation via influence: probabilistic model. - Liangde Tao; Lin Chen 009; Lei Xu 012; Shouhuai Xu; Zhimin Gao; Weidong Shi (Auton. Agents Multi Agent Syst., 2023)

Bribery in elections with randomly selected voters: Hardness and algorithm. - Liangde Tao; Lin Chen 009; Lei Xu 012; Weidong Shi; Md Mahabub Uz Zaman; Ahmed Sunny (Theor. Comput. Sci., 2025)