| 2024 | A Simple Deterministic Near-Linear Time Approximation Scheme for Transshipment with Arbitrary Positive Edge Costs. | Emily Fox |
| 2024 | Hitting Meets Packing: How Hard Can It Be? | Jacob Focke, Fabian Frei, Shaohua Li, Dniel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki |
| 2024 | Invertible Bloom Lookup Tables with Less Memory and Randomness. | Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin |
| 2024 | Semi-Streaming Algorithms for Weighted k-Disjoint Matchings. | S. M. Ferdous, Bhargav Samineni, Alex Pothen, Mahantesh Halappanavar, Bala Krishnamoorthy |
| 2024 | Toward Self-Adjusting k-Ary Search Tree Networks. | Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Vitaly Aksenov, Stefan Schmid |
| 2024 | List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. | Baris Can Esmer, Jacob Focke, Dniel Marx, Pawel Rzazewski |
| 2024 | Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection Graphs. | Lech Duraj, Filip Konieczny, Krzysztof Potepa |
| 2024 | Making Multicurves Cross Minimally on Surfaces. | Loc Dubois |
| 2024 | Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs. | Sally Dong, Guanghao Ye |
| 2024 | Scheduling with Obligatory Tests. | Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang |
| 2024 | Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. | Yann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz |
| 2024 | Near Optimal Dual Fault Tolerant Distance Oracle. | Dipan Dey, Manoj Gupta |
| 2024 | An Optimal Randomized Algorithm for Finding the Saddlepoint. | Justin Dallant, Frederik Haagensen, Riko Jacob, Lszl Kozma, Sebastian Wild |
| 2024 | Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. | Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki |
| 2024 | Recent Progress on Correlation Clustering: From Local Algorithms to Better Approximation Algorithms and Back (Invited Talk). | Vincent Cohen-Addad |
| 2024 | From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. | Chandra Chekuri, Rhea Jain, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu |
| 2024 | Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing. | Chandra Chekuri, Rhea Jain |
| 2024 | Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams. | Amit Chakrabarti, Andrew McGregor, Anthony Wirth |
| 2024 | Local Optimization Algorithms for Maximum Planar Subgraph. | Gruia Calinescu, Sumedha Uniyal |
| 2024 | Online Flexible Busy Time Scheduling on Heterogeneous Machines. | Gruia Calinescu, Sami Davies, Samir Khuller, Shirley Zhang |
| 2024 | Bicriteria Approximation for Minimum Dilation Graph Augmentation. | Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Sampson Wong |
| 2024 | On Finding Longest Palindromic Subsequences Using Longest Common Subsequences. | Gerth Stlting Brodal, Rolf Fagerberg, Casper Moldrup Rysgaard |
| 2024 | Exploring the Approximability Landscape of 3SUM. | Karl Bringmann, Ahmed Ghazy, Marvin Knnemann |
| 2024 | Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing. | Karl Bringmann, Anita Drr, Adam Polak |
| 2024 | Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds. | Cornelius Brand, Martin Kouteck, Alexandra Lassota, Sebastian Ordyniak |