| 2026 | Minimum Sum Set Cover: Structures and Algorithm. | Zhongyi Zhang, Yixin Cao |
| 2026 | Ordinal Ranks of $\varDelta ^0_2$-Measurable Functions. | Guohua Wu, Jia Li Zheng |
| 2026 | Graph Partitioning Games. | Xinyao Wang, Zihui Liang |
| 2026 | A Faster Algorithm for Sorting by Reciprocal Translocations. | Xin Tong, Haitao Jiang, Tiantian Li, Lianrong Pu, Binhai Zhu, Daming Zhu |
| 2026 | Sorting Sequences by Symmetric Reversals. | Yu-Heng Su, Jhih-Ming Yang, Wing-Kai Hon |
| 2026 | Envy-Free School Redistricting Between Two Groups. | Daisuke Shibatani, Yutaro Yamaguchi |
| 2026 | The Min-Max Clustered General Routing Problem with a Depot. | Pengxiang Pan, Hongtao Zhu |
| 2026 | Permanental Energy of Graphs. | Priyanshu Pant, Ranveer Singh |
| 2026 | The Heterogeneous Rural Postman Problem. | Pengxiang Pan, Suding Liu, Hongtao Zhu |
| 2026 | Two-Machine Flow Shop Scheduling with One Non-Availability Interval. | Hao Lu, Xin Han, Yuan Yuan, Yaojun Liu, Hanbin Yang |
| 2026 | An Improved Kernelization Algorithm for Vertex Splitting to Pathwidth-One. | Yunlong Liu, Bingyang Wang, Jingui Huang |
| 2026 | Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs. | Panfeng Liu, Biaoshuai Tao |
| 2026 | Online Fault-Tolerant Bin Packing Problem Revised. | Yaojun Liu, Xin Han, Hanbing Yang, Yong Zhou, Hao Lu |
| 2026 | Parameterized Approximation Algorithms for Dominating Set and Power Dominating Set By Using Leafage. | Peihua Li, Jiong Guo |
| 2026 | Improved Algorithms for the Maximum Weight Star Packing Problem. | Shiming Li, Yong Chen, Zhaohui Liu, Wei Yu, An Zhang |
| 2026 | On the Complexity of k-Colorable Perfect Matching. | Toranosuke Kokai, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2026 | Parameterized Complexity of Odd Domination and its Generalization. | Toranosuke Kokai, Rin Saito, Tatsuhiro Suga, Takahiro Suzuki, Yuma Tamura |
| 2026 | Six Standard Playing Cards Are Sufficient for All Three-Input Boolean Functions. | Masanori Kabutomori, Takaaki Mizuki |
| 2026 | Asymptotically Optimal Collaborative Caching in Edge Computing Systems. | Hongjie Guo, Jinchao Wu, Jianxu Shen, Hanchun Yuan |
| 2026 | The Path-Extremal Conjecture for Zero Forcing: Distance-Hereditary Graphs and a Split-Decomposition Reduction. | Samuel German |
| 2026 | Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds. | Samuel German |
| 2026 | Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model. | Weiming Feng, Zelin Li, Pan Peng |
| 2026 | Single-Shuffle Full-Open Card-Based Secure Computation Protocols for Any Function. | Reo Eriguchi, Kazumasa Shinagawa |
| 2026 | On the Border Complexity of Sums of ROFs. | Pranjal Dutta, Bhargav Thankey |
| 2026 | Algorithms and Bounds for Path Covers of Tree-Structured Graphs. | Madhura Dutta, Florent Foucaud, Subhas C. Nandy |