ESA
Accepted Papers
| Authors | Title |
| Aleksandrs Belovs | Quantum Algorithms for Classical Probability Distributions |
| Valentin Bartier and Nicolas Bousquet | Linear transformations between colorings in chordal graphs |
| Rami Daknama, Konstantinos Panagiotou and Simon Reisser | Robustness of Randomized Rumour Spreading |
| Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack and Lars Rohwedder | Online Bin Covering with Limited Migration |
| Akshay Krishnamurthy, Arya Mazumdar, Andrew McGregor and Soumyabrata Pal | Trace Reconstruction: Generalized and Parameterized |
| Martin Dietzfelbinger and Stefan Walzer | Dense Peelable Random Uniform Hypergraphs |
| Jiehua Chen, Danny Hermelin and Manuel Sorge | On Computing Centroids According to the p-Norms of Hamming Distance Vectors |
| Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel and Christian Wulff-Nilsen | Constructing Light Spanners Deterministically in Near-Linear Time |
| Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck and Nodari Sitchinava | Fragile Complexity of Comparison-Based Algorithms |
| Jurek Czyzowicz, Dariusz Dereniowski and Andrzej Pelc | Building a Nest by an Automaton |
| Wojciech Czerwiński, Wojciech Nadara and Marcin Pilipczuk | Improved bounds for the excluded-minor approximation of treedepth |
| Hugo Akitaya, Esther Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Flatland, Matias Korman, Belen Palop, Irene Parada, André van Renssen and Vera Sacristán | Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers |
| Yuval Emek, Adam Goldbraikh and Erez Kantor | Online Disjoint Set Cover without Prior Knowledge |
| Harald Räcke and Stefan Schmid | Compact Oblivious Routing |
| Vincent Cohen-Addad, Marcin Pilipczuk and Michał Pilipczuk | Efficient approximation schemes for uniform-cost clustering problems in planar graphs |
| Yael Hitron and Merav Parter | Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons |
| Cornelius Brand | Patching Colors with Tensors |
| Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz and Karol Węgrzycki | Equal-Subset-Sum Faster Than the Meet-in-the-Middle |
| Elena Farahbakhsh Touli and Yusu Wang | FPT-Algorithms for computing Gromov-Hausdorff and interleaving distances between trees |
| Fedor Fomin, Petr Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh and Meirav Zehavi | Going Far From Degeneracy |
| Yuval Emek, Shay Kutten, Ron Lavi and Yangguang Shi | Bayesian Generalized Network Design |
| Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth and Micha Sharir | Triangles and Girth in Disk Graphs and Transmission Graphs |
| Simon Apers | Quantum Walk Sampling by Growing Seed Sets |
| Fabrizio Grandoni and Andreas Wiese | Packing Cars into Narrow Roads: PTASs for Limited Supply Highway |
| Daniel Gibney and Sharma V. Thankachan | On the Hardness and Inapproximability of Recognizing Wheeler Graphs |
| Fabrizio Grandoni, Stefan Kratsch and Andreas Wiese | Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack |
| Evripidis Bampis, Bruno Escoffier, Kevin Schewior and Alexandre Teiller | Online Multistage Subset Maximization Problems |
| Antonios Antoniadis, Felix Biermeier, Andrés Cristi, Christoph Damerius, Ruben Hoeksma, Dominik Kaaser, Peter Kling and Lukas Nölke | On the Complexity of Anchored Rectangle Packing |
| Stefano Leucci, Chih-Hung Liu and Simon Meierhans | Resilient Dictionaries for Randomly Unreliable Memory |
| Barbara Geissmann, Stefano Leucci, Chih-Hung Liu and Paolo Penna | Optimal Sorting with Persistent Comparison Errors |
| Amihood Amir, Panagiotis Charalampopoulos, Solon Pissis and Jakub Radoszewski | Longest Common Substring Made Fully Dynamic |
| Jonathan Rollin, Lena Schlipf and André Schulz | Recognizing Planar Laman Graphs |
| Amihood Amir, Itai Boneh, Panagiotis Charalampopoulos and Eitan Kondratovsky | Repetition Detection in a Dynamic String |
| John Iacono, Riko Jacob and Konstantinos Tsakalidis | External memory priority queues with decrease-key and applications to graph algorithms |
| Michael Hoffmann and Boris Klemz | Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian |
| Mamadou Moustapha Kanté and Benjamin Bergougnoux | More Applications of the $d$-neighbor equivalence: Connectivity and Acyclicity Constraints |
| Jean-Daniel Boissonnat, Olivier Devillers, Kunal Dutta and Marc Glisse | Randomized incremental construction of Delaunay triangulations of nice point sets |
| Klaus Jansen and Malin Rau | Closing the Gap for Pseudo-Polynomial Strip Packing |
| Ariel Kulik, Kanthi Sarpatwar, Baruch Schieber and Hadas Shachnai | Generalized Assignment via Submodular Optimization with Reserved Capacity |
| Martin Dietzfelbinger and Stefan Walzer | Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications |
| Huan Li, He Sun and Luca Zanetti | Hermitian Laplacians and a Cheeger inequality for the Max-2-Lin problem |
| Karl Bringmann, Sándor Kisfaludi-Bak, Michał Pilipczuk and Erik Jan van Leeuwen | On Geometric Set Cover for Orthants |
| Robert Ganian, Sebastian Ordyniak and Rahul Cs | Group Activity Selection with Few Agent Types |
| Blair D. Sullivan, Brian Lavallee, Erik D. Demaine, Kyle Kloster, Quanquan C. Liu, Timothy D. Goodrich, Ali Vakilian and Andrew van der Poel | Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class |
| Nina Mesing Stausholm, Rasmus Pagh and Mikkel Thorup | Hardness of Bichromatic Closest Pair with Jaccard Similarity |
| Arash Haddadan and Alantha Newman | Towards improving Christofides’ algorithm for half-integer TSP |
| Édouard Bonnet, Yoichi Iwata, Bart M. P. Jansen and Lukasz Kowalik | Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP |
| Roy Schwartz and Ran Yeheskel | Graph Balancing with Orientation Costs |
| Maria Chudnovsky, Shenwei Huang, Paweł Rzążewski, Sophie Spirkl and Mingxian Zhong | Complexity of $C_k$-coloring in hereditary classes of graphs |
| Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai and Kasturi Varadarajan | A Constant Approximation for Colorful k-Center |
| Marek Adamczyk, Jarosław Byrka, Jan Marcinkowski, Syed M. Meesum and Michał Włodarczyk | Constant factor FPT approximation for capacitated k-median |
| Adam Karczmarz and Jakub Lacki | Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs |
| Juan Jose Besa, Giordano Da Lozzo and Michael Goodrich | Computing k-Modal Embeddings of Planar Digraphs |
| Deeparnab Chakrabarty and Chaitanya Swamy | Simpler and Better Algorithms for Minimum-Norm Load Balancing |
| Ramanujan M. Sridharan | An Approximate Kernel for Connected Feedback Vertex Set |
| Ignaz Rutter, Darren Strash, Peter Stumpf and Michael Vollmer | Simultaneous Representation of Proper and Unit Interval Graphs |
| Jinhee Chun, Kenya Kikuchi and Takeshi Tokuyama | Consistent Digital Curved Rays and Pseudoline Arrangements |
| R. Ravi and Oleksandr Rudenko | Multicommodity Multicast, Wireless and Fast |
| Mees van de Kerkhof, Irina Kostitsyna, Maarten Loffler, Majid Mirzanezhad and Carola Wenk | Global Curve Simplification |
| Eduard Eiben, Daniel Lokshtanov and Amer Mouawad | Bisection of Bounded Treewidth Graphs by Convolutions |
| Vaggos Chatziafratis, Haris Angelidakis, Chen Dan, Avrim Blum and Pranjal Awasthi | Bilu-Linial Stability, Certified Algorithms and the Independent Set Problem |
| Georgios Birmpas, Evangelos Markakis and Guido Schaefer | Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond |
| Jing Chen, Samuel McCauley and Shikha Singh | Non-Cooperative Rational Interactive Proofs |
| Diodato Ferraioli, Adrian Meier, Paolo Penna and Carmine Ventre | Obviously Strategyproof Mechanisms for Machine Scheduling |
| Soheil Behnezhad, Mahsa Derakhshan, Mohammadtaghi Hajiaghayi, Marina Knittel and Hamed Saleh | Streaming and Massively Parallel Algorithms for Edge Coloring |
| Tomáš Masařík, Irene Muzi, Marcin Pilipczuk, Paweł Rzążewski and Manuel Sorge | Packing directed circuits quarter-integrally |
| Adam Karczmarz and Piotr Sankowski | Min-Cost Flow in Unit-Capacity Planar Graphs |
| Khaled Elbassioni and Kazuhisa Makino | Oracle-based Primal-dual Algorithms for Packing and Covering Semidefinite Programs |
| Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi and Yoshio Okamoto | Shortest Reconfiguration of Perfect Matchings via Alternating Cycles |
| Ulrich Bauer, Abhishek Rathod and Jonathan Spreer | Parametrized complexity of expansion height |
| Markus Chimani and Tilo Wiedera | Stronger ILPs for the Graph Genus Problem |
| Martin Aumüller, Tobias Christiani, Rasmus Pagh and Michael Vesterli | PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors |
| Marcel Radermacher and Ignaz Rutter | Geometric Crossing-Minimization – A Scalable Randomized Approach |
| Lorenz Hübschle-Schneider and Peter Sanders | Parallel Weighted Random Sampling |
| Hu Ding, Haikuo Yu and Zixiu Wang | Greedy Strategy Works for $k$-Center Clustering with Outliers and Coreset Construction |
| Moritz Baum, Valentin Buchhold, Jonas Sauer, Dorothea Wagner and Tobias Zündorf | UnLimited TRAnsfers for Multi-Modal Route Planning: An Efficient Solution |
| Johannes Fischer, Patrick Dinklage, Dominik Köppl, Manuel Penschuk and Jonas Ellert | Bidirectional Text Compression in External Memory |
| Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck and Christopher Weyand | Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs |
| Loukas Georgiadis, Konstantinos Giannis, Giuseppe F. Italiano, Aikaterini Karanasiou and Luigi Laura | Dynamic Dominators and Low-High Orders in DAGs |
| Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner, Franziska Wegner and Matthias Wolf | Engineering Negative Cycle Canceling for Wind Farm Cabling |
| Barna Saha and Sanjay Subramanian | Correlation Clustering with Same-Cluster Queries Bounded by Optimal Cost |
| Lars Gottesbüren, Michael Hamann and Dorothea Wagner | Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm |
| Michael Jünger and Sven Mallach | Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization |
