Definable Filters in the Structure of Bounded Turing Reductions. - Angsheng Li; Weilin Li; Yicheng Pan 001; Linqing Tang (TAMC, 2008)

Derandomizing Graph Tests for Homomorphism. - Angsheng Li; Linqing Tang (TAMC, 2008)

Conditional Hardness of Approximating Satisfiable Max 3CSP-q. - Linqing Tang (ISAAC, 2009)

Principal filters definable by parameters in EbT. - Angsheng Li; Weilin Li; Yicheng Pan 001; Linqing Tang (Math. Struct. Comput. Sci., 2009)

The Complexity and Approximability of Minimum Contamination Problems. - Angsheng Li; Linqing Tang (TAMC, 2011)

Approximation and hardness results for label cut and related problems. - Peng Zhang 008; Jin-yi Cai; Linqing Tang; Wenbo Zhao 001 (J. Comb. Optim., 2011)

On the derandomization of the graph test for homomorphism over groups. - Linqing Tang (Theor. Comput. Sci., 2011)

Approximating Minimum Label s-t Cut via Linear Programming. - Linqing Tang; Peng Zhang 008 (LATIN, 2012)

Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem. - Peng Zhang 008; Bin Fu; Linqing Tang (Algorithmica, 2018)

Minimum Label s-t Cut has Large Integrality Gaps. - Peng Zhang 008; Linqing Tang (CoRR, 2019)

Minimum Label s-t Cut has large integrality gaps. - Peng Zhang 008; Linqing Tang (Inf. Comput., 2020)