Restricted Edge Connectivity of Harary Graphs. - Qinghai Liu; Xiaohui Huang 001; Zhao Zhang 002 (COCOA, 2011)

Diameter Vulnerability of Directed cycles and Directed Tori. - Xiaoyan Ma; Xiaohui Huang 001; Zhao Zhang 002 (Discret. Math. Algorithms Appl., 2012)

A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs. - Xiangming Yu; Xiaohui Huang 001; Zhao Zhang 002 (Inf. Sci., 2013)

Optimally restricted edge connected elementary Harary graphs. - Qinghai Liu; Xiaohui Huang 001; Zhao Zhang 002 (Theor. Comput. Sci., 2013)

Approximation Algorithm for the Minimum Connected k -Path Vertex Cover Problem. - Xiaosong Li; Zhao Zhang 002; Xiaohui Huang 001 (COCOA, 2014)

Approximation Algorithm for the Balanced 2-Connected Bipartition Problem. - Di Wu; Zhao Zhang 002; Weili Wu 001; Xiaohui Huang 001 (COCOON, 2014)

Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set. - Zhao Zhang 002; Jiao Zhou; Xiaohui Huang 001; Ding-Zhu Du (CoRR, 2016)

Approximation Approximation for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks. - Jiao Zhou; Zhao Zhang 002; Xiaohui Huang 001; Ding-Zhu Du (CoRR, 2016)

Approximation algorithms for minimum (weight) connected k-path vertex cover. - Xiaosong Li; Zhao Zhang 002; Xiaohui Huang 001 (Discret. Appl. Math., 2016)

A Simpler Method to Obtain a PTAS for Connected k-Path Vertex Cover in Unit Disk Graph. - Zhao Zhang 002; Xiaohui Huang 001; Lina Chen (WASA, 2017)

Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network. - Jiao Zhou; Zhao Zhang 002; Shaojie Tang 001; Xiaohui Huang 001; Yuchang Mo; Ding-Zhu Du (IEEE/ACM Trans. Netw., 2017)

PTAS for H-free node deletion problems in disk graphs. - Xiaosong Li; Yishuo Shi; Xiaohui Huang 001 (Discret. Appl. Math., 2018)

Approximation algorithm for distance constraint sweep coverage without predetermined base stations. - Qingqing Chen; Xiaohui Huang 001; Yingli Ran (Discret. Math. Algorithms Appl., 2018)

Approximation algorithm for partial set multicover versus full set multicover. - Pengcheng Liu; Xiaohui Huang 001 (Discret. Math. Algorithms Appl., 2018)

Computing Minimum k-Connected m-Fold Dominating Set in General Graphs. - Zhao Zhang 002; Jiao Zhou; Shaojie Tang 001; Xiaohui Huang 001; Ding-Zhu Du (INFORMS J. Comput., 2018)

Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set. - Jiao Zhou; Zhao Zhang 002; Shaojie Tang 001; Xiaohui Huang 001; Ding-Zhu Du (INFORMS J. Comput., 2018)

A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network. - Lina Chen; Xiaohui Huang 001; Zhao Zhang 002 (J. Comb. Optim., 2018)

Improved Approximation Algorithm for Minimum Weight k-Subgraph Cover Problem. - Pengcheng Liu; Xiaohui Huang 001; Zhao Zhang 002 (COCOA, 2019)

Approximation algorithms for minimum weight connected 3-path vertex cover. - Yingli Ran; Zhao Zhang 002; Xiaohui Huang 001; Xiaosong Li; Ding-Zhu Du (Appl. Math. Comput., 2019)

Approximation algorithms for distance constraint sweep coverage with base stations. - Jian Liang; Xiaohui Huang 001; Zhao Zhang 002 (J. Comb. Optim., 2019)

Online hole healing for sensor coverage. - Zhao Zhang 002; Zaixin Lu; Xianyue Li; Xiaohui Huang 001; Ding-Zhu Du (J. Glob. Optim., 2019)

Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs. - Pengcheng Liu; Zhao Zhang 002; Xiaohui Huang 001 (Theor. Comput. Sci., 2020)

Approximation algorithm for minimum weight connected-k-subgraph cover. - Pengcheng Liu; Zhao Zhang 002; Xiaohui Huang 001 (Theor. Comput. Sci., 2020)

Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks. - Yingli Ran; Xiaohui Huang 001; Zhao Zhang 002; Ding-Zhu Du (J. Glob. Optim., 2021)

Minimum power partial multi-cover on a line. - Wei Liang; Menghong Li; Zhao Zhang 002; Xiaohui Huang 001 (Theor. Comput. Sci., 2021)

Computing Connected-k-Subgraph Cover with Connectivity Requirement. - Pengcheng Liu; Zhao Zhang 002; Yingli Ran; Xiaohui Huang 001 (TAMC, 2022)

A distributed algorithm for a set cover game. - Chaojie Zhu; Xiaohui Huang 001; Zhao Zhang 002 (Discret. Math. Algorithms Appl., 2022)

Approximation algorithm for minimum partial multi-cover under a geometric setting. - Yingli Ran; Xiaohui Huang 001; Zhao Zhang 002; Ding-Zhu Du (Optim. Lett., 2022)

Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs. - Pengcheng Liu; Zhao Zhang 002; Yingli Ran; Xiaohui Huang 001 (Math. Struct. Comput. Sci., 2024)