ESA 2026

Important Dates

  • Abstract submission deadline: April 21, anywhere on Earth.
  • Paper submission deadline: April 23, anywhere on Earth.
  • Notification: June 26

Call for Papers

The symposium seeks original algorithmic contributions for problems with relevant theoretical and/or practical applications. Papers with a strong emphasis on the theoretical analysis of algorithms should be submitted to Track A, while papers reporting the results of extensive experimental evaluations and/or providing original contributions to the engineering of algorithms for practical applications should be submitted to Track E. Submissions that prove or explain results, possibly already known, in a particularly clear, simple or elegant way should be submitted to Track S.

There will be a Best Student Paper Award as well as a Best Paper Award, both sponsored by EATCS. In order for a paper to be considered for the Best Student Paper Award, all of its authors are required to be students (including PhD candidates) at the time of submission.

Paper submission and proceedings

Papers should be submitted electronically via the EasyChair submission system. The ESA 2026 proceedings will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series.

Submission Guidelines

Authors are invited to submit an extended abstract or full paper. Submissions must be formatted in accordance with the LIPIcs proceedings guidelines and may not exceed 500 lines of text. Authors must use the LaTeX class file socg-lipics-v2021.cls; for a quick start, duplicate this Overleaf project.

Proofs omitted due to the line constraint must be placed in an appendix. This appendix can even comprise an entire full version of the paper. The appendix will be read by the program committee members at their discretion. In particular, appendices of accepted papers are not going to be published in the proceedings. The main part of the submission should therefore contain a clear technical presentation of the merits of the paper, including a discussion of the paper’s importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims.

These guidelines are strict: submissions deviating significantly from these guidelines risk being rejected without consideration of their merits. Papers must be submitted electronically via the EasyChair submission system. Results previously published (or scheduled for publication) in another conference proceedings or journal should not be submitted to ESA. Simultaneous submission to other conferences with published proceedings, journals, or to multiple tracks of ESA 2026 is also not permitted. By submitting a paper the authors acknowledge that in case of acceptance, at least one of the authors must register at ALGO 2026, attend the conference on-site and present the paper. Papers with no author fulfilling this requirement may risk being removed from the final conference proceedings (unless there are extenuating circumstances).

Precise format definitions

Submissions are not anonymous. The title page should contain the title, authors’ names and affiliations, and a concise abstract. Submissions must not exceed 500 lines, excluding front matter (title, authors, and affiliations), references, and a clearly marked appendix (further described below), but including all other lines, even those in the abstract, algorithms, tables, captions, etc.

The class files provide line counting which should be accurate in most cases. Authors should refrain from putting excessive amounts of text in parts in which lines are not counted automatically. If authors need constructs that contain uncounted lines of text, they should compensate for this by reducing the final line count accordingly. It is the sole responsibility of the authors to not exceed 500 lines even if some lines are not counted automatically. In case of doubt (such as substantial amounts of text appearing as part of a graphic), the actual text content as judged by the program committee will replace the automated line count in deciding conformity.

TeXnical details

Authors must use the socg-lipics-v2021.cls class, which is a lightweight wrapper for the standard LIPIcs document class lipics-v2021. The LIPIcs document class is available from the publisher here (under Author Instructions). Use socg-lipics-v2021 version 0.9 (updated in 2022) and lipics-v2021 version 3.1.3 (updated 2023-05-12).

Further instructions on how to use socg-lipics-v2021 are available here.
The first page describes everything needed for the “standard use case”; the rest of the document goes into detail on how to manually correct the line counting in custom environments, should you desire to do so.

The socg-lipics-v2021 document class and its documentation have originally been developed for the International Symposium on Computational Geometry, SoCG, (hence the name of the document class), but it is a generic template for LIPIcs papers with line counts.

Conflict of Interest

The conference will employ a single-blind reviewing process. Still, when submitting a paper, please indicate Conflict of Interest (CoI) with PC members. A CoI is limited to the following categories:

  1. Family member or close friend.
  2. Ph.D. advisor or advisee (no time limit), or postdoc or undergraduate mentor or mentee within the past 5 years.
  3. Person with the same affiliation.
  4. Involved in an alleged incident of harassment. (It is not required that the incident be reported.)
  5. Reviewer owes author a favor (e.g., recently requested a reference letter).
  6. Frequent or recent collaborator whom you believe cannot objectively review your work.

