| 2023 | On the Routing Problems in Graphs with Ordered Forbidden Transitions. | Kota Kumakura, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2023 | Randomized Data Partitioning with Efficient Search, Retrieval and Privacy-Preservation. | M. Oguzhan Klekci |
| 2023 | Conditional Automatic Complexity and Its Metrics. | Bjrn Kjos-Hanssen |
| 2023 | Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher. | Akinori Kawachi, Yuki Naito |
| 2023 | Deterministic Primal-Dual Algorithms for Online k-Way Matching with Delays. | Naonori Kakimura, Tomohiro Nakayoshi |
| 2023 | Sink Location Problems in Dynamic Flow Grid Networks. | Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni |
| 2023 | Fitch Graph Completion. | Marc Hellmuth, Peter F. Stadler, Sandhya Thekkumpadan Puthiyaveedu |
| 2023 | Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs. | Marc Hellmuth, Guillaume E. Scholz |
| 2023 | A Physical Zero-Knowledge Proof for Sumplete, a Puzzle Generated by ChatGPT. | Kyosuke Hatsugai, Kyoichi Asano, Yoshiki Abe |
| 2023 | Improved Bounds for the Binary Paint Shop Problem. | Jaroslav Hancl, Adam Kabela, Michal Opler, Jakub Sosnovec, Robert Smal, Pavel Valtr |
| 2023 | Diversity and Freshness-Aware Regret Minimizing Set Queries. | Hongjie Guo, Jianzhong Li, Fangyao Shen, Hong Gao |
| 2023 | Approximating the λ-low-density Value. | Joachim Gudmundsson, Zijin Huang, Sampson Wong |
| 2023 | Algorithms for Shortest Path Tour Problem in Large-Scale Road Network. | Yucen Gao, Mingqian Ma, Jiale Zhang, Songjian Zhang, Jun Fang, Xiaofeng Gao, Guihai Chen |
| 2023 | Self-stabilizing $(\varDelta +1)$-Coloring in Sublinear (in $\varDelta $) Rounds via Locally-Iterative Algorithms. | Xinyu Fu, Yitong Yin, Chaodong Zheng |
| 2023 | Maximizing Diversity and Persuasiveness of Opinion Articles in Social Networks. | Liman Du, Wenguo Yang, Suixiang Gao |
| 2023 | On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes. | Andrew Drucker, Yuan Li |
| 2023 | Resource-Adaptive Newton's Method for Distributed Learning. | Shuzhen Chen, Yuan Yuan, Youming Tao, Zhipeng Cai, Dongxiao Yu |
| 2023 | k-Median/Means with Outliers Revisited: A Simple Fpt Approximation. | Xianrun Chen, Lu Han, Dachuan Xu, Yicheng Xu, Yong Zhang |
| 2023 | Random Shortening of Linear Codes and Applications. | Xue Chen, Kuan Cheng, Xin Li, Songtao Mao |
| 2023 | Delaying Decisions and Reservation Costs. | Elisabet Burjons, Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith |
| 2023 | On Detecting Some Defective Items in Group Testing. | Nader H. Bshouty, Catherine A. Haddad-Zaknoon |
| 2023 | A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons. | Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer |
| 2023 | Red-Black Spanners for Mixed-Charging Vehicular Networks. | Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu |
| 2023 | Complexity and Enumeration in Models of Genome Rearrangement. | Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann |
| 2023 | Shortest Longest-Path Graph Orientations. | Yuichi Asahiro, Jesper Jansson, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov |