default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhao Zhang 0002
Person information
- affiliation: Zhejiang Normal University, College of Mathematics Physics and Information Engineering, Jinhua, China
- affiliation (1999 - 2014): Xinjiang University, College of Mathematics and System Sciences, Urmuqi, China
Other persons with the same name
- Zhao Zhang — disambiguation page
- Zhao Zhang 0001
![[0000-0002-5703-7969]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5703-7969")
— Hefei University of Technology, School of Computer Science and Information Engineering (School of Artificial Intelligence), China (and 2 more) - Zhao Zhang 0003 — Northeastern University, School of Information Science and Engineering, Shenyang, China
- Zhao Zhang 0004 — Chinese Academy of Sciences, Institute of Semiconductors, Beijing, China
- Zhao Zhang 0005 — Nanjing Forestry University, Department of Computer Science and Technology, China
- Zhao Zhang 0006 — Heriot-Watt University, Edinburgh, UK (and 1 more)
- Zhao Zhang 0007 — University of Texas at Austin, Texas Advanced Computing Center, Austin, TX, USA (and 2 more)
- Zhao Zhang 0008 — University of Illinois at Chicago, IL, USA
- Zhao Zhang 0009 — Guilin University of Electronic Technology, Guangxi Key Laboratory of Trusted Software, China (and 1 more)
- Zhao Zhang 0010 — Iowa State University, Department of Electrical and Computer Engineering, Ames, IA, USA (and 1 more)
- Zhao Zhang 0011 — Chinese Academy of Sciences, Institute of Computing Technology, Key Lab of Intelligent Information Processing, Beijing, China
- Zhao Zhang 0012 — University of Texas, Health Science Center, San Antonio, TX, USA (and 1 more)
- Zhao Zhang 0013 — Dalian University of Technology, Faculty of Vehicle Engineering and Mechanics, Department of Engineering Mechanics, China
- Zhao Zhang 0014 — Beihang University, School of Transportation Science and Engineering, Beijing, China (and 2 more)
- Zhao Zhang 0015 — Nanchang Hangkong University, School of Information Technology, China
- Zhao Zhang 0016 — North Dakota State University, Department of Agricultural and Biosystems Engineering, Fargo, ND, USA (and 1 more)
- Zhao Zhang 0017 — Tianjin University, School of Precision Instrument and Opto-electronics Engineering, China
- Zhao Zhang 0018 — Nankai University, College of Computer Science, TKLNDST, Tianjin, China (and 1 more)
- Zhao Zhang 0019 — Qilu University of Technology (Shandong Academy of Sciences), School of Electrical Engineering and Automation, Jinan, China
- Zhao Zhang 0020 — Nanjing University of Aeronautics and Astronautics, College of Automation Engineering, China
- Zhao Zhang 0021 — PLA Information Engineering University, Zhengzhou Information Science and Technology Institute, China
- Zhao Zhang 0022 — University of Lorraine, CNRS Loria, Nancy, France
- Zhao Zhang 0023 — Beijing University of Posts and Telecommunication, School of Electronic Engineering, China
- Zhao Zhang 0024 — Tsinghua University, Department of Automation, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j153]Lei Zhao, Zhao Zhang:
Algorithm for partial sweep coverage on a line. Discret. Appl. Math. 359: 220-228 (2024)- [j152]Yaoyao Zhang, Chaojie Zhu, Shaojie Tang, Yingli Ran, Ding-Zhu Du, Zhao Zhang:
Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio. INFORMS J. Comput. 36(2): 510-525 (2024) - [j151]Hongmin W. Du, Yingfan L. Du, Zhao Zhang:
Adaptive Influence Maximization: Adaptability via Nonadaptability. INFORMS J. Comput. 36(5): 1190-1200 (2024) - [j150]Jianhong Jin, Yingli Ran, Zhao Zhang:
Approximation algorithms for maximum weighted target cover problem with distance limitations. J. Comb. Optim. 47(4): 60 (2024) - [j149]Yaoyao Zhang, Zhao Zhang, Ding-Zhu Du:
Approximation algorithm for the minimum partial connected Roman dominating set problem. J. Comb. Optim. 47(4): 62 (2024) - [j148]Mingchao Zhou, Zhao Zhang, Ding-Zhu Du:
Approximation algorithm for prize-collecting vertex cover with fairness constraints. J. Comb. Optim. 48(3): 20 (2024) - [j147]Pengcheng Liu, Zhao Zhang, Yingli Ran, Xiaohui Huang:
Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs. Math. Struct. Comput. Sci. 34(3): 180-192 (2024) - [j146]Wei Liang, Zhao Zhang, Ding-Zhu Du:
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems. Optim. Lett. 18(2): 575-589 (2024) - [j145]Zhihao Chen, Tianji Yang, Yixiao Zheng, Zhao Zhang, Cheqing Jin, Aoying Zhou:
Spectrum: Speedy and Strictly-Deterministic Smart Contract Transactions for Blockchain Ledgers. Proc. VLDB Endow. 17(10): 2541-2554 (2024) - [j144]Changbing Tang, Zheng Bao, Xusheng Cai, Feilong Lin, Zhao Zhang, Guanrong Chen:
A Game-Enabled Blockchain Consensus and Incentive Mechanism for Secure and Efficient Mobile Crowdsensing. IEEE Syst. J. 18(1): 210-221 (2024) - [j143]Ling Gai, Weiwei Zhang, Zhao Zhang:
Selfish bin packing with punishment. Theor. Comput. Sci. 982: 114276 (2024) - [j142]Hongwei Du, Jingfang Su, Zhao Zhang, Zhenhua Duan, Cong Tian, Ding-Zhu Du:
Full View Maximum Coverage of Camera Sensors: Moving Object Monitoring. ACM Trans. Sens. Networks 20(3): 63:1-63:23 (2024) - [j141]Jianfeng Lu, Haibo Liu, Riheng Jia, Zhao Zhang, Xiong Wang, Jiangtao Wang:
Incentivizing Proportional Fairness for Multi-Task Allocation in Crowdsensing. IEEE Trans. Serv. Comput. 17(3): 990-1000 (2024) - [c36]Limin Wang, Zhao Zhang, Donglei Du, Yaping Mao, Xiaoyan Zhang:
A Distributed Approximation Algorithm for the Total Dominating Set Problem. AAIM (1) 2024: 122-132 - [e4]Smita Ghosh, Zhao Zhang:
Algorithmic Aspects in Information and Management - 18th International Conference, AAIM 2024, Virtual Event, September 21-23, 2024, Proceedings, Part I. Lecture Notes in Computer Science 15179, Springer 2024, ISBN 978-981-97-7797-6 [contents] - [e3]Smita Ghosh, Zhao Zhang:
Algorithmic Aspects in Information and Management - 18th International Conference, AAIM 2024, Virtual Event, September 21-23, 2024, Proceedings, Part II. Lecture Notes in Computer Science 15180, Springer 2024, ISBN 978-981-97-7800-3 [contents] - [i19]Wei Liang, Shaojie Tang, Zhao Zhang:
A Constant-Approximation Algorithm for Budgeted Sweep Coverage with Mobile Sensors. CoRR abs/2408.12468 (2024) - 2023
- [j140]Ke Li, Zhao Zhang:
Approximation algorithm for (connected) Italian dominating function. Discret. Appl. Math. 341: 169-179 (2023) - [j139]Jie Chen, Kaiyi Luo, Changbing Tang, Zhao Zhang, Xiang Li:
Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game. IEEE CAA J. Autom. Sinica 10(2): 512-523 (2023) - [j138]Xiuyang Chen, Changbing Tang, Zhao Zhang:
A Game Theoretic Approach for a Minimal Secure Dominating Set. IEEE CAA J. Autom. Sinica 10(12): 2258-2268 (2023) - [j137]Yaoyao Zhang, Zhao Zhang, Ding-Zhu Du:
Construction of minimum edge-fault tolerant connected dominating set in a general graph. J. Comb. Optim. 45(2): 63 (2023) - [j136]Yushi Liu, Liwei Yuan, Zhihao Chen, Yekai Yu, Zhao Zhang, Cheqing Jin, Ying Yan:
ChainDash: An Ad-Hoc Blockchain Data Analytics System. Proc. VLDB Endow. 16(12): 4022-4025 (2023) - [j135]Qinya Li, Zun Li, Zhenzhe Zheng, Fan Wu, Shaojie Tang, Zhao Zhang, Guihai Chen:
Capitalize Your Data: Optimal Selling Mechanisms for IoT Data Exchange. IEEE Trans. Mob. Comput. 22(4): 1988-2000 (2023) - [c35]Xiaodong Qi, Zhihao Chen, Haizhen Zhuo, Quanqing Xu, Chengyu Zhu, Zhao Zhang, Cheqing Jin, Aoying Zhou, Ying Yan, Hui Zhang:
SChain: Scalable Concurrency over Flexible Permissioned Blockchain. ICDE 2023: 1901-1913 - [i18]Jiao Zhou, Yingli Ran, Zhao Zhang, Shaojie Tang:
Improved Approximation Algorithm for Minimum-Weight (1, m)-Connected Dominating Set. CoRR abs/2301.09247 (2023) - [i17]Xiuyang Chen, Changbing Tang, Zhao Zhang, Guanrong Chen:
A Game-Theoretic Approach to Solving the Roman Domination Problem. CoRR abs/2302.02313 (2023) - [i16]Wei Liang, Zhao Zhang:
Approximation Algorithm for Unrooted Prize-Collecting Forest with Multiple Components and Its Application on Prize-Collecting Sweep Coverage. CoRR abs/2306.13996 (2023) - [i15]Yuqi Xie, Changbing Tang, Feilong Lin, Guanrong Chen, Zhao Zhang, Zhonglong Zheng:
Proof-of-Prospect-Theory: A Novel Game-based Consensus Mechanism for Blockchain. CoRR abs/2309.09529 (2023) - 2022
- [j134]Chaojie Zhu, Xiaohui Huang, Zhao Zhang:
A distributed algorithm for a set cover game. Discret. Math. Algorithms Appl. 14(3): 2150127:1-2150127:11 (2022) - [j133]Zhao Zhang, Wei Liang, Hongmin W. Du, Siwen Liu:
Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage. INFORMS J. Comput. 34(5): 2675-2685 (2022) - [j132]Yubai Zhang, Zhao Zhang, Zhaohui Liu, Qirong Chen:
An asymptotically tight online algorithm for m-Steiner Traveling Salesman Problem. Inf. Process. Lett. 174: 106177 (2022) - [j131]Yuefang Sun, Chenchen Wu, Xiaoyan Zhang, Zhao Zhang:
Computation and algorithm for the minimum k-edge-connectivity of graphs. J. Comb. Optim. 44(3): 1741-1752 (2022) - [j130]Menghong Li, Yingli Ran, Zhao Zhang:
A primal-dual algorithm for the minimum power partial cover problem. J. Comb. Optim. 44(3): 1913-1923 (2022) - [j129]Yubai Zhang, Zhao Zhang, Zhaohui Liu:
The price of fairness for a two-agent scheduling game minimizing total completion time. J. Comb. Optim. 44(3): 2104-2122 (2022) - [j128]Xianyue Li, Ruowang Yang, Heping Zhang, Zhao Zhang:
Partial inverse maximum spanning tree problem under the Chebyshev norm. J. Comb. Optim. 44(5): 3331-3350 (2022) - [j127]Yingli Ran, Xiaohui Huang, Zhao Zhang, Ding-Zhu Du:
Approximation algorithm for minimum partial multi-cover under a geometric setting. Optim. Lett. 16(2): 667-680 (2022) - [j126]Ke Li, Yingli Ran, Zhao Zhang, Ding-Zhu Du:
Nearly tight approximation algorithm for (connected) Roman dominating set. Optim. Lett. 16(8): 2261-2276 (2022) - [j125]Wei Liang, Zhao Zhang:
Approximation algorithm for prize-collecting sweep cover with base stations. Theor. Comput. Sci. 929: 1-10 (2022) - [j124]Weizhi Hong, Yingli Ran, Zhao Zhang:
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph. Theor. Comput. Sci. 932: 13-20 (2022) - [j123]Jianfeng Lu, Haibo Liu, Zhao Zhang, Jiangtao Wang, Sotirios K. Goudos, Shaohua Wan:
Toward Fairness-Aware Time-Sensitive Asynchronous Federated Learning for Critical Energy Infrastructure. IEEE Trans. Ind. Informatics 18(5): 3462-3472 (2022) - [j122]Jianfeng Lu, Zhao Zhang, Jiangtao Wang, Ruixuan Li, Shaohua Wan:
A Green Stackelberg-game Incentive Mechanism for Multi-service Exchange in Mobile Crowdsensing. ACM Trans. Internet Techn. 22(2): 31:1-31:29 (2022) - [c34]Yingli Ran, Zhao Zhang, Shaojie Tang:
Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem. COLT 2022: 3490-3502 - [c33]Pengcheng Liu, Zhao Zhang, Yingli Ran, Xiaohui Huang:
Computing Connected-k-Subgraph Cover with Connectivity Requirement. TAMC 2022: 93-102 - [c32]Hongwei Du, Zhao Zhang, Zhenhua Duan, Cong Tian, Ding-Zhu Du:
Formulate Full View Camera Sensor Coverage by Using Group Set Coverage. WiCON 2022: 76-90 - [i14]Chaojie Zhu, Yingli Ran, Zhao Zhang, Ding-Zhu Du:
Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set. CoRR abs/2201.05332 (2022) - [i13]Yingli Ran, Yaoyao Zhang, Zhao Zhang:
A parallel algorithm for minimum weight set cover with small neighborhood property. CoRR abs/2202.03872 (2022) - [i12]Yingli Ran, Zhao Zhang:
Approximation Algorithm for Minimum p Union Under a Geometric Setting. CoRR abs/2208.14264 (2022) - [i11]Yaoyao Zhang, Chaojie Zhu, Shaojie Tang, Ringli Ran, Ding-Zhu Du, Zhao Zhang:
Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems. CoRR abs/2210.00672 (2022) - 2021
- [j121]Yingli Ran, Ying Zhang, Zhao Zhang:
Parallel approximation for partial set cover. Appl. Math. Comput. 408: 126358 (2021) - [j120]Xingyu He, Tingting Liang, Zhao Zhang, Guisong Yang, Linghe Kong, Ming Liu:
Analysis of communication reliability in NarrowBand-IoT oriented wireless sensor networks. IET Commun. 15(1): 33-42 (2021) - [j119]Yingli Ran, Zhao Zhang, Shaojie Tang, Ding-Zhu Du:
Breaking the rmax Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem. INFORMS J. Comput. 33(2): 774-784 (2021) - [j118]Yingli Ran, Xiaohui Huang, Zhao Zhang, Ding-Zhu Du:
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks. J. Glob. Optim. 80(3): 661-677 (2021) - [j117]Limin Wang, Zhao Zhang, Chenchen Wu, Dachuan Xu, Xiaoyan Zhang:
Approximation algorithms for the dynamic k-level facility location problems. Theor. Comput. Sci. 853: 43-56 (2021) - [j116]Wei Liang, Menghong Li, Zhao Zhang, Xiaohui Huang:
Minimum power partial multi-cover on a line. Theor. Comput. Sci. 864: 118-128 (2021) - [j115]Jianfeng Lu, Yun Xin, Zhao Zhang, Shaojie Tang, Changbing Tang, Shaohua Wan:
Extortion and Cooperation in Rating Protocol Design for Competitive Crowdsourcing. IEEE Trans. Comput. Soc. Syst. 8(1): 246-259 (2021) - [c31]Wei Liang, Zhao Zhang:
Constant-Approximation for Prize-Collecting Min-Sensor Sweep Coverage with Base Stations. AAIM 2021: 3-14 - [c30]Xianyue Li, Ruowang Yang, Heping Zhang, Zhao Zhang:
Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l∞ -norm. COCOA 2021: 389-399 - [c29]Weizhi Hong, Zhao Zhang, Yingli Ran:
Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph. COCOA 2021: 527-537 - [c28]Zhihao Chen, Xiaodong Qi, Xiaofan Du, Zhao Zhang, Cheqing Jin:
PEEP: A Parallel Execution Engine for Permissioned Blockchain Systems. DASFAA (3) 2021: 341-357 - [c27]Wangbao Zhou, Zonglin Jiang, Ying Zhang, Zhao Zhang:
Laser Marking Hatch Contour Generation Algorithm. ICAIIS 2021: 16:1-16:4 - [i10]Yingli Ran, Zhao Zhang:
A Parallel Algorithm for Minimum Cost Submodular Cover. CoRR abs/2108.04416 (2021) - 2020
- [j114]Pengcheng Liu, Zhao Zhang, Xianyue Li, Weili Wu:
Approximation algorithm for minimum connected 3-path vertex cover. Discret. Appl. Math. 287: 77-84 (2020) - [j113]Guisong Yang, Zhao Zhang, Jiangtao Wang, Xingyu He:
Task allocation based on node pair intimacy in wireless sensor networks. IET Commun. 14(12): 1902-1909 (2020) - [j112]Limin Wang, Yalin Shi, Zhao Zhang, Zan-Bo Zhang, Xiaoyan Zhang:
Approximation algorithm for a generalized Roman domination problem in unit ball graphs. J. Comb. Optim. 39(1): 138-148 (2020) - [j111]Yingli Ran, Yishuo Shi, Changbing Tang, Zhao Zhang:
A primal-dual algorithm for the minimum partial set multi-cover problem. J. Comb. Optim. 39(3): 725-746 (2020) - [j110]Xianyue Li, Zhao Zhang, Ruowang Yang, Heping Zhang, Ding-Zhu Du:
Approximation algorithms for capacitated partial inverse maximum spanning tree problem. J. Glob. Optim. 77(2): 319-340 (2020) - [j109]Yubai Zhang, Zhao Zhang, Yishuo Shi, Xianyue Li:
Algorithm for Online 3-Path Vertex Cover. Theory Comput. Syst. 64(2): 327-338 (2020) - [j108]Zhihao Chen, Zhao Zhang, Yingli Ran, Yishuo Shi, Ding-Zhu Du:
Data mule scheduling on a path with handling time and time span constraints. Optim. Lett. 14(7): 1701-1710 (2020) - [j107]Yishuo Shi, Yingli Ran, Zhao Zhang, Ding-Zhu Du:
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem. Theor. Comput. Sci. 803: 1-9 (2020) - [j106]Xiuyang Chen, Zhao Zhang:
A game theoretic approach for minimal connected dominating set. Theor. Comput. Sci. 836: 29-36 (2020) - [j105]Pengcheng Liu, Zhao Zhang, Xiaohui Huang:
Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs. Theor. Comput. Sci. 836: 59-64 (2020) - [j104]Pengcheng Liu, Zhao Zhang, Xiaohui Huang:
Approximation algorithm for minimum weight connected-k-subgraph cover. Theor. Comput. Sci. 838: 160-167 (2020) - [j103]Yuchang Mo, Liudong Xing, Wenzhong Guo, Shaobin Cai, Zhao Zhang, Jianhui Jiang:
Reliability Analysis of IoT Networks with Community Structures. IEEE Trans. Netw. Sci. Eng. 7(1): 304-315 (2020) - [j102]Chaocan Xiang, Zhao Zhang, Yuben Qu, Dongyu Lu, Xiaochen Fan, Panlong Yang, Fan Wu:
Edge Computing-Empowered Large-Scale Traffic Data Recovery Leveraging Low-Rank Theory. IEEE Trans. Netw. Sci. Eng. 7(4): 2205-2218 (2020) - [j101]Jianfeng Lu, Yun Xin, Zhao Zhang, Fan Wu, Jianmin Han:
Online Rating Protocol Using Endogenous and Incremental Learning Design for Mobile Crowdsensing. IEEE Trans. Veh. Technol. 69(3): 3190-3201 (2020) - [e2]Zhao Zhang, Wei Li, Ding-Zhu Du:
Algorithmic Aspects in Information and Management - 14th International Conference, AAIM 2020, Jinhua, China, August 10-12, 2020, Proceedings. Lecture Notes in Computer Science 12290, Springer 2020, ISBN 978-3-030-57601-1 [contents]
2010 – 2019
- 2019
- [j100]Jianfeng Lu, Shasha Yang, Zhao Zhang, Jianmin Han, Hao Peng, Zhao-Long Hu, Tian Wang:
Multi-Level Two-Sided Rating Protocol Design for Service Exchange Contest Dilemma in Crowdsensing. IEEE Access 7: 78391-78405 (2019) - [j99]Yingli Ran, Zhao Zhang, Xiaohui Huang, Xiaosong Li, Ding-Zhu Du:
Approximation algorithms for minimum weight connected 3-path vertex cover. Appl. Math. Comput. 347: 723-733 (2019) - [j98]Ling Guo, Deying Li, Yongcai Wang, Zhao Zhang, Guangmo Tong, Weili Wu, Ding-Zhu Du:
Maximisation of the number of β-view covered targets in visual sensor networks. Int. J. Sens. Networks 29(4): 226-241 (2019) - [j97]Weili Wu, Zhao Zhang, Chuangen Gao, Hai Du, Hua Wang, Ding-Zhu Du:
Quality of barrier cover with wireless sensors. Int. J. Sens. Networks 29(4): 242-251 (2019) - [j96]Changbing Tang, Xiang Li, Mengwen Cao, Zhao Zhang, Xinghuo Yu:
Incentive Mechanism for Macrotasking Crowdsourcing: A Zero-Determinant Strategy Approach. IEEE Internet Things J. 6(5): 8589-8601 (2019) - [j95]Jian Liang, Xiaohui Huang, Zhao Zhang:
Approximation algorithms for distance constraint sweep coverage with base stations. J. Comb. Optim. 37(4): 1111-1125 (2019) - [j94]Zhao Zhang, Zaixin Lu, Xianyue Li, Xiaohui Huang, Ding-Zhu Du:
Online hole healing for sensor coverage. J. Glob. Optim. 75(4): 1111-1131 (2019) - [j93]Yishuo Shi, Yingli Ran, Zhao Zhang, James Willson, Guangmo Tong, Ding-Zhu Du:
Approximation algorithm for the partial set multi-cover problem. J. Glob. Optim. 75(4): 1133-1146 (2019) - [j92]Siqi Dong, Hailong Li, Yuben Qu, Zhao Zhang, Lei Hu:
移动边缘计算中的计算卸载策略研究综述 (Survey of Research on Computation Unloading Strategy in Mobile Edge Computing). 计算机科学 46(11): 32-40 (2019) - [c26]Menghong Li, Yingli Ran, Zhao Zhang:
Approximation Algorithms for the Minimum Power Partial Cover Problem. AAIM 2019: 179-191 - [c25]Limin Wang, Zhao Zhang, Dachuan Xu, Xiaoyan Zhang:
An Approximation Algorithm for the Dynamic k-level Facility Location Problem. AAIM 2019: 284-291 - [c24]Pengcheng Liu, Xiaohui Huang, Zhao Zhang:
Improved Approximation Algorithm for Minimum Weight k-Subgraph Cover Problem. COCOA 2019: 352-361 - [i9]Yuefang Sun, Xiaoyan Zhang, Zhao Zhang:
Extremality and Sharp Bounds for the k-edge-connectivity of Graphs. CoRR abs/1901.06100 (2019) - 2018
- [j91]Yingli Ran, Zhihao Chen, Shaojie Tang, Zhao Zhang:
Primal dual based algorithm for degree-balanced spanning tree problem. Appl. Math. Comput. 316: 167-173 (2018) - [j90]Zhihao Chen, Zhao Zhang:
What network topology can tell in election prediction. Discret. Math. Algorithms Appl. 10(2): 1850027:1-1850027:12 (2018) - [j89]Jianfeng Lu, Yun Xin, Zhao Zhang, Hao Peng, Jianmin Han:
Supporting user authorization queries in RBAC systems by role-permission reassignment. Future Gener. Comput. Syst. 88: 707-717 (2018) - [j88]Zhao Zhang, Jiao Zhou, Shaojie Tang, Xiaohui Huang, Ding-Zhu Du:
Computing Minimum k-Connected m-Fold Dominating Set in General Graphs. INFORMS J. Comput. 30(2): 217-224 (2018) - [j87]Jiao Zhou, Zhao Zhang, Shaojie Tang, Xiaohui Huang, Ding-Zhu Du:
Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set. INFORMS J. Comput. 30(2): 225-235 (2018) - [j86]Lina Chen, Xiaohui Huang, Zhao Zhang:
A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network. J. Comb. Optim. 36(1): 35-43 (2018) - [j85]Qinghai Liu, Xingxing Yu, Zhao Zhang:
Circumference of 3-connected cubic graphs. J. Comb. Theory B 128: 134-159 (2018) - [j84]Xianyue Li, Zhao Zhang, Ding-Zhu Du:
Partial inverse maximum spanning tree in which weight can only be decreased under lp-norm. J. Glob. Optim. 70(3): 677-685 (2018) - [j83]Chenchen Wu, Yishui Wang, Zaixin Lu, Panos M. Pardalos, Dachuan Xu, Zhao Zhang, Ding-Zhu Du:
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming. Math. Program. 169(1): 255-275 (2018) - [j82]Yuchang Mo, Lirong Cui, Liudong Xing, Zhao Zhang:
Performability Analysis of Large-Scale Multi-State Computing Systems. IEEE Trans. Computers 67(1): 59-72 (2018) - [j81]Jianfeng Lu, Yun Xin, Zhao Zhang, Xinwang Liu, Kenli Li:
Game-Theoretic Design of Optimal Two-Sided Rating Protocols for Service Exchange Dilemma in Crowdsourcing. IEEE Trans. Inf. Forensics Secur. 13(11): 2801-2815 (2018) - [j80]Zhao Zhang, Weili Wu, Jing Yuan, Ding-Zhu Du:
Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors. IEEE/ACM Trans. Netw. 26(5): 2404-2413 (2018) - [c23]Yishuo Shi, Zhao Zhang, Ding-Zhu Du:
A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem. AAIM 2018: 62-73 - [c22]Yingli Ran, Yishuo Shi, Zhao Zhang:
Primal Dual Algorithm for Partial Set Multi-cover. COCOA 2018: 372-385 - [c21]Soklong Lim, Jun Hao, Zaixin Lu, Xuechen Zhang, Zhao Zhang:
Approximating the k-Minimum Distance Rumor Source Detection in Online Social Networks. ICCCN 2018: 1-9 - [i8]Yishuo Shi, Yingli Ran, Zhao Zhang, James Willson, Guangmo Tong, Ding-Zhu Du:
Approximation Algorithm for the Partial Set Multi-Cover Problem. CoRR abs/1811.08185 (2018) - 2017
- [j79]Zhao Zhang, Xiaoting Li, Yishuo Shi, Hongmei Nie, Yuqing Zhu:
PTAS for minimum k-path vertex cover in ball graph. Inf. Process. Lett. 119: 9-13 (2017) - [j78]Limin Wang, Wenxue Du, Zhao Zhang, Xiaoyan Zhang:
A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks. J. Comb. Optim. 33(1): 106-122 (2017) - [j77]Zhao Zhang, Wen Xu, Weili Wu, Ding-Zhu Du:
A novel approach for detecting multiple rumor sources in networks with partial observations. J. Comb. Optim. 33(1): 132-146 (2017) - [j76]Yingli Ran, Zhao Zhang, Hongwei Du, Yuqing Zhu:
Approximation algorithm for partial positive influence problem in social network. J. Comb. Optim. 33(2): 791-802 (2017) - [j75]Zaixin Lu, Zhao Zhang, Weili Wu:
Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence. J. Comb. Optim. 33(2): 803-808 (2017) - [j74]Yingli Ran, Yishuo Shi, Zhao Zhang:
Local ratio method on partial set multi-cover. J. Comb. Optim. 34(1): 302-313 (2017) - [j73]Yubai Zhang, Yingli Ran, Zhao Zhang:
A simple approximation algorithm for minimum weight partial connected set cover. J. Comb. Optim. 34(3): 956-963 (2017) - [j72]Shaojie Tang, Jing Yuan, Zhao Zhang, Ding-Zhu Du:
iGreen: green scheduling for peak demand minimization. J. Glob. Optim. 69(1): 45-67 (2017) - [j71]Yishuo Shi, Zhao Zhang, Yuchang Mo, Ding-Zhu Du:
Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs. IEEE/ACM Trans. Netw. 25(2): 925-933 (2017) - [j70]Jiao Zhou, Zhao Zhang, Shaojie Tang, Xiaohui Huang, Yuchang Mo, Ding-Zhu Du:
Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network. IEEE/ACM Trans. Netw. 25(6): 3487-3499 (2017) - [c20]Shaojie Tang, Yaqin Zhou, Kai Han, Zhao Zhang, Jing Yuan, Weili Wu:
Networked Stochastic Multi-armed Bandits with Combinatorial Strategies. ICDCS 2017: 786-793 - [c19]Zhao Zhang, Yishuo Shi, James Willson, Ding-Zhu Du, Guangmo Tong:
Viral marketing with positive influence. INFOCOM 2017: 1-8 - [c18]Zhao Zhang, Xiaohui Huang, Lina Chen:
A Simpler Method to Obtain a PTAS for Connected k-Path Vertex Cover in Unit Disk Graph. WASA 2017: 584-592 - [i7]Yishuo Shi, Zhao Zhang, Ding-Zhu Du:
Randomized Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem. CoRR abs/1701.05339 (2017) - [i6]Jianfeng Lu, Yun Xin, Zhao Zhang, Shaojie Tang, Songyuan Yan, Changbing Tang:
Rating Protocol Design for Extortion and Cooperation in the Crowdsourcing Contest Dilemma. CoRR abs/1712.09846 (2017) - [i5]Jianfeng Lu, Yun Xin, Zhao Zhang, Xinwang Liu, Kenli Li:
Game-Theoretic Design of Optimal Two-Sided Rating Protocols for Service Exchange Dilemma in Crowdsourcing. CoRR abs/1712.09848 (2017) - 2016
- [j69]Xiaosong Li, Zhao Zhang, Xiaohui Huang:
Approximation algorithms for minimum (weight) connected k-path vertex cover. Discret. Appl. Math. 205: 101-108 (2016) - [j68]Shuaifu Liu, Zhao Zhang:
The 0-1 inverse maximum independent set problem on forests and unicyclic graphs. Discret. Math. Algorithms Appl. 8(2): 1650019:1-1650019:8 (2016) - [j67]Zhenhua Liu, Zhao Zhang:
Restricted connectivity of total digraph. Discret. Math. Algorithms Appl. 8(2): 1650022:1-1650022:9 (2016) - [j66]Yishuo Shi, Yaping Zhang, Zhao Zhang, Weili Wu:
A greedy algorithm for the minimum 2-connected m-fold dominating set problem. J. Comb. Optim. 31(1): 136-151 (2016) - [j65]Dongyue Liang, Zhao Zhang, Xianliang Liu, Wei Wang, Yaolin Jiang:
Approximation algorithms for minimum weight partial connected set cover problem. J. Comb. Optim. 31(2): 696-712 (2016) - [j64]Yingli Ran, Zhao Zhang, Ker-I Ko, Jun Liang:
An approximation algorithm for maximum weight budgeted connected set cover. J. Comb. Optim. 31(4): 1505-1517 (2016) - [j63]Zhao Zhang:
Editorial for Special Issue: COCOA2014. J. Comb. Optim. 32(4): 1196 (2016) - [j62]Zhao Zhang, Shuangshuang Li, Hong-Jian Lai, Ding-Zhu Du:
Algorithms for the partial inverse matroid problem in which weights can only be increased. J. Glob. Optim. 65(4): 801-811 (2016) - [j61]Zhao Zhang, Joonglyul Lee, Weili Wu, Ding-Zhu Du:
Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs. Optim. Lett. 10(7): 1393-1401 (2016) - [j60]Di Wu, Zhao Zhang, Weili Wu:
Approximation algorithm for the balanced 2-connected k-partition problem. Theor. Comput. Sci. 609: 627-638 (2016) - [j59]Shuangshuang Li, Zhao Zhang, Hong-Jian Lai:
Algorithm for constraint partial inverse matroid problem with weight increase forbidden. Theor. Comput. Sci. 640: 119-124 (2016) - [j58]Yuchang Mo, Liudong Xing, Farong Zhong, Zhao Zhang:
Reliability Evaluation of Network Systems with Dependent Propagated Failures Using Decision Diagrams. IEEE Trans. Dependable Secur. Comput. 13(6): 672-683 (2016) - [j57]Zhao Zhang, James Willson, Zaixin Lu, Weili Wu, Xuding Zhu, Ding-Zhu Du:
Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks. IEEE/ACM Trans. Netw. 24(6): 3620-3633 (2016) - [c17]Zhao Zhang, Jiao Zhou, Yuchang Mo, Ding-Zhu Du:
Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks. INFOCOM 2016: 1-8 - [c16]Yuqing Zhu, Deying Li, Zhao Zhang:
Minimum cost seed set for competitive social influence. INFOCOM 2016: 1-9 - [i4]Jiao Zhou, Zhao Zhang, Xiaohui Huang, Ding-Zhu Du:
Approximation Approximation for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks. CoRR abs/1604.06181 (2016) - [i3]Zhao Zhang, Jiao Zhou, Xiaohui Huang, Ding-Zhu Du:
Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set. CoRR abs/1608.07634 (2016) - 2015
- [j56]Hao Gui, Weifan Wang, Yiqiao Wang, Zhao Zhang:
Equitable total-coloring of subcubic graphs. Discret. Appl. Math. 184: 167-170 (2015) - [j55]Fengxia Liu, Zhao Zhang, Hong-Jian Lai, Meng Zhang:
Degree sequence realizations with given packing and covering of spanning trees. Discret. Appl. Math. 185: 113-118 (2015) - [j54]Zhao Zhang, Weili Wu, Lidong Wu, Yanjie Li, Zongqing Chen:
Strongly connected dominating and absorbing set in directed disk graph. Int. J. Sens. Networks 19(2): 69-77 (2015) - [j53]Limin Wang, Xiaoyan Zhang, Zhao Zhang, Hajo Broersma:
A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs. Theor. Comput. Sci. 571: 58-66 (2015) - [j52]Zhao Zhang, Lidong Wu, Ding-Zhu Du:
Preface. Theor. Comput. Sci. 607: 271 (2015) - [c15]Zhao Zhang, Yishuo Shi:
Approximation algorithm for minimum weight fault-tolerant virtual backbone in homogeneous wireless sensor network. INFOCOM 2015: 1080-1085 - [c14]James Willson, Zhao Zhang, Weili Wu, Ding-Zhu Du:
Fault-tolerant coverage with maximum lifetime in wireless sensor networks. INFOCOM 2015: 1364-1372 - [i2]Yishuo Shi, Zhao Zhang, Ding-Zhu Du:
Approximation Algorithm for Minimum Weight (k, m)-CDS Problem in Unit Disk Graph. CoRR abs/1508.05515 (2015) - [i1]Zhao Zhang, Jiao Zhou, Ker-I Ko, Ding-Zhu Du:
Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set. CoRR abs/1510.05886 (2015) - 2014
- [j51]Hong-Jian Lai, Yanting Liang, Juan Liu, Jixiang Meng, Zhengke Miao, Yehong Shao, Zhao Zhang:
On strongly Z2s-1-connected graphs. Discret. Appl. Math. 174: 73-80 (2014) - [j50]Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Zhao Zhang:
On the existence of super edge-connected graphs with prescribed degrees. Discret. Math. 328: 36-41 (2014) - [j49]Fengxia Liu, Zhao Zhang, Jixiang Meng:
The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs. Graphs Comb. 30(3): 699-705 (2014) - [j48]Wei Xiong, Zhao Zhang, Hong-Jian Lai:
Spanning 3-connected index of graphs. J. Comb. Optim. 27(1): 199-208 (2014) - [j47]Jiao Zhou, Zhao Zhang, Weili Wu, Kai Xing:
A greedy algorithm for the fault-tolerant connected dominating set in a general graph. J. Comb. Optim. 28(1): 310-319 (2014) - [j46]Zhao Zhang, Weili Wu, Lidan Fan, Ding-Zhu Du:
Minimum vertex cover in ball graphs through local search. J. Glob. Optim. 59(2-3): 663-671 (2014) - [j45]Yaping Zhang, Yishuo Shi, Zhao Zhang:
Approximation algorithm for the minimum weight connected k-subgraph cover problem. Theor. Comput. Sci. 535: 54-58 (2014) - [c13]Xiaosong Li, Zhao Zhang, Xiaohui Huang:
Approximation Algorithm for the Minimum Connected k -Path Vertex Cover Problem. COCOA 2014: 764-771 - [c12]Di Wu, Zhao Zhang, Weili Wu, Xiaohui Huang:
Approximation Algorithm for the Balanced 2-Connected Bipartition Problem. COCOON 2014: 441-452 - [e1]Zhao Zhang, Lidong Wu, Wen Xu, Ding-Zhu Du:
Combinatorial Optimization and Applications - 8th International Conference, COCOA 2014, Wailea, Maui, HI, USA, December 19-21, 2014, Proceedings. Lecture Notes in Computer Science 8881, Springer 2014, ISBN 978-3-319-12690-6 [contents] - 2013
- [j44]Zhao Zhang, Wei Wayne Li, Jinting Wang:
An Analytic Model for Cluster-Based Wireless Sensor Networks. INFOR Inf. Syst. Oper. Res. 51(4): 225-240 (2013) - [j43]Xiangming Yu, Xiaohui Huang, Zhao Zhang:
A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs. Inf. Sci. 243: 86-94 (2013) - [j42]Hongwei Du, Zhao Zhang, Weili Wu, Lidong Wu, Kai Xing:
Constant-approximation for optimal data aggregation with physical interference. J. Glob. Optim. 56(4): 1653-1666 (2013) - [j41]Lele Wang, Zhao Zhang, Di Wu, Weili Wu, Lidan Fan:
Max-min weight balanced connected partition. J. Glob. Optim. 57(4): 1263-1275 (2013) - [j40]Qinghai Liu, Xiaohui Huang, Zhao Zhang:
Optimally restricted edge connected elementary Harary graphs. Theor. Comput. Sci. 497: 131-138 (2013) - [j39]Wei Wang, Donghyun Kim, Min Kyung An, Wei Gao, Xianyue Li, Zhao Zhang, Weili Wu:
On Construction of Quality Fault-Tolerant Virtual Backbone in Wireless Networks. IEEE/ACM Trans. Netw. 21(5): 1499-1510 (2013) - 2012
- [j38]Yanmei Hong, Jixiang Meng, Zhao Zhang:
Edge fault tolerance of graphs with respect to super edge connectivity. Discret. Appl. Math. 160(4-5): 579-587 (2012) - [j37]Yingzhi Tian, Jixiang Meng, Zhao Zhang:
On the connectivity of p-diamond-free vertex transitive graphs. Discret. Appl. Math. 160(7-8): 1285-1290 (2012) - [j36]Xiaoyan Ma, Xiaohui Huang, Zhao Zhang:
Diameter Vulnerability of Directed cycles and Directed Tori. Discret. Math. Algorithms Appl. 4(1) (2012) - [j35]Qinghai Liu, Xiang Li, Lidong Wu, Hai Du, Zhao Zhang, Weili Wu, Xiaodong Hu, Yinfeng Xu:
A New Proof for Zassenhaus-Groemer-Oler inequality. Discret. Math. Algorithms Appl. 4(2) (2012) - [j34]Wei Zhang, Zhao Zhang, Wei Wang, Feng Zou, Wonjun Lee:
Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks. J. Comb. Optim. 23(4): 451-461 (2012) - [j33]Wenkai Ma, Deying Li, Zhao Zhang:
Algorithms for the minimum weight k-fold (connected) dominating set problem. J. Comb. Optim. 23(4): 528-540 (2012) - [j32]Da Huang, Zhao Zhang:
On cyclic vertex-connectivity of Cartesian product digraphs. J. Comb. Optim. 24(3): 379-388 (2012) - [j31]Zhao Zhang, Ding-Zhu Du:
Radar placement along banks of river. J. Glob. Optim. 52(4): 729-741 (2012) - 2011
- [j30]Qinghai Liu, Zhao Zhang, Zhihua Yu:
Cyclic Connectivity of Star Graph. Discret. Math. Algorithms Appl. 3(4): 433-442 (2011) - [j29]Zhao Zhang, Bing Wang:
Super cyclically edge connected transitive graphs. J. Comb. Optim. 22(4): 549-562 (2011) - [j28]Lidan Fan, Zhao Zhang, Wei Wang:
PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs. J. Comb. Optim. 22(4): 663-673 (2011) - [j27]Hongjie Du, Weili Wu, Wonjun Lee, Qinghai Liu, Zhao Zhang, Ding-Zhu Du:
On minimum submodular cover with submodular cost. J. Glob. Optim. 50(2): 229-234 (2011) - [j26]Ding-Zhu Du, Yingfei Dong, Zhao Zhang:
Preface. Theor. Comput. Sci. 412(32): 4073 (2011) - [c11]Qinghai Liu, Xiaohui Huang, Zhao Zhang:
Restricted Edge Connectivity of Harary Graphs. COCOA 2011: 113-125 - 2010
- [j25]Qinghai Liu, Zhao Zhang:
The existence and upper bound for two types of restricted connectivity. Discret. Appl. Math. 158(5): 516-521 (2010) - [j24]Juan Liu, Jixiang Meng, Zhao Zhang:
Double-super-connected digraphs. Discret. Appl. Math. 158(9): 1012-1016 (2010) - [j23]Feng Zou, James Willson, Zhao Zhang, Weili Wu:
Fast Information Propagation in Social Networks. Discret. Math. Algorithms Appl. 2(1): 125-142 (2010) - [j22]Zhao Zhang, Qinghai Liu:
Sufficient conditions for a graph to be lambdak-optimal with given girth and diameter. Networks 55(2): 119-124 (2010) - [j21]Xiaofeng Gao, Wei Wang, Zhao Zhang, Shiwei Zhu, Weili Wu:
A PTAS for minimum d-hop connected dominating set in growth-bounded graphs. Optim. Lett. 4(3): 321-333 (2010) - [j20]Donghyun Kim, Zhao Zhang, Xianyue Li, Wei Wang, Weili Wu, Ding-Zhu Du:
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs. IEEE Trans. Mob. Comput. 9(8): 1108-1118 (2010) - [c10]Zhihua Yu, Qinghai Liu, Zhao Zhang:
Cyclic Vertex Connectivity of Star Graphs. COCOA (1) 2010: 212-221 - [c9]Donghyun Kim, Wei Wang, Xianyue Li, Zhao Zhang, Weili Wu:
A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks. INFOCOM 2010: 2739-2747
2000 – 2009
- 2009
- [j19]Jixiang Meng, Zhao Zhang:
Super-connected arc-transitive digraphs. Discret. Appl. Math. 157(4): 653-658 (2009) - [j18]Qinghai Liu, Yanmei Hong, Zhao Zhang:
Minimally 3-restricted edge connected graphs. Discret. Appl. Math. 157(4): 685-690 (2009) - [j17]Yanmei Hong, Zhao Zhang, Qinghai Liu:
Edges of degree k in minimally restricted k-edge connected graphs. Discret. Math. 309(13): 4448-4455 (2009) - [j16]Bing Wang, Zhao Zhang:
On cyclic edge-connectivity of transitive graphs. Discret. Math. 309(13): 4555-4563 (2009) - [j15]Zhao Zhang, Qinghai Liu, Deying Li:
Two Algorithms for Connected R-Hop k-Dominating Set. Discret. Math. Algorithms Appl. 1(4): 485-498 (2009) - [j14]Yaochun Huang, Xiaofeng Gao, Zhao Zhang, Weili Wu:
A better constant-factor approximation for weighted dominating set in unit disk graph. J. Comb. Optim. 18(2): 179-194 (2009) - [j13]Zhao Zhang, Xiaofeng Gao, Weili Wu, Ding-Zhu Du:
A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks. J. Glob. Optim. 45(3): 451-458 (2009) - [j12]Zhao Zhang, Weili Wu, Shashi Shekhar:
Optimal placements of replicas in a ring network with majority voting protocol. J. Parallel Distributed Comput. 69(5): 461-469 (2009) - [j11]Deying Li, Hongwei Du, Peng-Jun Wan, Xiaofeng Gao, Zhao Zhang, Weili Wu:
Construction of strongly connected dominating sets in asymmetric multihop wireless networks. Theor. Comput. Sci. 410(8-10): 661-669 (2009) - [j10]Zhao Zhang, Xiaofeng Gao, Weili Wu:
Algorithms for connected set cover problem and fault-tolerant connected set cover problem. Theor. Comput. Sci. 410(8-10): 812-817 (2009) - [j9]Zhao Zhang, Xiaofeng Gao, Weili Wu:
PTAS for connected vertex cover in unit disk graphs. Theor. Comput. Sci. 410(52): 5398-5402 (2009) - [c8]Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, Hui Xiong:
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System. DEXA 2009: 807-821 - [c7]Feng Zou, Zhao Zhang, Weili Wu:
Latency-Bounded Minimum Influential Node Selection in Social Networks. WASA 2009: 519-526 - 2008
- [j8]Yanmei Hong, Qinghai Liu, Zhao Zhang:
Minimally restricted edge connected graphs. Appl. Math. Lett. 21(8): 820-823 (2008) - [j7]Zhao Zhang, Jixiang Meng:
Super-connected edge transitive graphs. Discret. Appl. Math. 156(10): 1948-1953 (2008) - [c6]Zhao Zhang, Xiaofeng Gao, Weili Wu:
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph. COCOA 2008: 255-264 - [c5]Xiaofeng Gao, Yaochun Huang, Zhao Zhang, Weili Wu:
(6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. COCOON 2008: 551-557 - [c4]Zhao Zhang, Weili Wu, Shashi Shekhar:
Optimal Placements in Ring Network for Data Replicas in Distributed Database with MajorityVoting Protocol. ICDCS 2008: 387-394 - [c3]Deying Li, Hongwei Du, Peng-Jun Wan, Xiaofeng Gao, Zhao Zhang, Weili Wu:
Minimum Power Strongly Connected Dominating Sets in Wireless Networks. ICWN 2008: 447-451 - [c2]Zhao Zhang, Xiaofeng Gao, Weili Wu, Ding-Zhu Du:
PTAS for Minimum Connected Dominating Set in Unit Ball Graph. WASA 2008: 154-161 - [c1]Donghyun Kim, Xianyue Li, Feng Zou, Zhao Zhang, Weili Wu:
Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks. WASA 2008: 560-569 - 2007
- [j6]Xiaodong Liang, Jixiang Meng, Zhao Zhang:
Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs. Graphs Comb. 23(3): 309-314 (2007) - 2006
- [j5]Zhao Zhang, Jixiang Meng:
Restricted Edge Connectivity of Edge Transitive Graphs. Ars Comb. 78 (2006) - [j4]Zhao Zhang, Jixiang Meng:
On optimally-lambda(3) transitive graphs. Discret. Appl. Math. 154(6): 1011-1018 (2006) - [j3]Zhao Zhang, Jixiang Meng:
Semi-hyper-connected edge transitive graphs. Discret. Math. 306(7): 705-710 (2006) - 2005
- [j2]Baoyindureng Wu, Li Zhang, Zhao Zhang:
The transformation graph Gxyz when xyz=-++. Discret. Math. 296(2-3): 263-270 (2005) - 2003
- [j1]Jixiang Meng, Zhao Zhang:
Number of minimum vertex cuts in transitive graphs. Discret. Math. 270(1-3): 310-316 (2003)
Coauthor Index
[j152] [j149] [j148] [j146] [j142] [j137] [j127] [j126] [c32] [i14] [i11] [j119] [j118] [j110] [j108] [j107] [e2] [j99] [j98] [j97] [j94] [j93] [j88] [j87] [j84] [j83] [j80] [c23] [i8] [j77] [j72] [j71] [j70] [c19] [i7] [j62] [j61] [j57] [c17] [i4] [i3] [j52] [c14] [i2] [i1] [j46] [e1] [j31] [j27] [j26] [j20] [j13] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-20 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