Topics

Papers presenting original research in all areas of algorithmic research are sought, including but not limited to:

  • Algorithm engineering
  • Algorithmic aspects of networks
  • Algorithmic game theory
  • Algorithmic data science
  • Approximation algorithms
  • Computational biology
  • Computational finance
  • Computational geometry
  • Combinatorial optimization
  • Data compression
  • Data structures
  • Databases and information retrieval
  • Distributed and parallel computing
  • Graph algorithms
  • Hierarchical memories
  • Heuristics and meta-heuristics
  • Mathematical programming
  • Mobile computing
  • Online algorithms
  • Parameterized algorithms
  • Pattern matching
  • Quantum computing
  • Randomized algorithms
  • Scheduling and resource allocation problems
  • Streaming algorithms

Committees

PC CHAIRS

PC MEMBERS (TRACK A)

  • Deeksha Adil (ETH Zürich, Switzerland)
  • Kristoffer Arnsfelt-Hansen (Aarhus University, Denmark)
  • Lorenzo Beretta (IBM Research, USA)
  • Sebastian Brandt (CISPA Helmholtz Center for Information Security, Germany)
  • Jarosław Błasiok (Bocconi University, Italy)
  • Karthik C. S. (Rutgers University, USA)
  • Deeparnab Chakrabarty (Dartmouth College, USA)
  • Christian Coester (University of Oxford, UK)
  • Sami Davies (UC Berkeley and RelationalAI, USA)
  • Kunal Dutta (University of Warsaw, Poland)
  • Klim Efremenko (Ben Gurion University, Israel)
  • Robert Ganian (Vienna University of Technology, Austria)
  • Prantar Ghosh (Tennessee Technological University, USA)
  • Rohan Ghuge (University of Texas at Austin, USA)
  • Gramoz Goranci (University of Vienna, Austria)
  • Yassine Hamoudi (Université de Bordeaux, France)
  • David Harris (University of Maryland, USA)
  • Haotian Jiang (University of Chicago, USA)
  • John Kallaugher (National University of Singapore, Singapore)
  • Petteri Kaski (Aalto University, Finland)
  • Dominik Kempa (Stony Brook University, USA)
  • Sándor Kisfaludi-Bak (Aalto University, Finland)
  • Hanna Komlós (Max Planck Institute for Informatics, Germany)
  • Tsvi Kopelowitz (Bar-Ilan University, Israel)
  • Stefan Kratsch (Humboldt-Universität zu Berlin, Germany)
  • William Kuszmaul (Carnegie Mellon University, USA)
  • Michael Lampis (LAMSADE, Université Paris Dauphine, France)
  • Yi Li (Nanyang Technological University, Singapore)
  • Yannic Maus (TU Graz, Austria)
  • Sagnik Mukhopadhyay (University of Birmingham, UK)
  • Christopher Musco (New York University, USA)
  • Aleksandar Nikolov (University of Toronto, Canada)
  • Marcin Pilipczuk (University of Warsaw, Poland)
  • Adam Polak (Bocconi University, Italy)
  • Benjamin Raichel (UT Dallas, USA)
  • Peter Robinson (Augusta University, USA)
  • Jiří Sgall (Computer Science Institute of Charles University, Czech Republic)
  • Jessica Sorrell (Johns Hopkins University, USA)
  • Tatiana Starikovskaya (École Normale Supérieure, France)
  • He Sun (University of Chinese Academy of Sciences, China)
  • Paloma T. de Lima (Norwegian School of Economics, Norway, and IT University of Copenhagen, Denmark)
  • Csaba Tóth (California State University Northridge, USA)
  • Bartosz Walczak (Jagiellonian University, Poland)
  • Stefan Walzer (Karlsruhe Institute of Technology, Germany)
  • Haitao Wang (University of Utah, USA)
  • Karol Węgrzycki (Max Planck Institute for Informatics, Germany)
  • Nicole Wein (University of Michigan, USA)
  • Andreas Wiese (Technical University of Munich, Germany)
  • Sampson Wong (University of Copenhagen, Denmark)
  • Mingyu Xiao (University of Electronic Science and Technology of China, China)
  • Fang-Yi Yu (George Mason University, USA)
  • Huacheng Yu (Princeton University, USA)
  • Meirav Zehavi (Ben-Gurion University, Israel)
  • Tianyi Zhang (Nanjing University, China)
  • Da Wei Zheng (Institute of Science and Technology, Austria)
  • Anna Zych-Pawlewicz (University of Warsaw, Poland)

PC MEMBERS (TRACK E)

  • Maike Buchin (Ruhr Universität Bochum)
  • Martin Koutecký (Charles University in Prague)
  • Vincent Jugé (LIGM – Université Paris-Est Marne-la-Vallée)
  • Laurent Viennot (INRIA)
  • Soeren Terziadis (TUM, Heilbronn)
  • Bora Ucar (CNRS and LIP ENS Lyon)
  • Andre Schidler (Uni Freiburg)
  • Dachuan Xu (Beijing University of Technology)
  • Gonzalo Navarro (University of Chile)
  • Yihan Sun (University of California, Riverside)
  • Thomas Bläsius (Karlsruhe Institute of Technology)
  • Ernestine Großmann (Universiät Heidelberg)
  • Valentin Polishchuk (Linkoping University)
  • Pierre-Louis Poirion (RIKEN-AIP)
  • Christina Boucher (University of Florida)
  • Giulio Ermanno Pibiri (Ca’ Foscari University of Venice)
  • Kathrin Hanauer (University of Vienna)

PC MEMBERS (TRACK S)

  • Alexander Conway (Cornell Tech, USA)
  • Christian Janos Lebeda (INRIA, France)
  • Danny Hermelin (Ben Gurion University, Israel)
  • Francesco Silvestri (University of Padova, Italy)
  • Hideo Bannai (Institute of Science Tokyo, Japan)
  • Holger Dell (IT University of Copenhagen, Denmark)
  • Ioana O. Bercea (KTH Royal Institute of Technology, Sweden)
  • László Kozma (Dresden University of Technology, Germany)
  • Lene Monrad Favrholdt (University of Southern Denmark, Denmark)
  • Miguel Mosteiro (Pace University, USA)
  • Mikkel Abrahamsen (University of Copenhagen, Denmark)
  • Nick Fischer (Max Planck Institute for Informatics, Germany)
  • Nodari Sitchinava (University of Hawaii, USA)
  • Oren Weimann (University of Haifa, Israel)
  • Panagiotis Charalampopoulos (King’s College, London)
  • Radu Curticapean (University of Regensburg, Germany)
  • Shay Mozes (Reichman University, Israel)
  • Solon Pissis (Centrum Wiskunde & Informatica, The Netherlands)
  • Teresa Anna Steiner (University of Southern Denmark, Denmark)
  • Thore Husfeldt (IT University of Copenhagen, Denmark)

STEERING COMMITTEE

  • Anne Benoit (ENS Lyon)
  • Philip Bille (Danish Technical University)
  • Timothy M. Chan (University of Illinois)
  • Johannes Fischer (Technical University of Dortmund)
  • John Iacono (Université libre de Bruxelles)
  • Haim Kaplan (Tel Aviv University)
  • Seth Pettie (University of Michigan)
  • Solon Pissis (The Cyprus Institute)
  • Simon J. Puglisi (University of Helsinki, chair)
  • Sabine Storandt (University of Konstanz)
  • Sebastian Wild (University of Marburg)

