Number of minimum vertex cuts in transitive graphs. - Jixiang Meng; Zhao Zhang 002 (Discret. Math., 2003)

The transformation graph Gxyz when xyz=-++. - Baoyindureng Wu; Li Zhang 009; Zhao Zhang 002 (Discret. Math., 2005)

Restricted Edge Connectivity of Edge Transitive Graphs. - Zhao Zhang 002; Jixiang Meng (Ars Comb., 2006)

On optimally-lambda(3) transitive graphs. - Zhao Zhang 002; Jixiang Meng (Discret. Appl. Math., 2006)

Semi-hyper-connected edge transitive graphs. - Zhao Zhang 002; Jixiang Meng (Discret. Math., 2006)

Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs. - Xiaodong Liang; Jixiang Meng; Zhao Zhang 002 (Graphs Comb., 2007)

Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph. - Zhao Zhang 002; Xiaofeng Gao 001; Weili Wu 001 (COCOA, 2008)

(6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. - Xiaofeng Gao 001; Yaochun Huang; Zhao Zhang 002; Weili Wu 001 (COCOON, 2008)

Optimal Placements in Ring Network for Data Replicas in Distributed Database with MajorityVoting Protocol. - Zhao Zhang 002; Weili Wu 001; Shashi Shekhar 001 (ICDCS, 2008)

Minimum Power Strongly Connected Dominating Sets in Wireless Networks. - Deying Li 001; Hongwei Du 001; Peng-Jun Wan; Xiaofeng Gao 001; Zhao Zhang 002; Weili Wu 001 (ICWN, 2008)

Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks. - Donghyun Kim 001; Xianyue Li; Feng Zou; Zhao Zhang 002; Weili Wu 001 (WASA, 2008)

PTAS for Minimum Connected Dominating Set in Unit Ball Graph. - Zhao Zhang 002; Xiaofeng Gao 001; Weili Wu 001; Ding-Zhu Du (WASA, 2008)

Minimally restricted edge connected graphs. - Yanmei Hong; Qinghai Liu; Zhao Zhang 002 (Appl. Math. Lett., 2008)

Super-connected edge transitive graphs. - Zhao Zhang 002; Jixiang Meng (Discret. Appl. Math., 2008)

Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System. - Zhao Zhang 002; Xiaofeng Gao 001; Xuefei Zhang; Weili Wu 001; Hui Xiong 001 (DEXA, 2009)

Latency-Bounded Minimum Influential Node Selection in Social Networks. - Feng Zou; Zhao Zhang 002; Weili Wu 001 (WASA, 2009)

Minimally 3-restricted edge connected graphs. - Qinghai Liu; Yanmei Hong; Zhao Zhang 002 (Discret. Appl. Math., 2009)

Super-connected arc-transitive digraphs. - Jixiang Meng; Zhao Zhang 002 (Discret. Appl. Math., 2009)

Edges of degree k in minimally restricted k-edge connected graphs. - Yanmei Hong; Zhao Zhang 002; Qinghai Liu (Discret. Math., 2009)

On cyclic edge-connectivity of transitive graphs. - Bing Wang; Zhao Zhang 002 (Discret. Math., 2009)

Two Algorithms for Connected R-Hop k-Dominating Set. - Zhao Zhang 002; Qinghai Liu; Deying Li 001 (Discret. Math. Algorithms Appl., 2009)

A better constant-factor approximation for weighted dominating set in unit disk graph. - Yaochun Huang; Xiaofeng Gao 001; Zhao Zhang 002; Weili Wu 001 (J. Comb. Optim., 2009)

A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks. - Zhao Zhang 002; Xiaofeng Gao 001; Weili Wu 001; Ding-Zhu Du (J. Glob. Optim., 2009)

Optimal placements of replicas in a ring network with majority voting protocol. - Zhao Zhang 002; Weili Wu 001; Shashi Shekhar 001 (J. Parallel Distributed Comput., 2009)

Construction of strongly connected dominating sets in asymmetric multihop wireless networks. - Deying Li 001; Hongwei Du 001; Peng-Jun Wan; Xiaofeng Gao 001; Zhao Zhang 002; Weili Wu 001 (Theor. Comput. Sci., 2009)

Algorithms for connected set cover problem and fault-tolerant connected set cover problem. - Zhao Zhang 002; Xiaofeng Gao 001; Weili Wu 001 (Theor. Comput. Sci., 2009)

PTAS for connected vertex cover in unit disk graphs. - Zhao Zhang 002; Xiaofeng Gao 001; Weili Wu 001 (Theor. Comput. Sci., 2009)

Cyclic Vertex Connectivity of Star Graphs. - Zhihua Yu; Qinghai Liu; Zhao Zhang 002 (COCOA (1), 2010)

A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks. - Donghyun Kim 001; Wei Wang 032; Xianyue Li; Zhao Zhang 002; Weili Wu 001 (INFOCOM, 2010)

Double-super-connected digraphs. - Juan Liu 001; Jixiang Meng; Zhao Zhang 002 (Discret. Appl. Math., 2010)

The existence and upper bound for two types of restricted connectivity. - Qinghai Liu; Zhao Zhang 002 (Discret. Appl. Math., 2010)

Fast Information Propagation in Social Networks. - Feng Zou; James Willson; Zhao Zhang 002; Weili Wu 001 (Discret. Math. Algorithms Appl., 2010)

Sufficient conditions for a graph to be lambdak-optimal with given girth and diameter. - Zhao Zhang 002; Qinghai Liu (Networks, 2010)

A PTAS for minimum d-hop connected dominating set in growth-bounded graphs. - Xiaofeng Gao 001; Wei Wang 032; Zhao Zhang 002; Shiwei Zhu; Weili Wu 001 (Optim. Lett., 2010)

A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs. - Donghyun Kim 001; Zhao Zhang 002; Xianyue Li; Wei Wang 032; Weili Wu 001; Ding-Zhu Du (IEEE Trans. Mob. Comput., 2010)

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

Cyclic Connectivity of Star Graph. - Qinghai Liu; Zhao Zhang 002; Zhihua Yu (Discret. Math. Algorithms Appl., 2011)

PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs. - Lidan Fan; Zhao Zhang 002; Wei Wang 032 (J. Comb. Optim., 2011)

Super cyclically edge connected transitive graphs. - Zhao Zhang 002; Bing Wang (J. Comb. Optim., 2011)

On minimum submodular cover with submodular cost. - Hongjie Du; Weili Wu 001; Wonjun Lee 001; Qinghai Liu; Zhao Zhang 002; Ding-Zhu Du (J. Glob. Optim., 2011)

Preface. - Ding-Zhu Du; Yingfei Dong; Zhao Zhang 002 (Theor. Comput. Sci., 2011)

Edge fault tolerance of graphs with respect to super edge connectivity. - Yanmei Hong; Jixiang Meng; Zhao Zhang 002 (Discret. Appl. Math., 2012)

On the connectivity of p-diamond-free vertex transitive graphs. - Yingzhi Tian; Jixiang Meng; Zhao Zhang 002 (Discret. Appl. Math., 2012)

A New Proof for Zassenhaus-Groemer-Oler inequality. - Qinghai Liu; Xiang Li 010; Lidong Wu; Hai Du; Zhao Zhang 002; Weili Wu 001; Xiaodong Hu 001; Yinfeng Xu (Discret. Math. Algorithms Appl., 2012)

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

On cyclic vertex-connectivity of Cartesian product digraphs. - Da Huang; Zhao Zhang 002 (J. Comb. Optim., 2012)

Algorithms for the minimum weight k-fold (connected) dominating set problem. - Wenkai Ma; Deying Li 001; Zhao Zhang 002 (J. Comb. Optim., 2012)

Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks. - Wei Zhang 050; Zhao Zhang 002; Wei Wang 032; Feng Zou; Wonjun Lee 001 (J. Comb. Optim., 2012)

Radar placement along banks of river. - Zhao Zhang 002; Ding-Zhu Du (J. Glob. Optim., 2012)

An Analytic Model for Cluster-Based Wireless Sensor Networks. - Zhao Zhang 002; Wei Wayne Li; Jinting Wang (INFOR Inf. Syst. Oper. Res., 2013)

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

Constant-approximation for optimal data aggregation with physical interference. - Hongwei Du 001; Zhao Zhang 002; Weili Wu 001; Lidong Wu; Kai Xing (J. Glob. Optim., 2013)

Max-min weight balanced connected partition. - Lele Wang 004; Zhao Zhang 002; Di Wu; Weili Wu 001; Lidan Fan (J. Glob. Optim., 2013)

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

On Construction of Quality Fault-Tolerant Virtual Backbone in Wireless Networks. - Wei Wang 032; Donghyun Kim 001; Min Kyung An; Wei Gao; Xianyue Li; Zhao Zhang 002; Weili Wu 001 (IEEE/ACM Trans. Netw., 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)

On strongly Z2s-1-connected graphs. - Hong-Jian Lai; Yanting Liang; Juan Liu 001; Jixiang Meng; Zhengke Miao; Yehong Shao; Zhao Zhang 002 (Discret. Appl. Math., 2014)

On the existence of super edge-connected graphs with prescribed degrees. - Yingzhi Tian; Jixiang Meng; Hong-Jian Lai; Zhao Zhang 002 (Discret. Math., 2014)

The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs. - Fengxia Liu; Zhao Zhang 002; Jixiang Meng (Graphs Comb., 2014)

Spanning 3-connected index of graphs. - Wei Xiong 002; Zhao Zhang 002; Hong-Jian Lai (J. Comb. Optim., 2014)

A greedy algorithm for the fault-tolerant connected dominating set in a general graph. - Jiao Zhou; Zhao Zhang 002; Weili Wu 001; Kai Xing (J. Comb. Optim., 2014)

Minimum vertex cover in ball graphs through local search. - Zhao Zhang 002; Weili Wu 001; Lidan Fan; Ding-Zhu Du (J. Glob. Optim., 2014)

Approximation algorithm for the minimum weight connected k-subgraph cover problem. - Yaping Zhang; Yishuo Shi; Zhao Zhang 002 (Theor. Comput. Sci., 2014)

Fault-tolerant coverage with maximum lifetime in wireless sensor networks. - James Willson; Zhao Zhang 002; Weili Wu 001; Ding-Zhu Du (INFOCOM, 2015)

Approximation algorithm for minimum weight fault-tolerant virtual backbone in homogeneous wireless sensor network. - Zhao Zhang 002; Yishuo Shi (INFOCOM, 2015)

Approximation Algorithm for Minimum Weight (k, m)-CDS Problem in Unit Disk Graph. - Yishuo Shi; Zhao Zhang 002; Ding-Zhu Du (CoRR, 2015)

Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set. - Zhao Zhang 002; Jiao Zhou; Ker-I Ko; Ding-Zhu Du (CoRR, 2015)

Equitable total-coloring of subcubic graphs. - Hao Gui; Weifan Wang 001; Yiqiao Wang 002; Zhao Zhang 002 (Discret. Appl. Math., 2015)

Degree sequence realizations with given packing and covering of spanning trees. - Fengxia Liu; Zhao Zhang 002; Hong-Jian Lai; Meng Zhang 005 (Discret. Appl. Math., 2015)

Strongly connected dominating and absorbing set in directed disk graph. - Zhao Zhang 002; Weili Wu 001; Lidong Wu; Yanjie Li; Zongqing Chen 002 (Int. J. Sens. Networks, 2015)

A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs. - Limin Wang; Xiaoyan Zhang 001; Zhao Zhang 002; Hajo Broersma (Theor. Comput. Sci., 2015)

Preface. - Zhao Zhang 002; Lidong Wu; Ding-Zhu Du (Theor. Comput. Sci., 2015)

Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks. - Zhao Zhang 002; Jiao Zhou; Yuchang Mo; Ding-Zhu Du (INFOCOM, 2016)

Minimum cost seed set for competitive social influence. - Yuqing Zhu 002; Deying Li 001; Zhao Zhang 002 (INFOCOM, 2016)

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)

