受强制性开放获取政策约束的文章 - Yiming Zhao了解详情
无法在其他位置公开访问的文章：1 篇
On hardware-trojan-assisted power budgeting system attack targeting many core systems
Y Zhao, X Wang, Y Jiang, L Wang, M Yang, AK Singh, T Mak
Journal of Systems Architecture 109, 101757, 2020
强制性开放获取政策： 中国科学院, 国家自然科学基金委员会
可在其他位置公开访问的文章：6 篇
Reverse shortest path problem in weighted unit-disk graphs
H Wang, Y Zhao
International Conference and Workshops on Algorithms and Computation, 135-146, 2022
强制性开放获取政策： US National Science Foundation
Reverse shortest path problem for unit-disk graphs
H Wang, Y Zhao
Algorithms and Data Structures: 17th International Symposium, WADS 2021 …, 2021
强制性开放获取政策： US National Science Foundation
An Optimal Algorithm for L1 Shortest Paths in Unit-Disk Graphs
H Wang, Y Zhao
33rd Canadian Conference on Computational Geometry (CCCG), 211-218, 2021
强制性开放获取政策： US National Science Foundation
Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
H Wang, Y Zhao
Theoretical Computer Science 890, 192-209, 2021
强制性开放获取政策： US National Science Foundation
Reverse shortest path problem for unit-disk graphs
H Wang, Y Zhao
Journal of Computational Geometry 14 (1), 14–47-14–47, 2023
强制性开放获取政策： US National Science Foundation
Algorithms for Unit-Disk Graphs and Related Problems
Y Zhao
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定