• . Combining Capacity and Length: Finding Connectivity Bottleneck in a Layered Network.  IEEE/ACM Transactions on Networking,  32,  2025. 

• 周江. An Evolutionary Algorithm Based on CMSA for Rooted Max Tree Coverage.  IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION,  2025. 

• 赵雪旸. New algorithms for a simple measure of network partitioning.  Theoretical Computer Science,  957,  2023. 

• 李江坤. New approximation algorithms for the rooted Budgeted Cycle Cover problem.  Theoretical Computer Science,  940,  283, 2023. 

• 张鹏. The label cut problem with respect to path length and label frequency.  Theoretical Computer Science,  648,  72-83, 2023. 

• 张鹏. Algorithmic aspects of homophyly of networks.  Theoretical Computer Science,  593,  117-131, 2023. 

• 郝凡昌. 通过交互式移位-插入-删除进行基因组排序的较快算法.  《计算机研究与发展》,  47,  2011-2023, 2023. 

• 张鹏. Unbalanced graph cuts with minimum capacity.  Frontiers of Computer Science,  8,  676-683, 2023. 

• 一种深度信息分层编码的步态周期检测方法

• 一种深度信息分层编码的步态周期检测方法

No Content

No Content