The 0-1 inverse maximum independent set problem on forests and unicyclic graphs. - Shuaifu Liu; Zhao Zhang 002 (Discret. Math. Algorithms Appl., 2016)

Restricted connectivity of total digraph. - Zhenhua Liu; Zhao Zhang 002 (Discret. Math. Algorithms Appl., 2016)

Approximation algorithms for minimum weight partial connected set cover problem. - Dongyue Liang; Zhao Zhang 002; Xianliang Liu; Wei Wang 032; Yaolin Jiang (J. Comb. Optim., 2016)

An approximation algorithm for maximum weight budgeted connected set cover. - Yingli Ran; Zhao Zhang 002; Ker-I Ko; Jun Liang (J. Comb. Optim., 2016)

A greedy algorithm for the minimum 2-connected m-fold dominating set problem. - Yishuo Shi; Yaping Zhang; Zhao Zhang 002; Weili Wu 001 (J. Comb. Optim., 2016)

Editorial for Special Issue: COCOA2014. - Zhao Zhang 002 (J. Comb. Optim., 2016)

Algorithms for the partial inverse matroid problem in which weights can only be increased. - Zhao Zhang 002; Shuangshuang Li; Hong-Jian Lai; Ding-Zhu Du (J. Glob. Optim., 2016)

Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs. - Zhao Zhang 002; Joonglyul Lee; Weili Wu 001; Ding-Zhu Du (Optim. Lett., 2016)

Algorithm for constraint partial inverse matroid problem with weight increase forbidden. - Shuangshuang Li; Zhao Zhang 002; Hong-Jian Lai (Theor. Comput. Sci., 2016)

Approximation algorithm for the balanced 2-connected k-partition problem. - Di Wu; Zhao Zhang 002; Weili Wu 001 (Theor. Comput. Sci., 2016)

Reliability Evaluation of Network Systems with Dependent Propagated Failures Using Decision Diagrams. - Yuchang Mo; Liudong Xing; Farong Zhong; Zhao Zhang 002 (IEEE Trans. Dependable Secur. Comput., 2016)

Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks. - Zhao Zhang 002; James Willson; Zaixin Lu; Weili Wu 001; Xuding Zhu; Ding-Zhu Du (IEEE/ACM Trans. Netw., 2016)

Networked Stochastic Multi-armed Bandits with Combinatorial Strategies. - Shaojie Tang 001; Yaqin Zhou; Kai Han 003; Zhao Zhang 002; Jing Yuan 002; Weili Wu 001 (ICDCS, 2017)

Viral marketing with positive influence. - Zhao Zhang 002; Yishuo Shi; James Willson; Ding-Zhu Du; Guangmo Tong (INFOCOM, 2017)

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)

Randomized Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem. - Yishuo Shi; Zhao Zhang 002; Ding-Zhu Du (CoRR, 2017)

Rating Protocol Design for Extortion and Cooperation in the Crowdsourcing Contest Dilemma. - Jianfeng Lu 002; Yun Xin; Zhao Zhang 002; Shaojie Tang 001; Songyuan Yan; Changbing Tang (CoRR, 2017)

PTAS for minimum k-path vertex cover in ball graph. - Zhao Zhang 002; Xiaoting Li; Yishuo Shi; Hongmei Nie; Yuqing Zhu 002 (Inf. Process. Lett., 2017)

Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence. - Zaixin Lu; Zhao Zhang 002; Weili Wu 001 (J. Comb. Optim., 2017)

Local ratio method on partial set multi-cover. - Yingli Ran; Yishuo Shi; Zhao Zhang 002 (J. Comb. Optim., 2017)

Approximation algorithm for partial positive influence problem in social network. - Yingli Ran; Zhao Zhang 002; Hongwei Du 001; Yuqing Zhu 002 (J. Comb. Optim., 2017)

A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks. - Limin Wang; Wenxue Du; Zhao Zhang 002; Xiaoyan Zhang 001 (J. Comb. Optim., 2017)

A simple approximation algorithm for minimum weight partial connected set cover. - Yubai Zhang; Yingli Ran; Zhao Zhang 002 (J. Comb. Optim., 2017)

A novel approach for detecting multiple rumor sources in networks with partial observations. - Zhao Zhang 002; Wen Xu 005; Weili Wu 001; Ding-Zhu Du (J. Comb. Optim., 2017)

iGreen: green scheduling for peak demand minimization. - Shaojie Tang 001; Jing Yuan 002; Zhao Zhang 002; Ding-Zhu Du (J. Glob. Optim., 2017)

Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs. - Yishuo Shi; Zhao Zhang 002; Yuchang Mo; Ding-Zhu Du (IEEE/ACM Trans. Netw., 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)

A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem. - Yishuo Shi; Zhao Zhang 002; Ding-Zhu Du (AAIM, 2018)

Primal Dual Algorithm for Partial Set Multi-cover. - Yingli Ran; Yishuo Shi; Zhao Zhang 002 (COCOA, 2018)

Approximating the k-Minimum Distance Rumor Source Detection in Online Social Networks. - Soklong Lim; Jun Hao; Zaixin Lu; Xuechen Zhang 001; Zhao Zhang 002 (ICCCN, 2018)

Primal dual based algorithm for degree-balanced spanning tree problem. - Yingli Ran; Zhihao Chen 003; Shaojie Tang 001; Zhao Zhang 002 (Appl. Math. Comput., 2018)

What network topology can tell in election prediction. - Zhihao Chen 003; Zhao Zhang 002 (Discret. Math. Algorithms Appl., 2018)

Supporting user authorization queries in RBAC systems by role-permission reassignment. - Jianfeng Lu 002; Yun Xin; Zhao Zhang 002; Hao Peng 002; Jianmin Han (Future Gener. Comput. Syst., 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)

Circumference of 3-connected cubic graphs. - Qinghai Liu; Xingxing Yu; Zhao Zhang 002 (J. Comb. Theory B, 2018)

Partial inverse maximum spanning tree in which weight can only be decreased under lp-norm. - Xianyue Li; Zhao Zhang 002; Ding-Zhu Du (J. Glob. Optim., 2018)

Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming. - Chenchen Wu; Yishui Wang; Zaixin Lu; Panos M. Pardalos; Dachuan Xu; Zhao Zhang 002; Ding-Zhu Du (Math. Program., 2018)

Performability Analysis of Large-Scale Multi-State Computing Systems. - Yuchang Mo; Lirong Cui; Liudong Xing; Zhao Zhang 002 (IEEE Trans. Computers, 2018)

