| 2024 | A Coq-Based Infrastructure for Quantum Programming, Verification and Simulation. Wenxuan Tao, Gang Chen |
| 2024 | A Gray Code of Ordered Trees. Shin-Ichi Nakano |
| 2024 | A Local Search Algorithm for Radius-Constrained k-Median. Gaojie Chi, Longkun Guo |
| 2024 | A Tight Threshold Bound for Search Trees with 2-Way Comparisons. Sunny Atalig, Marek Chrobak |
| 2024 | An Improved Approximation Algorithm for Metric Triangle Packing. Jingyang Zhao, Mingyu Xiao |
| 2024 | An Improved Kernel and Parameterized Algorithm for Almost Induced Matching. Yuxi Liu, Mingyu Xiao |
| 2024 | An Optimal and Practical Algorithm for the Planar 2-Center Problem. Xuehou Tan |
| 2024 | Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques. Chenchen Wu, Rolf H. Möhring, Yishui Wang, Dachuan Xu, Dongmei Zhang |
| 2024 | Counting on Rainbow k-Connections. Robert D. Barish, Tetsuo Shibuya |
| 2024 | Endogenous Threshold Selection with Two-Interval Restricted Tests. Zeyu Ren, Yan Liu |
| 2024 | Energy and Output Patterns in Boolean Circuits. Jayalal Sarma, Kei Uchizawa |
| 2024 | Improved Approximation Algorithm for the Distributed Lower-Bounded k-Center Problem. Ting Liang, Qilong Feng, Xiaoliang Wu, Jinhui Xu, Jianxin Wang |
| 2024 | Joint Bidding in Ad Auctions. Yuchao Ma, Weian Li, Wanzhi Zhang, Yahui Lei, Zhicheng Zhang, Qi Qi, Qiang Liu, Xingxing Wang |
| 2024 | Kleene Theorems for Lasso Languages and ømega-Languages. Mike Cruchten |
| 2024 | Lower Bounds for the Sum of Small-Size Algebraic Branching Programs. C. S. Bhargav, Prateek Dwivedi, Nitin Saxena |
| 2024 | Mechanism Design for Building Optimal Bridges Between Regions. Zining Qin, Hau Chan, Chenhao Wang, Ying Zhang |
| 2024 | Mechanism Design with Predictions for Facility Location Games with Candidate Locations. Jiazhu Fang, Qizhi Fang, Wenjing Liu, Qingqin Nong |
| 2024 | Offensive Alliances in Signed Graphs. Zhidan Feng, Henning Fernau, Kevin Mann, Xingqin Qi |
| 2024 | On Learning Families of Ideals in Lattices and Boolean Algebras. Nikolay Bazhenov, Manat Mustafa |
| 2024 | On the 3-Tree Core of Plane Graphs. Debajyoti Mondal, Md. Saidur Rahman |
| 2024 | On the Power of Counting the Total Number of Computation Paths of NPTMs. Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos |
| 2024 | Parameterized Complexity of Weighted Target Set Selection. Takahiro Suzuki, Kei Kimura, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2024 | Quantum Path Parallelism: A Circuit-Based Approach to Text Searching. Simone Faro, Arianna Pavone, Caterina Viola |
| 2024 | Some Combinatorial Algorithms on the Edge Cover Number of k-Regular Connected Hypergraphs. Zhongzheng Tang, Yaxuan Li, Zhuo Diao |
| 2024 | Source-Oblivious Broadcast. Pierre Fraigniaud, Hovhannes A. Harutyunyan |
| 2024 | Space-Efficient Graph Kernelizations. Frank Kammer, Andrej Sajenko |
| 2024 | The Parameterized Complexity of Maximum Betweenness Centrality. Simon Schierreich, José Gaspar Smutný |
| 2024 | Theory and Applications of Models of Computation - 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13-15, 2024, Proceedings Xujin Chen, Bo Li |
| 2024 | Tight Double Exponential Lower Bounds. Ivan Bliznets, Markus Hecher |
| 2024 | Time Efficient Implementation for Online K-Server Problem on Trees. Kamil Khadiev, Maxim Yagafarov |
| 2024 | Unambiguous and Co-nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters. Tomoyuki Yamakami |