Accepted Papers

  • Joseph Mitchell and Linh Nguyen. On The See-Through Watchman Route Problem and The Quota-TSP Problem on Infinite Lines.
  • Dmitriy Gribanov, Tagir Khayaleyev, Mikhail Cherniavskii, Maxim Klimenko, Dmitry Malyshev, and Stanislav Moiseev. Algorithms for Standard-form ILP Problems via Komlós’ Discrepancy Setting.
  • Hugo A. Akitaya, Joseph Dorfer, Peter Kramer, Christian Rieck, Gabriel Shahrouzi, and Frederick Stock. Sliding Cubes in Parallel.
  • Mark de Berg, Ulrike Schmidt-Kraepelin, and Andree Stef. On the Stability of Minimum-Weight Perfect Matching on the Line.
  • Timo Brand, Stefan Felsner, Henry Förster, Stephen Kobourov, Anna Lubiw, Yoshio Okamoto, János Pach, Csaba D. Tóth, Géza Tóth, Torsten Ueckerdt, and Pavel Valtr. Rerouting Curves on Surfaces.
  • Jakub Pawlewicz. Multiple-Choice Knapsack with Small Items.
  • Paweł Rafał Bieliński, Marta Piecyk, and Paweł Rzążewski. Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs.
  • Greg Bodwin and Aleksey Lopez. Unconditional Lower Bounds for Degree Fault Tolerant Spanners.
  • Sang-il Oum and Marek Sokołowski. Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions.
  • Petr Hlineny and Lukas Malik. Conflict-Free Coloring Planar Graphs with 4 Colors.
  • Pankaj Agarwal, Esther Ezra, and Micha Sharir. Triangle Nearest-Neighbor Searching in 3-Space.
  • Daniel Dadush, Michał Pilipczuk, Amadeus Reinald, Marek Sokołowski, and Michał Włodarczyk. Dynamic Detours.
  • Will Rosenbaum. A Quadratic Lower Bound for Stable Roommates Solvability.
  • Susanna Caroppo, Jevgēnijs Vihrovs, Dārta Zajakina, and Aleksejs Zajakins. Quantum Time-Space Tradeoffs for Exponential Dynamic Programming.
  • Christian Schulz, Jakob Ternes, and Henning Martin Woydt. Advances in Exact and Approximate Group Closeness Centrality Maximization.
  • Manuel Cáceres, Sándor Kisfaludi-Bak, and Saeed Odak. Shifting is Optimal under Gap-ETH: A Lower Bound Framework for Geometric Approximation Schemes.
  • Ilan Newman, Noam Licht, and Yuri Rabinovich. Deterministic Online Embedding of Metric Spaces into Low Dimensional Spaces.
  • Etienne Objois and Adrian Vladu. Adaptive Sparsification for Linear Programming.
  • Sariel Har-Peled. The Prophet and the Voronoi Diagram.
  • Hoang Ta and Hoa Vu. Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams.
  • Gerth Stølting Brodal. Algorithm Exercises Skyline and Young Tableau: Divide-and-Conquer Revisited.
  • Mook Kwon Jung and Hee-Kap Ahn. Smallest convex hulls of polygons.
  • Lejian Zhang, Xueyan Tang, and Jing Tang. Data-dependent Evaluations for Budgeted Submodular Maximization.
  • Ivor van der Hoog, John Iacono, Eva Rotenberg, and Daniel Rutschmann. Near-Optimal Heaps and Dijkstra on Pointer Machines.
  • Elad Tzalik. Greedy Completion for Weighted $(\alpha,\beta)$-Spanners.
  • Boning Meng and Yicheng Pan. Dichotomies for #CSP on graphs that forbid a clique as a minor.
  • Matthew Katz, Yuval Nidam, Rachel Saban, and Micha Sharir. Matching in geometric uniform hypergraphs.
  • Marc Glisse. Persistent homology on GPU for 1d and 2d cubical filtrations.
  • Akanksha Agrawal, Pradeesha Ashok, Matthias Bentert, Satyabrata Jana, Abishek Sahu, Saket Saurabh, and Kushal Singanporia. Computational Boundaries for Escaping Rectangles.
  • Édouard Bonnet, Yeonsu Chang, Julien Duron, Colin Geniet, and O-Joung Kwon. Moderately Beyond Clique-Width: Reduced Component Max-Leaf and Related Parameters.
  • Pawel Gawrychowski, Adam Górkiewicz, and Srinivasa Rao Satti. Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries.
  • Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Johanne Vistisen, and Sampson Wong. A dynamic (1+ε)-spanner for disk intersection graphs.
  • Anita Dürr, Karol Węgrzycki, Anubhav Dhar, Jakob Greilhuber, and Ahmed Ghazy. Faster Exponential Algorithms For Multi-Machine Scheduling Problems.
  • Sebastian Bruchhold, Franziska Eberle, Georgios Moneftsis, Malin Rau, and Albert Vesterlund. Online Demand Strip Packing.
  • Takaaki Nishimoto and Yasuo Tabei. Dynamic Grammar-Compressed Self-Index in δ-Optimal Space.
  • Yossi Azar, Itamar Biran, and Amos Fiat. Multi Choice Min Prophet.
  • Sergio Cabello, Alexander Dobler, Gašper Fijavž, Thekla Hamm, and Mirko H. Wagner. Linear-Time Vertex-Connectivity on Bounded Genus.
  • Tijn de Vos and Mara Grilnberger. Dynamic Matroids: Base Packing and Covering.
  • Jingbang Chen, Jiangqi Dai, Qiuyang Mang, Qingyu Shi, and Tingqiang Xu. Nearly Optimal Internal Dictionary Matching.
  • Ben Bals, Joakim Blikstad, Daniel Dadush, Yasamin Nazari, and Jonas Schmidt. Revisiting Diameter in Directed Graphs.
  • Ben Bals, Solon P. Pissis, and Matei Tinca. Optimal Enumeration of Eulerian Trails in Directed Graphs.
  • Da Wei Zheng. Real-weighted Diameter and Eccentricity of Minor-free and Bounded VC-dimension Graphs in Truly Subquadratic Time.
  • Adam Polak and Jonas Schmidt. Warm-Starting All-Pairs Shortest Paths with Predictions.
  • Cornelius Brand, Petteri Kaski, and Jiaheng Wang. Partition Rank and Algebraic Circuit Lower Bounds.
  • Nathan Wallheimer, Amir Abboud, and Ron Safier. Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs.
  • Yossi Azar and Liad Iluz. Beyond Monotone Delays for Multi-Level Aggregation.
  • Avi Kadria, Liam Roditty, and Virginia Vassilevska Williams. Improved Approximation Algorithms for n-Pairs Shortest Paths.
  • Markus Anders, Manuel Penschuck, and Pascal Schweitzer. Symmetry-Preserving Graph Compression.
  • Reilly Browne and Prahlad Narasimhan Kasthurirangan. Decomposing a Simple Polygon with Geodesic Unit-Balls.
  • Ben Bals, Panagiotis Charalampopoulos, Oded Lachish, Solon P. Pissis, and Hilde Verbeek. Text Indexing: From Reporting to Counting.
  • Huairui Chu, Ajaykrishnan E S, Daniel Lokshtanov, Anikait Mundhra, Thomas Schibler, Xiaoyang Xu, and Jie Xue. Parameterized Approximation of Rectangle Stabbing.
  • Nimrod Kaplan, Haim Kaplan, and Tamara Kaplan. Streaming with Catalytic Memory.
  • Yupan Liu, Qisheng Wang, and Zhan Yu. On estimating operator norm distance, with optimal trace distance estimation when one state is pure.
  • Yu Cheng, Tianle Jiang, Pachara Sawettamalya, and Huacheng Yu. On the Communication Complexity of Maximum Matching and Shortest Paths.
  • Édouard Bonnet. Answering Related Questions.
  • Florian Kurpicz, Niccolò Rigi-Luperti, and Peter Sanders. Practical Bit Vectors Supporting Constant Time Rank and Select in Optimal Space.
  • Jonas Sauer, Patrick Steil, and Sascha Witt. T-REX: Fast and Dynamic Journey Planning for Continental-Scale Public Transit Networks.
  • Michael Lampis and Yiren Lu. Pure Nash Equilibria in Graphical Games of Bounded Width Revisited.
  • Ivor van der Hoog, Eva Rotenberg, Jack Spalding-Jamieson, and Lasse Wulf. The Presort Hierarchy for Geometric Problems.
  • Marin Bougeret, Guilherme de Castro Mendes Gomes, and Ignasi Sau. A more versatile model for enumerative kernelization: a case study for Vertex Cover.
  • Václav Blažej, J. Pascal Gollin, Tomáš Hons, Tomáš Masařík, Martin Milanič, Paweł Rzążewski, Ondřej Suchý, and Alexandra Wesolek. Tree-independence number of $P_5$-free graphs with no large bicliques.
  • Ioana O. Bercea, Gerth Stølting Brodal, John Iacono, László Kozma, and Debmalya Panigrahi. Learning-Augmented Online Sorting and TSP.
  • Yike Chen and Chao Xu. Unimodal-Cost $k$-Median on a Line.
  • László Kozma and Johannes Voderholzer. Theoretical Analysis of Byte-Pair Encoding.
  • Christian Coester and Alexander Turoczy. Primal-Dual Online Algorithms for the Parking Permit Problem.
  • Avi Kadria, Liam Roditty, and Virginia Vassilevska Williams. Tighter bounds for weighted and unweighted shortest cycle approximation.
  • Akitoshi Kawamura and Yusuke Kobayashi. A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering.
  • Javier Cembrano, Max Klimm, Martin Knaack, and Arturo Merino. Strategyproof Mechanisms Without Money for 2-Exchange Systems.
  • Indu Ramesh and Christopher Musco. Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector Products.
  • Pan Peng, Christian Sohler, and Yi Xu. Sublinear Algorithms for Estimating Single-Linkage Clustering Costs.
  • Tomohiro Koana and Soh Kumabe. Kernelization for H-Packing Revisited.
  • Eunjin Oh and Hyeonjun Shin. Fully Scalable MPC Algorithms for WSPD in Doubling and Euclidean Spaces.
  • Eduard Eiben, Tomohiro Koana, and Magnus Wahlström. FPT algorithms over linear delta-matroids with applications.
  • Koustav Das and Manoj Gupta. Approximate Single Source Dual Fault Tolerant Distance Oracle.
  • Colin Geniet and Roohani Sharma. Reducing CMSO to Unbreakable Graphs Cannot be Computable.
  • László Kozma and Michal Opler. Compact representations of pattern-avoiding permutations.
  • Yusuke Kobayashi and Takashi Noguchi. An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers.
  • Sujoy Bhore, Hsien-Chih Chang, Jonathan Conroy, Arnold Filtser, Eunjin Oh, Nicole Wein and Da Wei Zheng. DAG Covers: The Steiner Point Effect.
  • Robert Krauthgamer, Asaf Petruschka, and Nir Petruschka. Fast Metric Decompositions in High Dimension.
  • Robert Bredereck, Till Fluschnik, and Klaus Heeger. Scheduling Tasks towards Energy Autarky: Benefits and Computational Costs of Flexibility.
  • Anne Driemel, Jan Höckendorff, Ioannis Psarros, and Christian Sohler. Time Series Decomposition using the Fréchet Distance.
  • Jakob Greilhuber and Dániel Marx. The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs.
  • Lotte Blank, David Eppstein, Jan-Henrik Haunert, Herman Haverkort, Benedikt Kolbe, Philip Mayer, Petra Mutzel, Alexander Naumann, and Jonas Sauer. Bicriteria Polygon Aggregation with Arbitrary Shapes.
  • Ahmed Ghazy, Jakob Greilhuber, Tim A. Hartmann, and Roohani Sharma. Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-eta Deletion.
  • Nikolai Maas. High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing.
  • Panagiotis Charalampopoulos, Taha El Ghazi, Jonas Ellert, Paweł Gawrychowski, and Tatiana Starikovskaya. Online Approximate Circular Pattern Matching in Small Space.
  • Lars Rohwedder and Leander Schnaars. Graph Scheduling with Group Completion Times.
  • Ivor van der Hoog, Eva Rotenberg, and Daniel Rutschmann. Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection.
  • Daniel Faber, Petra Mutzel, and Jan-Henrik Haunert. Strong ILP Formulations for the p-Regions Problem.
  • Kevin Buchin, Jacobus Conradi, Sariel Har-Peled, Antonia Kalb, Abhiruk Lahiri, Lukas Plätz, Carolin Rehs, and Sampson Wong. On Small Pair Decompositions for Point Sets.
  • Stefan Kratsch. A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth.
  • Finn Moltmann, Tamio-Vesa Nakajima, and Sebastian Wild. Virtual-Memory Powersort.
  • Katie Clinch, Serge Gaspers, Simon Mackenzie, and Qi Wang. Faster Exponential-Time Approximate Counting via Bounded Self-Reductions.
  • Sebastian Angrick, Ben Bals, Pawel Gawrychowski, Solon P. Pissis, and Yuki Yonemoto. String Matching in (Block) Graphs: A Full Classification by Walk Length.
  • Sarita de Berg, Nynne Maria Foldager Bække, Frida Astrup Eriksen, Ivor van der Hoog, Eva Rotenberg, and Daniel Rutschmann. Instance and Universally Optimal Bounds for Imprecise Pareto Fronts.
  • Stefan Hermann, Mattia Odorisio, Peter Sanders, and Stefan Walzer. Deconstructed Learned Indexes and their Smoothed Analysis.
  • Thomas Depian and Frank Sommer. Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii.
  • Manuel Cáceres, Andreas Grigorjew, Wanchote Po Jiamjitrak, and Alexandru I. Tomescu. Maximum Coverage k-Antichains and Chains: A Greedy Approach.
  • Johannes Breitling, Ragnar Groot Koerkamp, and Marvin Williams. SimdQuickHeap: The QuickHeap Reconsidered.
  • Anton Bukov and Shay Solomon. Dynamic Dominating Set in Uniformly Sparse Graphs.
  • Elie Bermot, Simon Apers, and Arthur Braida. Log-concavity and tunneling: quantum adiabatic algorithm for convex functions (with a spike).
  • Thijs van der Horst and Tim Ophelders. A Strongly-Subquadratic (3+ε)-Approximation for the Fréchet Distance for Paths in Metric Spaces.
  • Fritz Bökler, Markus Chimani, and Henning Jasper. One-Exact Approximate Pareto Sets for APX-hard Multiobjective Problems.
  • Yotam Kenneth-Mordoch and Shay Sapir. On the Adversarial Robustness of Online Importance Sampling.
  • Thobias Kvalvik Høivik and Erlend Raa Vågset. Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width.
  • Thomas Erlebach, Kelin Luo, and Wen Zhang. Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones.
  • Narek Bojikian and Stefan Kratsch. Tight bounds for clique-packing parameterized by clique-width.
  • Matthijs Ebbens, Jie Lu, and Alexander Munteanu. Dimension Reduction for Curves — Simplified and Generalized.
  • Sujoy Bhore, Ahmad Biniaz, Kevin Buchin, Jean-Lou De Carufel, Antonia Kalb, Anil Maheshwari, Saeed Odak, Carolin Rehs and Michiel Smid. Sparse Oriented Spanners in Metric Spaces.
  • Sergei Khargeliia and Danil Sagunov. Exploiting Spanning Trees for Directed Acyclicity.
  • Anupam Roy and Surender Baswana. All-Pairs $k^{th}$ Mincuts: Generalizing ancestor tree of Cheng and Hu.
  • Christian Konrad, Kheeran Naidu, Archie Walton, and Eric Wang. On the Assadi–Liu–Tarjan Auction Algorithm for Bipartite Matching: Simplification, Alternative Analysis, and Hard Instance.
  • Mauricio Cari, Martín Muñoz, and Cristian Riveros. A simple algorithmic framework for disambiguation of finite automata.
  • Argyrios Deligkas, Michelle Döring, Eduard Eiben, George Skretas, and Georg Tennigkeit. Maximizing Reachability via Shifting of Temporal Paths.
  • Lukas Geis, Daniel Allendorf, Thomas Bläsius, Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck, and Hung Tran. Efficient Uniform Negative Edge Weights.
  • Pankaj Agarwal, Sharath Raghvendra, and Keegan Yao. Fast Algorithms for Continuous Optimal Transport between Histograms.
  • Lukas Hintze and Manuel Penschuck. No Time to Interact: Simulating Population Protocols at Scale.
  • Kevin Buchin, Mark Joachim Krallmann, and Frank Staals. Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams.
  • Ferdinando Cicalese, Travis Gagie, Zsuzsanna Liptak, Gonzalo Navarro, Nicola Prezza, and Cristian Urbina. Incongruity-sensitive access to highly compressed strings.
  • Laura Merker, Lena Scherzer, and Samuel Schneider. Separating Geodesic Structure and Product Structure.
  • Hirotaka Yoneda and Masataka Yoneda. Online Coloring for Graphs of Large Odd Girth.
  • Alexander Lindermayr, Guido Schäfer, Jens Schlöter, and Leen Stougie. Online Flow Time Minimization with Gradually Revealed Jobs.
  • Petteri Kaski, Heikki Mannila, and Chandra Kanta Mohapatra. Optimal Union Probability Interval Is NP-Hard.
  • Jan Eube, Kelin Luo, Heiko Röglin, and Sarah Sturm. Approximation Algorithms for the Traveling Thief Problem.
  • Amatya Sharma and Santhoshini Velusamy. Characterizing Streaming Decidability of CSPs via Non-Redundancy.
  • Ruben Becker, Davide Cenzato, Nicola Prezza, and Daniel Puttini. On Computing Minimum Wheeler DFA From Their Language.
  • Guillaume Ducoffe. Beyond Trees: The Weighted Center Problem on Gromov Hyperbolic Graphs.
  • Marcin Bienkowski, Joakim Blikstad, Jarosław Byrka, Martín Costa, Yann Disser, and Annette Lutz. Incremental Submodular Maximization: Better Than Greedy.
  • Jan Eube and Heiko Röglin. New Algorithms and Hardness Results for Connected Clustering.
  • Mohsen Mohammadi and Mohammad Salavatipour. Approximation Algorithms for Machine Minimization.
  • Ragnar Groot Koerkamp, Stefan Hermann, Peter Sanders, and Stefan Walzer. Non-minimal k-perfect hashing: Tight lower bounds and an application to fast static hash tables.
  • Michael Kaibel and Petra Mutzel. Optimality-Preserving Data Reduction for Maximum k-Cut.
  • Malory Marin and Rémi Watrigant. Small Independent Sets versus Small Separator in Geometric Intersection Graphs.
  • Thomas Bläsius, Jean-Pierre von der Heydt, Tobias Kempf, Dennis Kobert, and Nikolai Maas. Benchmarking and Engineering Data Structures for Spherical Range Queries.
  • Sang Won Bae, Nicolau Oliver, and Evanthia Papadopoulou. Abstract Color Voronoi Diagrams and Circular Sequences of Color Permutations.
  • Tatiana Rocha Avila, Lars Rohwedder, and Leo Wennmann. Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting.
  • Dani Dorfman, Haim Kaplan, and Uri Zwick. Improved Bounds for Strategy Improvement Algorithms for Energy Games.
  • Christoph Grüne, Dorothee Henke, Eva Rotenberg, and Lasse Wulf. The Complexity of Stackelberg Pricing Games.
  • Daniel Anker Hermansen. Optimal Stochastic Online Sorting Rajat De, and Dominik Kempa. Hardness of Frequency-Related Queries on Compressed Strings.
  • James Sud, Anuj Apte, Kunal Marwaha, Ojas Parekh, Eunou Lee, and Lennart Sinjorgo. A 0.8395-approximation algorithm for the EPR problem.
  • Alessandro Straziota, Davide Bilò, Luciano Gualà, Stefano Leucci, and Guido Proietti. Hierarchical Spanners.
  • Lukas Patrick Bachmann, Jiri Fiala, Ignaz Rutter, Peter Stumpf, Miriam Münch, and Alexander Wolff. Towards the Recognition of Oriented Interval Graphs.
  • Adam Karczmarz and Paweł Pilarski. Strongly Polynomial Parallel Maximum Flow Revisited.
  • Krishnan Dehaleesan, Fedor Fomin, Petr Golovach, Laure Morelle, and Pål Drange. An FPT Algorithm for Diverse Minimum $s$–$t$ Cuts.
  • Haripriya Pulyassary and Chaitanya Swamy. Adaptive Sampling for Minimum-Norm k-Clustering.
  • Deeparnab Chakrabarty and Hang Liao. Query Complexity of Hypergraph Connectivity and Learnability using CUT Oracles.
  • Daniel Gibney, Kaamil Kaka, and Sharma Thankachan. Indexing Integer Strings Using Local Difference Bounds.
  • Sandip Das, Sk Samim Islam, and Daniel Lokshtanov. On the complexity of Multipacking.
  • Madhumita Kundu, Daniel Lokshtanov, Soumi Nandi, Saket Saurabh, and Kushal Singanporia. Covering Points with Rectangular Boundaries.
  • Reut Levi, Moti Medina, and Daniel Prigan. An LCA for approximated MST in general bounded-degree graphs.
  • Julian Aeri, Sebastian Forster, and Mara Grilnberger. A General Reduction from Near-Additive Emulators to Near-Exact Hopsets.
  • Prantar Ghosh, Sahil Kuchlous, Shravan Mehra, and Sagnik Mukhopadhyay. The Power of the Score Sequence of a Tournament.
  • Karl Bringmann, Nick Fischer, and Vassilios Nakos. Robustifying Sparse Matrix Multiplication.
  • Júlia Baligács, Bartłomiej Bosek, Yann Disser, Andreas Emil Feldmann, Grzegorz Gutowski, Katarzyna Kępińska, Paweł Putra, and Anna Zych-Pawlewicz. Online and Incremental Fractional Vertex Cover on Trees.
  • Tzvika Geft. On the Hardness of Optimal Motion on Trees.
  • Anna Arutyunova, Irina Fast, Annika Hennes, Carsten Krollmann, Daniel R. Schmidt, and Melanie Schmidt. Exact ratio preservation via outliers for fair k-center clustering.
  • Haitao Wang. Shortest Path Map Equivalence Decompositions and Applications.