Game-Theoretic Design of Optimal Two-Sided Rating Protocols for Service Exchange Dilemma in Crowdsourcing. - Jianfeng Lu 002; Yun Xin; Zhao Zhang 002; Xinwang Liu 002; Kenli Li 001 (IEEE Trans. Inf. Forensics Secur., 2018)

Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors. - Zhao Zhang 002; Weili Wu 001; Jing Yuan 002; Ding-Zhu Du (IEEE/ACM Trans. Netw., 2018)

Approximation Algorithms for the Minimum Power Partial Cover Problem. - Menghong Li; Yingli Ran; Zhao Zhang 002 (AAIM, 2019)

An Approximation Algorithm for the Dynamic k-level Facility Location Problem. - Limin Wang; Zhao Zhang 002; Dachuan Xu; Xiaoyan Zhang 001 (AAIM, 2019)

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

Multi-Level Two-Sided Rating Protocol Design for Service Exchange Contest Dilemma in Crowdsensing. - Jianfeng Lu 002; Shasha Yang 001; Zhao Zhang 002; Jianmin Han; Hao Peng 002; Zhao-Long Hu; Tian Wang 001 (IEEE Access, 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)

Extremality and Sharp Bounds for the k-edge-connectivity of Graphs. - Yuefang Sun; Xiaoyan Zhang 001; Zhao Zhang 002 (CoRR, 2019)

On Approximating Partial Set Cover and Generalizations. - Chandra Chekuri; Kent Quanrud; Zhao Zhang 002 (CoRR, 2019)

Maximisation of the number of β-view covered targets in visual sensor networks. - Ling Guo; Deying Li 001; Yongcai Wang; Zhao Zhang 002; Guangmo Tong; Weili Wu 001; Ding-Zhu Du (Int. J. Sens. Networks, 2019)

Quality of barrier cover with wireless sensors. - Weili Wu 001; Zhao Zhang 002; Chuangen Gao; Hai Du; Hua Wang; Ding-Zhu Du (Int. J. Sens. Networks, 2019)

Incentive Mechanism for Macrotasking Crowdsourcing: A Zero-Determinant Strategy Approach. - Changbing Tang; Xiang Li 010; Mengwen Cao; Zhao Zhang 002; Xinghuo Yu 001 (IEEE Internet Things J., 2019)

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

Approximation algorithm for the partial set multi-cover problem. - Yishuo Shi; Yingli Ran; Zhao Zhang 002; James Willson; Guangmo Tong; Ding-Zhu Du (J. Glob. 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)

移动边缘计算中的计算卸载策略研究综述 (Survey of Research on Computation Unloading Strategy in Mobile Edge Computing). - Siqi Dong; Hailong Li; Yuben Qu; Zhao Zhang 002; Lei Hu (计算机科学, 2019)

Approximation algorithm for minimum connected 3-path vertex cover. - Pengcheng Liu; Zhao Zhang 002; Xianyue Li; Weili Wu 001 (Discret. Appl. Math., 2020)

Task allocation based on node pair intimacy in wireless sensor networks. - Guisong Yang; Zhao Zhang 002; Jiangtao Wang 001; Xingyu He (IET Commun., 2020)

A primal-dual algorithm for the minimum partial set multi-cover problem. - Yingli Ran; Yishuo Shi; Changbing Tang; Zhao Zhang 002 (J. Comb. Optim., 2020)

Approximation algorithm for a generalized Roman domination problem in unit ball graphs. - Limin Wang; Yalin Shi; Zhao Zhang 002; Zan-Bo Zhang; Xiaoyan Zhang 001 (J. Comb. Optim., 2020)

Approximation algorithms for capacitated partial inverse maximum spanning tree problem. - Xianyue Li; Zhao Zhang 002; Ruowang Yang; Heping Zhang; Ding-Zhu Du (J. Glob. Optim., 2020)

Algorithm for Online 3-Path Vertex Cover. - Yubai Zhang; Zhao Zhang 002; Yishuo Shi; Xianyue Li (Theory Comput. Syst., 2020)

Data mule scheduling on a path with handling time and time span constraints. - Zhihao Chen 003; Zhao Zhang 002; Yingli Ran; Yishuo Shi; Ding-Zhu Du (Optim. Lett., 2020)

A game theoretic approach for minimal connected dominating set. - Xiuyang Chen; Zhao Zhang 002 (Theor. Comput. Sci., 2020)

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)

A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem. - Yishuo Shi; Yingli Ran; Zhao Zhang 002; Ding-Zhu Du (Theor. Comput. Sci., 2020)

Reliability Analysis of IoT Networks with Community Structures. - Yuchang Mo; Liudong Xing; Wenzhong Guo; Shaobin Cai; Zhao Zhang 002; Jianhui Jiang (IEEE Trans. Netw. Sci. Eng., 2020)

Edge Computing-Empowered Large-Scale Traffic Data Recovery Leveraging Low-Rank Theory. - Chaocan Xiang; Zhao Zhang 002; Yuben Qu; Dongyu Lu; Xiaochen Fan; Panlong Yang; Fan Wu 006 (IEEE Trans. Netw. Sci. Eng., 2020)

Online Rating Protocol Using Endogenous and Incremental Learning Design for Mobile Crowdsensing. - Jianfeng Lu 002; Yun Xin; Zhao Zhang 002; Fan Wu 006; Jianmin Han (IEEE Trans. Veh. Technol., 2020)

Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations. - Wei Liang; Zhao Zhang 002 (AAIM, 2021)

Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph. - Weizhi Hong; Zhao Zhang 002; Yingli Ran (COCOA, 2021)

Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l∞ -norm. - Xianyue Li; Ruowang Yang; Heping Zhang; Zhao Zhang 002 (COCOA, 2021)

PEEP: A Parallel Execution Engine for Permissioned Blockchain Systems. - Zhihao Chen 003; Xiaodong Qi; Xiaofan Du; Zhao Zhang 002; Cheqing Jin (DASFAA (3), 2021)

Laser Marking Hatch Contour Generation Algorithm. - Wangbao Zhou; Zonglin Jiang; Ying Zhang; Zhao Zhang 002 (ICAIIS, 2021)

Parallel approximation for partial set cover. - Yingli Ran; Ying Zhang; Zhao Zhang 002 (Appl. Math. Comput., 2021)

A Parallel Algorithm for Minimum Cost Submodular Cover. - Yingli Ran; Zhao Zhang 002 (CoRR, 2021)

Analysis of communication reliability in NarrowBand-IoT oriented wireless sensor networks. - Xingyu He; Tingting Liang; Zhao Zhang 002; Guisong Yang; Linghe Kong; Ming Liu 001 (IET Commun., 2021)

Breaking the rmax Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem. - Yingli Ran; Zhao Zhang 002; Shaojie Tang 001; Ding-Zhu Du (INFORMS J. Comput., 2021)

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)

Approximation algorithms for the dynamic k-level facility location problems. - Limin Wang; Zhao Zhang 002; Chenchen Wu; Dachuan Xu; Xiaoyan Zhang 001 (Theor. Comput. Sci., 2021)

Extortion and Cooperation in Rating Protocol Design for Competitive Crowdsourcing. - Jianfeng Lu 002; Yun Xin; Zhao Zhang 002; Shaojie Tang 001; Changbing Tang; Shaohua Wan 001 (IEEE Trans. Comput. Soc. Syst., 2021)

Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem. - Yingli Ran; Zhao Zhang 002; Shaojie Tang 001 (COLT, 2022)

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

Formulate Full View Camera Sensor Coverage by Using Group Set Coverage. - Hongwei Du 001; Zhao Zhang 002; Zhenhua Duan; Cong Tian; Ding-Zhu Du (WiCON, 2022)

Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set. - Chaojie Zhu; Yingli Ran; Zhao Zhang 002; Ding-Zhu Du (CoRR, 2022)

Approximation Algorithm for Minimum p Union Under a Geometric Setting. - Yingli Ran; Zhao Zhang 002 (CoRR, 2022)

Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems. - Yaoyao Zhang; Chaojie Zhu; Shaojie Tang 001; Ringli Ran; Ding-Zhu Du; Zhao Zhang 002 (CoRR, 2022)

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

Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage. - Zhao Zhang 002; Wei Liang; Hongmin W. Du; Siwen Liu (INFORMS J. Comput., 2022)

An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem. - Yubai Zhang; Zhao Zhang 002; Zhaohui Liu 001; Qirong Chen (Inf. Process. Lett., 2022)

Algorithms for covering multiple submodular constraints and applications. - Chandra Chekuri; Tanmay Inamdar 002; Kent Quanrud; Kasturi R. Varadarajan; Zhao Zhang 002 (J. Comb. Optim., 2022)

A primal-dual algorithm for the minimum power partial cover problem. - Menghong Li; Yingli Ran; Zhao Zhang 002 (J. Comb. Optim., 2022)

Partial inverse maximum spanning tree problem under the Chebyshev norm. - Xianyue Li; Ruowang Yang; Heping Zhang; Zhao Zhang 002 (J. Comb. Optim., 2022)

Computation and algorithm for the minimum k-edge-connectivity of graphs. - Yuefang Sun; Chenchen Wu; Xiaoyan Zhang 001; Zhao Zhang 002 (J. Comb. Optim., 2022)

The price of fairness for a two-agent scheduling game minimizing total completion time. - Yubai Zhang; Zhao Zhang 002; Zhaohui Liu 001 (J. Comb. Optim., 2022)

Nearly tight approximation algorithm for (connected) Roman dominating set. - Ke Li; Yingli Ran; Zhao Zhang 002; Ding-Zhu Du (Optim. Lett., 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)

Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph. - Weizhi Hong; Yingli Ran; Zhao Zhang 002 (Theor. Comput. Sci., 2022)

Approximation algorithm for prize-collecting sweep cover with base stations. - Wei Liang; Zhao Zhang 002 (Theor. Comput. Sci., 2022)

Toward Fairness-Aware Time-Sensitive Asynchronous Federated Learning for Critical Energy Infrastructure. - Jianfeng Lu 002; Haibo Liu; Zhao Zhang 002; Jiangtao Wang 001; Sotirios K. Goudos; Shaohua Wan 001 (IEEE Trans. Ind. Informatics, 2022)

A Green Stackelberg-game Incentive Mechanism for Multi-service Exchange in Mobile Crowdsensing. - Jianfeng Lu 002; Zhao Zhang 002; Jiangtao Wang 001; Ruixuan Li 001; Shaohua Wan 001 (ACM Trans. Internet Techn., 2022)

SChain: Scalable Concurrency over Flexible Permissioned Blockchain. - Xiaodong Qi; Zhihao Chen 003; Haizhen Zhuo; Quanqing Xu; Chengyu Zhu; Zhao Zhang 002; Cheqing Jin; Aoying Zhou; Ying Yan 002; Hui Zhang 002 (ICDE, 2023)

Improved Approximation Algorithm for Minimum-Weight (1, m)-Connected Dominating Set. - Jiao Zhou; Yingli Ran; Zhao Zhang 002; Shaojie Tang 001 (CoRR, 2023)

Approximation Algorithm for Unrooted Prize-Collecting Forest with Multiple Components and Its Application on Prize-Collecting Sweep Coverage. - Wei Liang; Zhao Zhang 002 (CoRR, 2023)

Proof-of-Prospect-Theory: A Novel Game-based Consensus Mechanism for Blockchain. - Yuqi Xie; Changbing Tang; Feilong Lin; Guanrong Chen; Zhao Zhang 002; Zhonglong Zheng (CoRR, 2023)

ChainDash: An Ad-Hoc Blockchain Data Analytics System. - Yushi Liu; Liwei Yuan; Zhihao Chen 003; Yekai Yu; Zhao Zhang 002; Cheqing Jin; Ying Yan 002 (Proc. VLDB Endow., 2023)

Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game. - Jie Chen 079; Kaiyi Luo; Changbing Tang; Zhao Zhang 002; Xiang Li 010 (IEEE CAA J. Autom. Sinica, 2023)

Construction of minimum edge-fault tolerant connected dominating set in a general graph. - Yaoyao Zhang; Zhao Zhang 002; Ding-Zhu Du (J. Comb. Optim., 2023)

Capitalize Your Data: Optimal Selling Mechanisms for IoT Data Exchange. - Qinya Li; Zun Li 002; Zhenzhe Zheng; Fan Wu 006; Shaojie Tang 001; Zhao Zhang 002; Guihai Chen (IEEE Trans. Mob. Comput., 2023)

Approximation algorithm for (connected) Italian dominating function. - Ke Li; Zhao Zhang 002 (Discret. Appl. Math., 2023)

A Game Theoretic Approach for a Minimal Secure Dominating Set. - Xiuyang Chen; Changbing Tang; Zhao Zhang 002 (IEEE CAA J. Autom. Sinica, 2023)

A Distributed Approximation Algorithm for the Total Dominating Set Problem. - Limin Wang; Zhao Zhang 002; Donglei Du; Yaping Mao; Xiaoyan Zhang 001 (AAIM (1), 2024)

Approximation Algorithm for the Maximum Interval Multi-cover Problem. - Yuxuan Xu; Yingli Ran; Zhao Zhang 002 (AAIM (1), 2024)

Minimum Power Partial Cover with Fairness Constraint. - Chensheng Ma; Zhao Zhang 002 (COCOA (1), 2024)

AdvLoRA: Adversarial Low-Rank Adaptation of Vision-Language Models. - Yuheng Ji; Yue Liu 008; Zhicheng Zhang; Zhao Zhang 002; Yuting Zhao; Gang Zhou; Xingwei Zhang; Xinwang Liu 002; Xiaolong Zheng 001 (CoRR, 2024)

A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors. - Wei Liang; Shaojie Tang 001; Zhao Zhang 002 (CoRR, 2024)

Algorithm for partial sweep coverage on a line. - Lei Zhao; Zhao Zhang 002 (Discret. Appl. Math., 2024)

