Sayan Bandyapadhyay. On Perturbation Resilience of Non-Uniform k-Center

Fedor Fomin, Petr Golovach, Fahad Panolan and Kirill Simonov. Low-rank binary matrix approximation in column-sum norm

Parinya Chalermsook, Julia Chuzhoy and Thatchaphol Saranurak. Pinning Down the Strong Wilber 1 Bound for Binary Search Trees

Venkatesan Guruswami, Jakub Opršal and Sai Sandeep. Revisiting Alphabet Reduction in Dinur’s PCP

Tatiana Starikovskaya, Michal Svagerka and Przemysław Uznański. $L_p$ Pattern Matching in a Stream

Karine Chubarian and Anastasios Sidiropoulos. Computing Bi-Lipschitz Outlier Embeddings into the Line

Nicole Megow and Lukas Nölke. Online Minimum Cost Matching with Recourse on the Line

Amey Bhangale, Diptarka Chakraborty and Rajendra Kumar. Hardness of Approximation of (Multi-)LCS over Small Alphabet

Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz and Jiayi Xian. On Approximating Degree-Bounded Network Design Problems

Varun Gupta, Ravishankar Krishnaswamy and Sai Sandeep. PERMUTATION Strikes Back: The Power of Recourse in Online Metric Matching

Petr Kolman and Eden Chlamtac. How to Cut a Ball without Separating: Improved Approximations for Length Bounded Cut

Xiangyu Guo, Janardhan Kulkarni, Shi Li and Jiayi Xian. On the Facility Location Problem in Online and Dynamic Models

Ishan Agarwal, Oded Regev and Yi Tang. Nearly Optimal Embeddings of Flat Tori

Gálvez Waldo, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan and Malin Rau. A Tight (3/2+\varepsilon) Approximation for Skewed Strip Packing

Bohan Fan, Diego Ihara Centurion, Neshat Mohammadi, Francesco Sgherzi, Anastasios Sidiropoulos, Mina Valizadeh. Learning Lines with Ordinal Constraints

Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat and Przemysław Uznański. Improved Circular k-Mismatch Sketches

Arindam Khan and Madhusudhan Reddy Pittu. On guillotine separability of squares and rectangles

Lior Ben Yamin, Jing Li, Kanthi Sarpatwar, Baruch Schieber and Hadas Shachnai. Maximizing Throughput in Flow Shop Real-time Scheduling

Dor Katzelnick and Roy Schwartz. Maximizing the Correlation: Extending Grothendieck’s Inequality to Large Domains

Alexandr Andoni, Collin Burns, Yi Li, Sepideh Mahabadi and David P. Woodruff. Streaming Complexity of SVMs

Spoorthy Gunda, Pallavi Jain, Daniel Lokshtanov, Saket Saurabh and Prafullkumar Tale. On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

Joanna Chybowska-Sokół, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos and Adam Polak. Online Coloring of Short Intervals

Roy Schwartz and Yotam Sharoni. Approximating Requirement Cut via a Configuration LP

Sébastien Bubeck and Yuval Rabani. Parametrized Metrical Task Systems

Syamantak Das, Lavina Jain and Nikhil Kumar. A Constant Factor Approximation for Capacitated Min-Max Tree Cover

Nima Anari and Thuy-Duong Vuong. An Extension of Plücker Relations with Applications to Subdeterminant Maximization

Vadim Grinberg and Buddhima Gamlath. Approximating Star Cover Problems

Neng Huang and Aaron Potechin. On the Approximability of Presidential Type Predicates

Eunou Lee, Sean Hallgren and Ojas Parekh. An approximation algorithm for the MAX-2-LocalHamiltonian problem

Alexander Wei. Better and Simpler Learning-Augmented Online Caching

Sylvia Boyd, Joseph Cheriyan, Robert Cummings, Logan Grout, Sharat Ibrahimpur, Zoltan Szigeti and Lu Wang. A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case

Chien-Chung Huang, Theophile Thiery and Justin Ward. Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints

Chan Chun-Hsiang, Bundit Laekhanukit, Hao-Ting Wei and Yuhao Zhang. Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs

Ainesh Bakshi, Nadiia Chepurko and David P. Woodruff. Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams