Liangde Tao

12 papers A* 3A 1Journal 6Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Bribery in elections with randomly selected voters: Hardness and algorithm.
Theor. Comput. Sci.
Liangde Tao, Lin Chen, Lei Xu, Weidong Shi, Md Mahabub Uz Zaman, Ahmed Sunny
2024 J jnl
Optimally Blending Honeypots into Production Networks: Hardness and Algorithms.
CoRR
Md Mahabub Uz Zaman, Liangde Tao, Mark Maldonado, Chang Liu, Ahmed Sunny, Shouhuai Xu, Lin Chen
2023 J jnl
Electoral manipulation via influence: probabilistic model.
Auton. Agents Multi Agent Syst.
Liangde Tao, Lin Chen, Lei Xu, Shouhuai Xu, Zhimin Gao, Weidong Shi
2023 — conf
Optimally Blending Honeypots into Production Networks: Hardness and Algorithms.
SciSec
Md Mahabub Uz Zaman, Liangde Tao, Mark Maldonado, Chang Liu, Ahmed Sunny, Shouhuai Xu, Lin Chen
2022 A conf
How Hard is Bribery in Elections with Randomly Selected Voters.
AAMAS
Liangde Tao, Lin Chen, Lei Xu, Weidong Shi, Ahmed Sunny, Md Mahabub Uz Zaman
2022 A* conf
Local Differential Privacy Meets Computational Social Choice - Resilience under Voter Deletion.
IJCAI
Liangde Tao, Lin Chen, Lei Xu, Weidong Shi
2022 J jnl
Local Differential Privacy Meets Computational Social Choice - Resilience under Voter Deletion.
CoRR
Liangde Tao, Lin Chen, Lei Xu, Weidong Shi
2022 A* conf
Tight running times for minimum <italic>ℓ
SODA
Lin Chen, Liangde Tao, José Verschae
2021 — conf
Hardness and Algorithms for Electoral Manipulation Under Media Influence.
IJTCS-FAW
Liangde Tao, Lin Chen, Lei Xu, Shouhuai Xu, Zhimin Gao, Weidong Shi, Dian Huang
2021 A* conf
Scheduling Stochastic Jobs - Complexity and Approximation Algorithms.
ICAPS
Liangde Tao, Lin Chen, Guochuan Zhang
2021 J jnl
Tight running times for minimum 𝓁
CoRR
Lin Chen, Liangde Tao, José Verschae
2019 J jnl
Multiple Constrained Routing Algorithms in Large-Scaled Software Defined Networks.
CoRR
Chenyang Xu, Liangde Tao, Huajingling Wu, Deshi Ye, Guochuan Zhang