Adaptive Influence Maximization: Adaptability via Nonadaptability. - Hongmin W. Du; Yingfan L. Du; Zhao Zhang 002 (INFORMS J. Comput., 2024)

Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio. - Yaoyao Zhang; Chaojie Zhu; Shaojie Tang 001; Yingli Ran; Ding-Zhu Du; Zhao Zhang 002 (INFORMS J. Comput., 2024)

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)

Incentivizing Proportional Fairness for Multi-Task Allocation in Crowdsensing. - Jianfeng Lu 002; Haibo Liu; Riheng Jia; Zhao Zhang 002; Xiong Wang 006; Jiangtao Wang 001 (IEEE Trans. Serv. Comput., 2024)

Selfish bin packing with punishment. - Ling Gai; Weiwei Zhang; Zhao Zhang 002 (Theor. Comput. Sci., 2024)

A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems. - Wei Liang; Zhao Zhang 002; Ding-Zhu Du (Optim. Lett., 2024)

A Game-Enabled Blockchain Consensus and Incentive Mechanism for Secure and Efficient Mobile Crowdsensing. - Changbing Tang; Zheng Bao; Xusheng Cai; Feilong Lin; Zhao Zhang 002; Guanrong Chen (IEEE Syst. J., 2024)

Approximation algorithms for maximum weighted target cover problem with distance limitations. - Jianhong Jin; Yingli Ran; Zhao Zhang 002 (J. Comb. Optim., 2024)

Approximation algorithm for the minimum partial connected Roman dominating set problem. - Yaoyao Zhang; Zhao Zhang 002; Ding-Zhu Du (J. Comb. Optim., 2024)

Full View Maximum Coverage of Camera Sensors: Moving Object Monitoring. - Hongwei Du 001; Jingfang Su; Zhao Zhang 002; Zhenhua Duan; Cong Tian; Ding-Zhu Du (ACM Trans. Sens. Networks, 2024)

Spectrum: Speedy and Strictly-Deterministic Smart Contract Transactions for Blockchain Ledgers. - Zhihao Chen 003; Tianji Yang; Yixiao Zheng; Zhao Zhang 002; Cheqing Jin; Aoying Zhou (Proc. VLDB Endow., 2024)

Approximation algorithm for prize-collecting vertex cover with fairness constraints. - Mingchao Zhou; Zhao Zhang 002; Ding-Zhu Du (J. Comb. Optim., 2024)

Approximation algorithm for min sweep-period sweep cover with distance constraint. - Yidong Zhang; Zhao Zhang 002 (Discret. Math. Algorithms Appl., 2024)

Exploring two new iterative methods for solving absolute value equations. - Rashid Ali; Zhao Zhang 002 (J. Appl. Math. Comput., 2024)

Enhancing Adversarial Robustness of Vision-Language Models through Low-Rank Adaptation. - Yuheng Ji; Yue Liu 008; Zhicheng Zhang; Zhao Zhang 002; Yuting Zhao; Xiaoshuai Hao; Gang Zhou; Xingwei Zhang; Xiaolong Zheng 001 (ICMR, 2025)

Approximation algorithm for prize-collecting weighted set cover with fairness constraints. - Mingchao Zhou; Zhao Zhang 002 (Discret. Appl. Math., 2025)

A New Approximation Algorithm for Minimum-Weight (1,m)-Connected Dominating Set. - Jiao Zhou; Yingli Ran; Panos M. Pardalos; Zhao Zhang 002; Shaojie Tang 001; Ding-Zhu Du (INFORMS J. Comput., 2025)

A parallel algorithm for minimum weight set cover with small neighborhood property. - Yingli Ran; Yaoyao Zhang; Zhao Zhang 002 (J. Parallel Distributed Comput., 2025)

A 1/2-approximation algorithm for maximum interval multi-cover. - Yuxuan Xu; Yingli Ran; Zhao Zhang 002 (Theor. Comput. Sci., 2025)

Yoimiya: A Scalable Framework for Optimal Resource Utilization in ZK-SNARK Systems. - Zheming Ye; Xiaodong Qi; Zhao Zhang 002; Cheqing Jin (CoRR, 2025)

Approximation Algorithm for the Minimum Interval Partial Multi-Cover Problem. - Yingli Ran; Jianhong Jin; Zhao Zhang 002 (Networks, 2025)

A Game-Theoretic Approach to Solving the Roman Domination Problem. - Xiuyang Chen; Changbing Tang; Zhao Zhang 002; Guanrong Chen (IEEE CAA J. Autom. Sinica, 2025)

An approximation algorithm for the prize-collecting connected dominating set problem. - Yaoyao Zhang; Zhao Zhang 002; Ding-Zhu Du (Optim. Lett., 2025)