| 1 | -- | 6 | Shu-Li Zhao, Rong-Xia Hao, Sheng-Lung Peng. Reliability Assessment of Some Regular Networks |
| 7 | -- | 26 | Michael A. Bekos, Henry Förster, Christian Geckeler, Lukas Holländer, Michael Kaufmann 0001, Amadäus M. Spallek, Jan Splett. A Heuristic Approach Towards Drawings of Graphs With High Crossing Resolution |
| 27 | -- | 37 | Tzu-Liang Kung, Hon-Chan Chen, Chia-Hui Lin, Lih-Hsing Hsu. Three Types of Two-Disjoint-Cycle-Cover Pancyclicity and Their Applications to Cycle Embedding in Locally Twisted Cubes |
| 38 | -- | 53 | Xiaoyan Li, Cheng-Kuan Lin, Jianxi Fan, Xiaohua Jia, Baolei Cheng, Jingya Zhou. Relationship Between Extra Connectivity And Component Connectivity In Networks |
| 54 | -- | 63 | Samer Nofal, Katie Atkinson, Paul E. Dunne. Computing Grounded Extensions Of Abstract Argumentation Frameworks |
| 64 | -- | 75 | Eminjan Sabir, Jixiang Meng. Structure Fault Tolerance of Recursive Interconnection Networks |
| 76 | -- | 92 | Yibo Zeng, Zhongzhi Zhang. Spectra, Hitting Times and Resistance Distances of q- Subdivision Graphs |
| 93 | -- | 107 | Jun Liu, Yicheng Pan, Qifu Hu. Exact Distance Query in Large Graphs through Fast Graph Simplification |
| 108 | -- | 131 | Juan Li, Dandan Xiao, Ting Zhang, Chun Liu, Yuan-xiang Li, Gai-Ge Wang. Multi-Swarm Cuckoo Search Algorithm with Q-Learning Model |
| 132 | -- | 154 | Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien Tixeuil. Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots |