IGAFIT HIGHLIGHTS OF ALGORITHMS

All registered participants were supposed to receive on June 4th an email with local information. Please check your spam folder.

Monday, 8th June

08:00 - 09:00	Registration
08:20 - 08:50	Coffee/Tea
08:50 - 09:00	Welcome/Introductory remarks

Session chair: Ola Svensson

09:00 - 09:50	Invited survey talk: Ellen Vitercik — Survey on machine learning for combinatorial optimization
09:50 - 10:20	Daniel DeLayo — Don’t Melt Your Cache: Low Associativity with Heat Sink
10:20 - 10:50	Coffee Break

Session chair: Artur Czumaj

10:50 - 11:40	Invited survey talk: Pravesh Kothari — Eigenvalues of Kikuchi Graphs and Their (Many) Applications
11:40 - 12:10	Davi Castro-Silva — Algorithmic Polynomial Freiman-Ruzsa Theorem
12:10 - 12:40	Michał Seweryn — Polynomial Bounds for the Graph Minor Structure Theorem
12:40 - 14:10	Lunch

Session chair: Ioana Bercea

14:10 - 15:40	Contributed talks of 3+1 minutes
Yotam Kenneth-Mordoch and Robert Krauthgamer Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow Kurt Mehlhorn A Counterexample to EFX, $n \ge 3$ Agents, $m \ge n + 5$ Items, Monotone Valuations via SAT-Solving Ce Jin, Yael Kirkpatrick, Michal Stawarz and Virginia Vassilevska Williams Improved Additive Approximation Algorithms for APSP Shaofeng H.-C. Jiang, Robert Krauthgamer, Shay Sapir, Sandeep Silwal and Di Yue Dimension Reduction for Clustering: The Curious Case of Discrete Centers Jannis Blauth and Ramin Mousavi A Constant-Factor Approximation for Directed Latency Hendrik Fichtenberger, Michael Kapralov, Ekaterina Kochetkova, Silvio Lattanzi, Davide Mazzali and Weronika Wrzos-Kaminska Spectral Clustering with Side Information Marta Piecyk and Paweł Rzążewski List coloring ordered graphs with forbidden induced subgraphs Asaf Shapira, Ronitt Rubinfeld, Shlomo Tauber, Cassandra Marcussen and Ted Pyne A Fast Coloring Oracle for Average Case Hypergraphs David Orlando Alejandro Aleman Espinosa, Naveen Garg, Sharat Ibrahimpur, Neil Olver and Chaitanya Swamy Stochastic Load Balancing with Machine Reservations Maxime Flin, Magnús M. Halldórsson, Manuel Jakob and Yannic Maus Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors Antoine El-Hayek, Monika Henzinger and Jason Li Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time Tim A. Hartmann and Dániel Marx Independence and Domination on Bounded-Treewidth Graphs Debarati Das, Evangelos Kipouridis and Joachim Spoerhase Tree Violation Distance under Constraints Christian Coester, Yichen Huang and Michael Mitzenmacher Competitive Online Clustering with Movement Cost Davin Choo, Billy Jin and Yongho Shin Learning-Augmented Online Bipartite Fractional Matching Christian Coester, Alexa Tudose and Alexander Turoczy Learning-Augmented Online Minimization with Dual Predictions Filip Jasionowicz and Sandra Kiefer Finding Induced Detours in Linear Time on Interval and Circular-Arc Graphs Ziad Ismaili Alaoui, Tamio-Vesa Nakajima, Namrata and Sebastian Wild Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs Robert Andrews, Jules Armand, Prateek Dwivedi, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, Srikanth Srinivasan and Sébastien Tavenas On Closure Properties of Read-Once Oblivious Algebraic Branching Programs Dimitris Fotakis, Charalampos Platanos and Thanos Tolias Online Resource Allocation via Static Bundle Pricing Gramoz Goranci, Shaofeng Jiang, Peter Kiss, Qihao Kong, Yi Qian and Eva Szilagyi Tree Embedding in High Dimensions: Dynamic and Massively Parallel
15:40 - 16:40	Coffee Break & Poster Session

Session chair: Robi Krauthgamer

16:40 - 17:10	Sam Hopkins — SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
17:10 - 17:40	MohammadTaghi Hajiaghayi — Breaking a Long-Standing Barrier: $2-\epsilon$ Approximation for Steiner Forest
17:40 - 18:10	Ekin Ergen — Online Makespan Scheduling under Scenarios

Tuesday, 9th June

08:30 - 09:00

Coffee/Tea

Session chair: Per Austrin

09:00 - 09:50	Invited survey talk: Danupon Nanongkai — Recent Advances in Fast Graph Algorithms
09:50 - 10:20	Timothy M. Chan — A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
10:20 - 10:50	Coffee Break

Session chair: Fabrizio Grandoni

10:50 - 11:40	Invited survey talk: Shuchi Chawla — A survey on optimization with costly information
11:40 - 12:10	Jun-Ting Hsieh — Explicit Lossless Vertex Expanders
12:10 - 12:40	Martin Costa — Vizing’s Theorem in Near-Linear Time
12:40 - 14:10	Lunch

Session chair: Ola Svensson

14:10 - 15:40	Contributed talks of 3+1 minutes
Mika Göös, Nathaniel Harms, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov and Weiqiang Yuan Pseudodeterministic Communication Complexity Thekla Hamm, Sukanya Pandey and Krisztina Szilagyi A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs Sayan Bhattacharya, Ermiya Farokhnejad and Haoze Wang Additive One Approximation for Minimum Degree Spanning Tree: Breaking the $O(mn)$ Time Barrier Ben Bals, Matei Tinca and Solon P. Pissis Optimal Enumeration of Eulerian Trails in Directed Graphs Bartłomiej Dudek, Nick Fischer, Geri Gokaj, Ce Jin, Marvin Künnemann, Xiao Mao and Mirza Redzic Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection Sebastian Lüderssen, Stefan Neumann and Pan Peng Near-Optimal Four-Cycle Counting in Graph Streams Grzegorz Ryn and Jakub Kozik Two-colorability and Sharp Thresholds in Random Non-Uniform Hypergraphs Anne Driemel, Jan Höckendorff, Ioannis Psarros, Christian Sohler and Di Yue Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics Kunal Dutta, Agastya Vibhuti Jha and Haotian Jiang Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence Simon Döring, Philip Wellnitz, Sarah Houdaigoui and Lucas Picasarri-Arrieta The Complexity of Finding and Counting Subtournaments Simone Moretti, Paolo Pellizzoni, Andrea Pietracaprina and Geppino Pucci Dynamic $k$-center clustering with lifetimes Amir Carmel and Robert Krauthgamer Stable coresets: Unleashing the power of uniform sampling Jakob Greilhuber and Dániel Marx The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs Simone Moretti, Paolo Pellizzoni and Francesco Silvestri Dimensionality Reduction on Complex Vector Spaces for Euclidean Distance with Dynamic Weights Anita Dürr, Karol Węgrzycki and Karl Bringmann Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling Elad Tzalik and Elizaveta Popova New Greedy Spanners and Applications Arnold Filtser and Ameet Gadekar FPT approximations for Capacitated Sum of Radii and Diameters Hannaneh Akrami, Ryoga Mahara, Kurt Mehlhorn and Nidhi Rathi Achieving EF1 and Epistemic EFX Guarantees Simultaneously Nathan Wallheimer, Ron Safier and Amir Abboud Triangle Detection in H-Free Graphs Aryan Agarwala and Nithin Varma Pseudodeterministic Algorithms for Minimum Cut Problems
15:40 - 16:40	Coffee Break & Poster Session

Session chair: Tobias Mömke

16:40 - 17:10	Agastya Jha — Quasi-Monte Carlo Beyond Hardy-Krause
17:10 - 17:40	Natalie Collina — Swap Regret and Correlated Equilibria Beyond Normal-Form Games

17:40 - 18:10	Light dinner sponsored by Jane Street
18:10 - 19:30	Business Meeting

Wednesday, 10th June

08:30 - 09:00

Coffee/Tea

Session chair: Standa Zivny

09:00 - 09:50	Invited survey talk: Virginia Vassilevska Williams — On matrix multiplication algorithms
09:50 - 10:20	Nutan Limaye — Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
10:20 - 10:50	Coffee Break

Session chair: Aristides Gionis

10:50 - 11:40	Invited survey talk: Jon Kleinberg — Language Generation in the Limit
11:40 - 12:10	Sitan Chen — Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions
12:10 - 12:40	Neekon Vafa — Symmetric Perceptrons, Number Partitioning and Lattices
12:40 - 14:10	Lunch

Session chair: Ioana Bercea

14:10 - 15:40	Contributed talks of 3+1 minutes
Negar Babashah, Hasti Karimi, Masoud Seddighin and Golnoosh Shahkarami Distortion of Multi-Winner Elections on the Line Metric: The Polar Comparison Rule Quentin Hillebrand, Pasin Manurangsi, Vorapong Suppakitpaisarn and Phanu Vajanopath Improved Differentially Private Algorithms for Rank Aggregation Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum and Jiaheng Wang Rapid mixing of the flip chain over non-crossing spanning trees Mikkel Thorup, Hanzhi Wang, Zhewei Wei and Mingji Yang PageRank Centrality in Directed Graphs with Bounded In-Degree Mirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen and Kevin Schewior Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules Michael A. Bender, Martín Farach-Colton, Michael T. Goodrich and Hanna Komlos History-Independent Dynamic Partitioning with Applications to B-Trees, Skip Lists and Fusion Trees Nick Fischer, Evangelos Kipouridis, Jonas Klausen and Mikkel Thorup A Faster Algorithm for Constrained Correlation Clustering Anastasios Kyrillidis, Ria Stevens, Jasper Liao, Barbara Su and Jianqiang Li Exploiting Low-Rank Structure in Max-K-Cut Problems Harish Chandramouleeswaran, Ilan Newman, Tomer Pelleg and Nithin Varma Testing forbidden order-pattern properties on hypergrids Florian Schager, Yannic Maus and Alexandre Nolin Fast Deterministic Distributed Degree Splitting Shubhransh Singhvi Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors Daniel Agassy, Dani Dorfman and Haim Kaplan Improved Tree Sparsifiers in Near-Linear Time Michael Kapralov, Ekaterina Kochetkova and Weronika Wrzos-Kaminska Spectral Clustering in Birthday Paradox Time Emilio Cruciani, Sebastian Forster and Antonis Skarlatos Incremental (k, z)-Clustering on Graphs José Correa, Andrés Cristi, Vasilis Livanos, Víctor Verdugo and Jiechen Zhang On the Informativeness of Moments in Optimal Stopping Hung Le, Lazar Milenković, Shay Solomon and Tianyi Zhang Covering the Euclidean Plane by a Pair of Trees Karthik Gajulapalli, Alexander Golovnev, Sam King and Sidhant Saraogi Online Orthogonal Vectors Revisited Venkatesan Guruswami, Xin Lyu and Weiqiang Yuan Cell-Probe Lower Bounds via Semi-Random CSP Refutation: Simplified and the Odd-Locality Case Paul Paschmanns and Vera Traub The Bidirected Cut Relaxation for Steiner Tree: Better Integrality Gap Bounds and the Limits of Moat Growing Yi-Jun Chang, Yanyu Chen, Dipan Dey, Yonggang Jiang, Gopinath Mishra, Hung Thuan Nguyen and Mingyang Yang The Complexity of Distributed Minimum Weight Cycle Approximation Robert Krauthgamer and Dvir Peretz Streaming Geometric Problems with Bounded Deletions
15:40 - 16:40	Coffee Break & Poster Session

Session chair: Guy Even

16:40 - 17:10	Bobby Kleinberg — Algorithms for Omniprediction
17:10 - 17:40	Maxwell Fishelson — Breaking the $T^{2/3}$ Barrier for Sequential Calibration