Susanne Armbruster, Matthias Mnich and Martin Nägele. A (3/2+1/e)-Approximation Algorithm for Ordered TSP

Dimitris Christou and Shuchi Chawla. Online Time-Windows TSP with Predictions

Michael Dinitz, Guy Kortsarz and Shi Li. Degrees and Network Design: New Problems and 2 Approximations

Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh and Meirav Zehavi. Hybrid k-Clustering: Blending k-Median and k-Center

Divyarthi Mohan and Pawel Pralat. Asynchrnous Majority Dynamcis on Binomial Random Graphs

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue and Meirav Zehavi. Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3

Johan Håstad, Björn Martinsson, Tamio-Vesa Nakajima and Stanislav Živný. A logarithmic approximation of linearly-ordered colourings

Josef Minařík and Jiří Sgall. Speed-robust scheduling revisited

Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel Torres and Weihao Zhu. On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms

Martin Böhm, Matej Lieskovský, Sören Schmitt, Jiří Sgall and Rob van Stee. Improved online load balancing with known makespan

Björn Martinsson. On the NP-hardness approximation curve for Max-2Lin(2)

Tomer Ezra, Stefano Leonardi, Michal Pawlowski, Matteo Russo and Seeun William Umboh. Universal Optimization for Non-Clairvoyant Subadditive Joint Replenishment

Kshipra Bhawalkar, Zhe Feng, Anupam Gupta, Aranyak Mehta, David Wajc and Di Wang. The Average-Value Allocation Problem

Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior and Andreas Wiese. Scheduling on a Stochastic Number of Machines

Joseph Naor, Yaron Fairstein and Tomer Tsachor. Distributional Online Weighted Paging with Limited Horizon

Diba Hashemi and Weronika Wrzos-Kaminska. Weighted matching in the random-order streaming and robust communication models

Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter and Amitabh Trehan. Competitive Query Minimization for Stable Matching with One-Sided Uncertainty

Hao Sun. A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus

Surendra Ghentiyala and Noah Stephens-Davidowitz. More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more

Benjamin Moseley, Heather Newman and Kirk Pruhs. Online $k$-Median with Consistent Clusters

Daniel Hathcock, Guy Kortsarz and R. Ravi. The Telephone k-multicast problem

David Stalfa, Rajmohan Rajaraman, Matthew Casey and Cheng Tan. Scheduling Splittable Jobs on Configurable Machines

Mayank Goswami and Riko Jacob. On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting

Vladimir Braverman, Prathamesh Dharangutte, Vihan Shah and Chen Wang. Learning-augmented Maximum Independent Set

Philip Cervenjak, Junhao Gan, Seeun William Umboh and Anthony Wirth. Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound

Sourav Chakraborty, Arijit Ghosh, Kuldeep S. Meel, Mridul Nandi, Soumit Pal and N. V. Vinodchandran. Improved Streaming Algorithm for the Klee’s Measure Problem and Generalizations

Ilan Doron, Ariel Kulik and Hadas Shachnai. An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding

Pratik Ghosal, Syed Mohammad Meesum and Katarzyna Paluch. Rectangle Tiling Binary Arrays

David Aleman Espinosa and Chaitanya Swamy. Approximation Algorithms for Correlated Knapsack Orienteering

Gabriel Arpino, Daniil Dmitriev and Nicolo Grometto. Greedy heuristics and linear relaxations for the random hitting set problem