| Michael Elkin, Yuval Gitlitz and Ofer Neiman — Improved Weighted Additive Spanners |
| Nathan Wallheimer and Amir Abboud — Worst-case to Expander-case Reductions |
| Sorrachai Yingchareonthawornchai and Thatchaphol Saranurak — Deterministic Small Vertex Connectivity in Almost Linear Time |
| Debarati Das, Jacob Gilbert, Mohammadtaghi Hajiaghayi, Tomasz Kociumaka and Barna Saha — Weighted Edit Distance Computation: Strings, Trees, and Dyck |
| Kyungjin Cho, Eunjin Oh and Seunghyeok Oh — Parameterized Algorithm for the Planar Disjoint Paths Problem: Exponential in $k^2$, and Linear in $n$ |
| Ashish Chiplunkar, Monika Henzinger, Sagar Sudhir Kale and Maximilian Vötsch — Online Min-Max Paging |
| Piotr Mitosek — Constructing $NP^{\#P}$-complete Problems and $\#P$-hardness of Circuit Extraction in Phase-free $ZH$ |
| Hugo Aaronson, Tom Gur and Ninad Rajgopal — Distribution-Free Proofs of Proximity |
| Sujoy Bhore, Robert Ganian, Liana Khazaliya, Fabrizio Montecchiani and Martin Nöllenburg — Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable |
| Sayan Bhattacharya, Peter Kiss and Thatchaphol Saranurak — Dynamic $(1+\varepsilon)$-Approximate Matching Size in Truly Sublinear Update Time |
| Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich and Tobias Stamm — New Results for Intractable Scheduling Problems |
| Oded Lachish, Felix Reidl and Chhaya Trehan — When You Come at the King You Best not Miss |
| François Dross, Krzysztof Fleszar, Karol Węgrzycki and Anna Zych-Pawlewicz — Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours |
| Monika Henzinger, Stefan Neumann, Harald Räcke and Stefan Schmid — Dynamic Maintenance of Monotone Dynamic Programs and Applications |
| Sayan Bhattacharya, Martin Costa, Silvio Lattanzi and Nikos Parotsidis — Fully Dynamic $k$-Clustering in $\tilde{O}(k)$ Update Time |
| Meike Neuwohner — Passing the Limits of Pure Local Search for Weighted k-Set Packing |
| Fateme Abbasi, Marek Adamczyk, Miguel Bosch-Calvo, Jarosław Byrka, Fabrizio Grandoni, Krzysztof Sornat and Antoine Tinguely — An $O(\log\log n)$-Approximation for Submodular Facility Location |
| Amir Abboud, Karl Bringmann and Nick Fischer — Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics |
| Jannis Blauth and Martin Nägele — An Improved Approximation Guarantee for Prize-Collecting TSP |
| Panagiotis Charalampopoulos, Tomasz Kociumaka and Philip Wellnitz — Faster Pattern Matching under Edit Distance |
| Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra and Sayantan Sen — Exploring the Gap between Tolerant and Non-tolerant Distribution Testing |
| Yiannis Giannakopoulos, Alexander Grosz and Themistoklis Melissourgos — On the Smoothed Complexity of Combinatorial Local Search |
| Kunal Dutta, Arijit Ghosh and Shay Moran — Uniform Brackets, Containers, and Combinatorial Macbeath Regions |
| Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal and Daniel Vaz — Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter |
| Jakub Svoboda — Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth |
| Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek and Sorrachai Yingchareonthwornchai — Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition |
| Sam Coy, Artur Czumaj and Gopinath Mishra — On Parallel k-Center Clustering |
| Nicolas Bousquet, Laurent Feuilloley and Théo Pierron — What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs |
| Arijit Ghosh, Gopinath Mishra, Rahul Raychaudhury and Sayantan Sen — Tolerant Bipartiteness Testing in Dense Graphs |
| Dibyayan Chakraborty, Antoine Dailly, Sandip Das, Florent Foucaud, Harmender Gahlawat and Subir Kumar Ghosh — Complexity and Algorithms for Isometric Path Cover on Chordal Graphs and Beyond |
| Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomas Masarik, Marcin Pilipczuk, Roohani Sharma and Manuel Sorge — Fixed-parameter Tractability of Directed Multicut with Three Terminal pairs Parameterized by the Size of the Cutset: Twin-width Meets Flow-augmentation |
| Harald Räcke, Stefan Schmid and Ruslan Zabrodin — Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands |
| Niklas Schlomberg, Hanjo Thiele and Jens Vygen — Packing Cycles in Planar and Bounded-genus Graphs |
| Sven Jäger, Guillaume Sagnol, Daniel Schmidt Genannt Waldschmidt and Philipp Warode — Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling |
| Sanjana Dey, Florent Foucaud, Subhas Nandy and Arun Sen — Complexity and Approximation for Discriminating and Identifying Code Problems in Geometric Setups |
| Amir Abboud, Seri Khoury, Oree Leibowitz and Ron Safier — Listing 4-Cycles |
| Sandip Das and Harmender Gahlawat — On the Cop Number of String Graphs |
| Itai Boneh, Shay Golan, Shay Mozes and Oren Weimann — Near-Optimal Dynamic Time Warping on Run-Length Encoded Strings |
| Shahar Lewkowicz, Yossi Azar and Danny Vainstein — List Update with Delays or Time Windows |
| Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind Sankar, Philipp Schepper and Philip Wellnitz — Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs |
| Diptarka Chakraborty, Debarati Das and Robert Krauthgamer — Clustering Permutations: New Techniques with Streaming Applications |
| Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos and Nikos Parotsidis — Faster Computation of 3-Edge-Connected Components in Digraphs |
| Marcel Dall’Agnol, Graham Cormode, Chris Hickey and Tom Gur — Streaming Zero-Knowledge Proofs |
| Aniket Basu Roy — Covering Simple Orthogonal Polygons with Rectangles |
| Davide Bilò, Shiri Chechik, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann and Martin Schirneck — Approximate Distance Sensitivity Oracles in Subquadratic Space |
| Andreas Emil Feldmann and Tung Anh Vu — Generalized $k$-Center: Distinguishing Doubling and Highway Dimension |
| Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek and Ziena Zeif — Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth |
| Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan and Shay Sapir — Lower Bounds for Pseudo-Deterministic Counting in a Stream |
| Antoine El-Hayek, Monika Henzinger and Stefan Schmid — Asymptotically Tight Bounds on the Time Complexity of Broadcast and its Variants in Dynamic Networks |
| Alexandra Lassota, Aleksander Łukasiewicz and Adam Polak — Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs |
| Zachary Friggstad and Ramin Mousavi — An $O(\log k)$-Approximation for Directed Steiner Tree in Planar Graphs |
Lectures will be held in S3 and S4 lecture rooms on the third floor.
