Total Dual Integrality of Triangle Covering. - Xujin Chen; Zhuo Diao; Xiao-Dong Hu 001; Zhongzheng Tang (COCOA, 2016)

Sufficient Conditions for Tuza's Conjecture on Packing and Covering Triangles. - Xujin Chen; Zhuo Diao; Xiao-Dong Hu 001; Zhongzheng Tang (IWOCA, 2016)

Algorithms for the Ring Star Problem. - Xujin Chen; Xiaodong Hu 001; Zhongzheng Tang; Chenhao Wang 001; Ying Zhang (COCOA (2), 2017)

Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance. - Xujin Chen; Xiaodong Hu 001; Xiaohua Jia; Minming Li; Zhongzheng Tang; Chenhao Wang 001 (SAGT, 2018)

Approximation algorithms on k-cycle covering and k-clique covering. - Zhongzheng Tang; Zhuo Diao (CoRR, 2018)

Covering Triangles in Edge-Weighted Graphs. - Xujin Chen; Zhuo Diao; Xiaodong Hu 001; Zhongzheng Tang (Theory Comput. Syst., 2018)

SNIFF: A Scalable Network Inference Framework for Measuring End-to-End Performance Based on Matrix Completion. - Luning Wang; Zhongzheng Tang; Qian Xu 010; Kejie Lu; Jianping Wang 001; Kui Wu 001; Xiaohua Jia (BigCom, 2019)

Noise-Resilient Similarity Preserving Network Embedding for Social Networks. - Zhenyu Qiu; Wenbin Hu 001; Jia Wu 001; Zhongzheng Tang; Xiaohua Jia (IJCAI, 2019)

Coded multicasting in cache-enabled vehicular ad hoc network. - Haizhou Bao; Chuanhe Huang; Zhongzheng Tang; Qihui Li; Qiufen Ni; Xiaodai Dong; Bin Fu (Comput. Networks, 2019)

Approximation Algorithms for Balancing Signed Graphs. - Zhuo Diao; Zhongzheng Tang (AAIM, 2020)

Packing and Covering Triangles in Dense Random Graphs. - Zhongzheng Tang; Zhuo Diao (COCOA, 2020)

Price of Fairness in Budget Division for Egalitarian Social Welfare. - Zhongzheng Tang; Chenhao Wang 001; Mengqi Zhang (COCOA, 2020)

Mechanism Design for Facility Location Games with Candidate Locations. - Zhongzheng Tang; Chenhao Wang 001; Mengqi Zhang; Yingchao Zhao 001 (COCOA, 2020)

On the Feedback Number of 3-Uniform Linear Extremal Hypergraphs. - Zhongzheng Tang; Yucong Tang; Zhuo Diao (COCOA, 2021)

On maximizing a monotone k-submodular function under a knapsack constraint. - Zhongzheng Tang; Chenhao Wang 001; Hau Chan (CoRR, 2021)

Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game. - Xujin Chen; Xiaodong Hu 001; Zhongzheng Tang; Chenhao Wang 001 (Inf. Process. Lett., 2021)

Algorithms for the metric ring star problem with fixed edge-cost ratio. - Xujin Chen; Xiao-Dong Hu 001; Xiaohua Jia; Zhongzheng Tang; Chenhao Wang 001; Ying Zhang (J. Comb. Optim., 2021)

On the Transversal Number of k-Uniform Connected Hypergraphs. - Zian Chen; Bin Chen 020; Zhongzheng Tang; Zhuo Diao (AAIM, 2022)

Monotone k-Submodular Knapsack Maximization: An Analysis of the Greedy+Singleton Algorithm. - Jingwen Chen; Zhongzheng Tang; Chenhao Wang 001 (AAIM, 2022)

Some New Results on Gallai Theorem and Perfect Matching for k-Uniform Hypergraphs. - Zhongzheng Tang; Zhuo Diao (COCOON, 2022)

On the Transversal Number of Rank k Hypergraphs. - Zhongzheng Tang; Zhuo Diao (FAW, 2022)

SIC-based Precoding Scheme with Sub-connected Architecture for MIMO VLC Systems. - Congcong Wang; Yang Yang 057; Zhaohui Yang 001; Chunyan Feng; Zhongzheng Tang (GLOBECOM, 2022)

Triangle packing and covering in dense random graphs. - Zhongzheng Tang; Zhuo Diao (J. Comb. Optim., 2022)

Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number. - Zhongzheng Tang; Yucong Tang; Zhuo Diao (J. Comb. Optim., 2022)

On maximizing a monotone k-submodular function under a knapsack constraint. - Zhongzheng Tang; Chenhao Wang 001; Hau Chan (Oper. Res. Lett., 2022)

Monotone k-submodular secretary problems: Cardinality and knapsack constraints. - Zhongzheng Tang; Chenhao Wang 001; Hau Chan (Theor. Comput. Sci., 2022)

SNIFF: A Scalable Network Inference Framework for Measuring End-to-End Performance. - Zhongzheng Tang; Luning Wang; Qian Xu 010; Kejie Lu; Jianping Wang 001; Kui Wu 001; Xiaohua Jia (IEEE Trans. Netw. Sci. Eng., 2022)

Some Combinatorial Algorithms on the Dominating Number of Anti-rank k Hypergraphs. - Zhuo Diao; Zhongzheng Tang (COCOA (2), 2023)

Greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization. - Zhongzheng Tang; Jingwen Chen; Chenhao Wang 001; Tian Wang 001; Weijia Jia 001 (COCOA (1), 2023)

Profit Maximization for Competitive Influence Spread in Social Networks. - Qiufen Ni; Yun Bai; Zhongzheng Tang (COCOON (2), 2023)

Improved Analysis of Greedy Algorithm on k-Submodular Knapsack. - Zhongzheng Tang; Chenhao Wang 001 (ECAI, 2023)

An Improved Analysis of the Greedy+Singleton Algorithm for k-Submodular Knapsack Maximization. - Zhongzheng Tang; Jingwen Chen; Chenhao Wang 001 (IJTCS-FAW, 2023)

On the Matching Number of k-Uniform Connected Hypergraphs with Maximum Degree. - Zhongzheng Tang; Haoyang Zou; Zhuo Diao (IJTCS-FAW, 2023)

A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size. - Zian Chen; Bin Chen; Zhongzheng Tang; Zhuo Diao (J. Comb. Optim., 2023)

Data Placement and Transmission Scheduling for coded multicast in mobile edge networks. - Zhongzheng Tang; Nuo Yu; Xiaohua Jia; Xiaodong Hu 001 (Comput. Commun., 2023)

Approximation Algorithms on k-Correlation Clustering of Uniform Hypergraphs. - Zhongzheng Tang; Yaxuan Li; Zhuo Diao (COCOA (1), 2024)

Some Combinatorial Algorithms on the Edge Cover Number of k-Regular Connected Hypergraphs. - Zhongzheng Tang; Yaxuan Li; Zhuo Diao (TAMC, 2024)

When does additional information lead to longer travel time in multi-origin-destination networks? - Xujin Chen; Xiaodong Hu 001; Xinqi Jing; Zhongzheng Tang (CoRR, 2024)

Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization. - Zhongzheng Tang; Jingwen Chen; Chenhao Wang 001 (Theor. Comput. Sci., 2024)

A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R. - Zhongzheng Tang; Haoyang Zou; Zhuo Diao (Acta Informatica, 2025)

Degree and betweenness-based label propagation for community detection. - Qiufen Ni; Jun Wang; Zhongzheng Tang (J. Comb. Optim., 2025)

A sharp upper bound for the edge dominating number of hypergraphs with minimum degree. - Zhongzheng Tang; Zhuo Diao (J. Comb. Optim., 2025)