李致远 - 北京师范大学-香港浸会大学

个人简介

Education Qualification 2014-2018 Ph.D., Department of Computer Science and Software Engineering, Concordia University 2009-2012 M.Sc. (thesis-based), Department of Computer Science, Brock University 2005-2009 B.Sc. (Hons), Department of Computer Science & Technology, BNU-HKBU United International College Work/Research Experience 2018.2-present Assistant Professor, Programme of Computer Science and Technology, United International College 2012.9-2014.6 Teaching Assistant, Programme of Computer Science and Technology, United International College

研究领域

His research interests are in combinatorics, graph theory, network topologies, and computational complexity theory. Recently, he is also supervising several groups of students on video game design

近期论文

查看导师最新文章（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）

Harutyunyan, H.A., Li, Z., (2021) The Complexity of Finding a Broadcast Center. AAIM 2021: 57-70 Harutyunyan, H.A., Li, Z., (2020) A new construction of broadcast graphs. Discret. Appl. Math. 280: 144-155 Harutyunyan, H.A., Li, Z. (2019) A Simple Construction of Broadcast Graphs. In Computing and Combinatorics – 25th International Conference. COCOON 2019. Lecture Notes in Computer Science (LNCS), vol 11653, pp.240-253, Springer. Harutyunyan, H.A., Li, Z. (2017) Improved lower bound on broadcast function based on graph partition. 28th International Workshop on Combinatorial Algorithms. IWOCA 2017. Lecture Notes in Computer Science (LNCS), vol 10765, pp219-230, Springer. Harutyunyan, H.A., Li, Z. (2017) Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs. In Conference on Algorithms and Discrete Applied Mathematics. CALDAM 2017. LNCS, vol 10156, pp. 193-204, Springer Harutyunyan, H.A., Li, Z. (2016) A New Construction of Broadcast Graphs. In Conference on Algorithms and Discrete Applied Mathematics. CALDAM 2016. Lecture Notes in Computer Science (LNCS), vol 9602, pp.201-211. Springer.