| 2024 | Temporal Queries for Dynamic Temporal Forests. | Davide Bil, Luciano Gual, Stefano Leucci, Guido Proietti, Alessandro Straziota |
| 2024 | Optimal Sensitivity Oracle for Steiner Mincut. | Koustav Bhanja |
| 2024 | The Complexity of Geodesic Spanners Using Steiner Points. | Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms |
| 2024 | Fault-Tolerant Bounded Flow Preservers. | Shivam Bansal, Keerti Choudhary, Harkirat Dhanoa, Harsh Wardhan |
| 2024 | Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths. | Sunny Atalig, Alexander Hickerson, Arrdya Srivastav, Tingting Zheng, Marek Chrobak |
| 2024 | On the Connected Minimum Sum of Radii Problem. | Hyung-Chan An, Mong-Jen Kao |
| 2024 | Dynamic Parameterized Problems on Unit Disk Graphs. | Shinwoo An, Kyungjin Cho, Leo Jang, Byeonghyeon Jung, Yudam Lee, Eunjin Oh, Donghun Shin, Hyeonjun Shin, Chanho Song |
| 2024 | Minimum Plane Bichromatic Spanning Trees. | Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, Csaba D. Tth |
| 2024 | Revisit the Scheduling Problem with Calibrations. | Lin Chen, Yixiong Gao, Minming Li, Guohui Lin, Kai Wang |
| 2024 | Single Family Algebra Operation on BDDs and ZDDs Leads to Exponential Blow-Up. | Kengo Nakamura, Masaaki Nishino, Shuhei Denzumi |
| 2024 | Does Subset Sum Admit Short Proofs? | Michal Wlodarczyk |
| 2024 | Constant Approximating Disjoint Paths on Acyclic Digraphs Is W[1]-Hard. | Michal Wlodarczyk |
| 2024 | Algorithmic Problems in Discrete Choice (Invited Talk). | Ravi Kumar |
| 2024 | Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands. | Jingyang Zhao, Mingyu Xiao |
| 2024 | Constrained Two-Line Center Problems. | Taehoon Ahn, Sang Won Bae |
| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. | |
| 2023 | Testing Properties of Distributions in the Streaming Model. | Sampriti Roy, Yadu Vasudev |
| 2023 | On the Fine-Grained Query Complexity of Symmetric Functions. | Supartha Podder, Penghui Yao, Zekun Ye |
| 2023 | Connected Vertex Cover on AT-Free Graphs. | Joydeep Mukherjee, Tamojit Saha |
| 2023 | On the Complexity of the Eigenvalue Deletion Problem. | Neeldhara Misra, Harshil Mittal, Saket Saurabh, Dhara Thakkar |
| 2023 | Recognizing Unit Multiple Intervals Is Hard. | Virginia Ardvol Martnez, Romeo Rizzi, Florian Sikora, Stphane Vialette |
| 2023 | Improved Smoothed Analysis of 2-Opt for the Euclidean TSP. | Bodo Manthey, Jesse van Rhijn |
| 2023 | Exact Matching: Correct Parity and FPT Parameterized by Independence Number. | Nicolas El Maalouly, Raphael Steiner, Lasse Wulf |
| 2023 | On the Line-Separable Unit-Disk Coverage and Related Problems. | Gang Liu, Haitao Wang |
| 2023 | On Min-Max Graph Balancing with Strict Negative Correlation Constraints. | Ting-Yu Kuo, Yu-Han Chen, Andrea Frosini, Sun-Yuan Hsieh, Shi-Chun Tsai, Mong-Jen Kao |