


default search action
32nd ESA 2024: London, UK
- Timothy M. Chan

, Johannes Fischer
, John Iacono
, Grzegorz Herman
:
32nd Annual European Symposium on Algorithms, ESA 2024, Royal Holloway, London, United Kingdom, September 2-4, 2024. LIPIcs 308, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-338-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xxii

- Vincent Cohen-Addad:

Recent Progress on Correlation Clustering: From Local Algorithms to Better Approximation Algorithms and Back (Invited Talk). 1:1-1:2 - Eva Rotenberg

:
Simple (Invited Talk). 2:1-2:2 - Amir Abboud, Tomer Grossman, Moni Naor, Tomer Solomon:

From Donkeys to Kings in Tournaments. 3:1-3:14 - Amir Abboud, Nathan Wallheimer:

Worst-Case to Expander-Case Reductions: Derandomized and Generalized. 4:1-4:18 - Mikkel Abrahamsen

, Ioana O. Bercea
, Lorenzo Beretta, Jonas Klausen
, László Kozma:
Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional. 5:1-5:15 - Pankaj K. Agarwal, Esther Ezra, Micha Sharir:

Lower Envelopes of Surface Patches in 3-Space. 6:1-6:17 - Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir:

Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments. 7:1-7:20 - Cezar-Mihail Alexandru, Christian Konrad:

Interval Selection in Sliding Windows. 8:1-8:17 - Enver Aman, Karthik C. S., Sharath Punna:

On Connections Between k-Coloring and Euclidean k-Means. 9:1-9:18 - Shinwoo An, Eunjin Oh, Jie Xue:

Sparse Outerstring Graphs Have Logarithmic Treewidth. 10:1-10:18 - Sebastian Angrick

, Ben Bals
, Tobias Friedrich, Hans Gawendowicz, Niko Hastrich
, Nicolas Klodt, Pascal Lenzner, Jonas Schmidt, George Skretas, Armin Wells:
How to Reduce Temporal Cliques to Find Sparse Spanners. 11:1-11:15 - Vipul Arora, Arnab Bhattacharyya, Mathews Boban, Venkatesan Guruswami, Esty Kelman:

Outlier Robust Multivariate Polynomial Regression. 12:1-12:17 - Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. 13:1-13:15 - Yuhang Bai

, Kristóf Bérczi
, Gergely Csáji, Tamás Schwarcz:
Approximating Maximum-Size Properly Colored Forests. 14:1-14:18 - Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz:

A (5/3+ε)-Approximation for Tricolored Non-Crossing Euclidean TSP. 15:1-15:15 - Aranya Banerjee, Daniel Gibney, Sharma V. Thankachan:

Longest Common Substring with Gaps and Related Problems. 16:1-16:18 - Aritra Banik, Fedor V. Fomin

, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh:
Cuts in Graphs with Matroid Constraints. 17:1-17:15 - Hideo Bannai

, Mitsuru Funakoshi
, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi
:
Height-Bounded Lempel-Ziv Encodings. 18:1-18:18 - Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya

:
Longest Common Extensions with Wildcards: Trade-Off and Applications. 19:1-19:17 - Gabriel Bathie, Panagiotis Charalampopoulos, Tatiana Starikovskaya

:
Pattern Matching with Mismatches and Wildcards. 20:1-20:15 - Tatiana Belova

, Nikolai Chukhin, Alexander S. Kulikov
, Ivan Mihajlin:
Improved Space Bounds for Subset Sum. 21:1-21:17 - Kristóf Bérczi

, Karthekeyan Chandrasekaran, Tamás Király, Shubhang Kulkarni:
Hypergraph Connectivity Augmentation in Strongly Polynomial Time. 22:1-22:19 - Sayan Bhattacharya, Martín Costa, Nadav Panski, Shay Solomon:

Density-Sensitive Algorithms for (Δ + 1)-Edge Coloring. 23:1-23:18 - Therese Biedl, Prosenjit Bose, Karthik Murali:

A Parameterized Algorithm for Vertex and Edge Connectivity of Embedded Graphs. 24:1-24:15 - Davide Bilò, Luciano Gualà, Stefano Leucci, Alessandro Straziota

:
Graph Spanners for Group Steiner Distances. 25:1-25:17 - Vittorio Bilò, Evangelos Markakis, Cosimo Vinci:

Achieving Envy-Freeness Through Items Sale. 26:1-26:16 - Ahmad Biniaz:

Art Galleries and Mobile Guards: Revisiting O'Rourke's Proof. 27:1-27:4 - Lotte Blank

, Anne Driemel:
A Faster Algorithm for the Fréchet Distance in 1D for the Imbalanced Case. 28:1-28:15 - Jean-Daniel Boissonnat, Kunal Dutta:

A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels. 29:1-29:18 - Fritz Bökler, Markus Chimani, Henning Jasper

, Mirko H. Wagner:
Exact Minimum Weight Spanners via Column Generation. 30:1-30:17 - Itai Boneh, Shay Golan

, Arseny M. Shur:
String 2-Covers with No Length Restrictions. 31:1-31:18 - Cornelius Brand, Martin Koutecký, Alexandra Lassota

, Sebastian Ordyniak
:
Separable Convex Mixed-Integer Optimization: Improved Algorithms and Lower Bounds. 32:1-32:18 - Karl Bringmann, Anita Dürr, Adam Polak

:
Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing. 33:1-33:15 - Karl Bringmann, Ahmed Ghazy, Marvin Künnemann:

Exploring the Approximability Landscape of 3SUM. 34:1-34:15 - Gerth Stølting Brodal

, Rolf Fagerberg, Casper Moldrup Rysgaard
:
On Finding Longest Palindromic Subsequences Using Longest Common Subsequences. 35:1-35:16 - Kevin Buchin

, Maike Buchin, Joachim Gudmundsson, Sampson Wong:
Bicriteria Approximation for Minimum Dilation Graph Augmentation. 36:1-36:15 - Gruia Calinescu, Sami Davies, Samir Khuller, Shirley Zhang:

Online Flexible Busy Time Scheduling on Heterogeneous Machines. 37:1-37:18 - Gruia Calinescu, Sumedha Uniyal:

Local Optimization Algorithms for Maximum Planar Subgraph. 38:1-38:18 - Baris Can Esmer

, Jacob Focke, Dániel Marx
, Pawel Rzazewski:
List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs. 39:1-39:20 - Amit Chakrabarti

, Andrew McGregor, Anthony Wirth:
Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams. 40:1-40:15 - Chandra Chekuri

, Rhea Jain
:
Approximation Algorithms for Hop Constrained and Buy-At-Bulk Network Design via Hop Constrained Oblivious Routing. 41:1-41:21 - Chandra Chekuri

, Rhea Jain
, Shubhang Kulkarni, Da Wei Zheng, Weihao Zhu:
From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs. 42:1-42:19 - Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:

Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. 43:1-43:18 - Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild

:
An Optimal Randomized Algorithm for Finding the Saddlepoint. 44:1-44:12 - Dipan Dey, Manoj Gupta:

Near Optimal Dual Fault Tolerant Distance Oracle. 45:1-45:23 - Matthew Ding

, Jason Li:
Deterministic Minimum Steiner Cut in Maximum Flow Time. 46:1-46:14 - Yann Disser, Svenja M. Griesbach, Max Klimm, Annette Lutz:

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. 47:1-47:16 - Konstantinos Dogeas, Thomas Erlebach, Ya-Chun Liang:

Scheduling with Obligatory Tests. 48:1-48:14 - Sally Dong, Guanghao Ye:

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs. 49:1-49:14 - Loïc Dubois

:
Making Multicurves Cross Minimally on Surfaces. 50:1-50:15 - Lech Duraj

, Filip Konieczny
, Krzysztof Potepa:
Better Diameter Algorithms for Bounded VC-Dimension Graphs and Geometric Intersection Graphs. 51:1-51:18 - Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem

, Vitaly Aksenov
, Stefan Schmid:
Toward Self-Adjusting k-Ary Search Tree Networks. 52:1-52:15 - S M Ferdous

, Bhargav Samineni, Alex Pothen, Mahantesh Halappanavar, Bala Krishnamoorthy:
Semi-Streaming Algorithms for Weighted k-Disjoint Matchings. 53:1-53:19 - Nils Fleischhacker, Kasper Green Larsen

, Maciej Obremski, Mark Simkin
:
Invertible Bloom Lookup Tables with Less Memory and Randomness. 54:1-54:17 - Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx

, Philipp Schepper, Roohani Sharma, Karol Wegrzycki:
Hitting Meets Packing: How Hard Can It Be? 55:1-55:21 - Emily Fox:

A Simple Deterministic Near-Linear Time Approximation Scheme for Transshipment with Arbitrary Positive Edge Costs. 56:1-56:14 - Dvir Fried, Tsvi Kopelowitz, Ely Porat:

Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices. 57:1-57:6 - Mohit Garg, Debajyoti Kar, Arindam Khan:

Random-Order Online Independent Set of Intervals and Hyperrectangles. 58:1-58:18 - Pawel Gawrychowski, Mateusz Wasylkiewicz:

Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity. 59:1-59:14 - Prantar Ghosh

, Sahil Kuchlous:
New Algorithms and Lower Bounds for Streaming Tournaments. 60:1-60:19 - Lars Gottesbüren, Nikos Parotsidis, Maximilian Probst Gutenberg:

Practical Expander Decomposition. 61:1-61:17 - Svenja M. Griesbach, Max Klimm, Philipp Warode

, Theresa Ziemke:
Optimizing Throughput and Makespan of Queuing Systems by Information Design. 62:1-62:18 - Rohit Gurjar, Taihei Oki, Roshan Raj:

Fractional Linear Matroid Matching Is in Quasi-NC. 63:1-63:14 - Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti

:
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. 64:1-64:18 - Kaito Harada

, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa:
A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles. 65:1-65:18 - Elfarouk Harb, Zhengcheng Huang, Da Wei Zheng:

Shortest Path Separators in Unit Disk Graphs. 66:1-66:14 - Daniel Hathcock, Michael Zlatin:

Approximation Algorithms for Steiner Connectivity Augmentation. 67:1-67:16 - Klaus Heeger, Danny Hermelin:

Minimizing the Weighted Number of Tardy Jobs Is W[1]-Hard. 68:1-68:14 - Stefan Hermann

, Hans-Peter Lehmann
, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer
:
PHOBIC: Perfect Hashing With Optimized Bucket Sizes and Interleaved Coding. 69:1-69:17 - Ivor van der Hoog

, Irene Parada, Eva Rotenberg
:
Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs. 70:1-70:18 - Khalid Hourani, William K. Moses Jr., Gopal Pandurangan:

Towards Communication-Efficient Peer-To-Peer Networks. 71:1-71:15 - Bingbing Hu, Evangelos Kosinas, Adam Polak

:
Connectivity Oracles for Predictable Vertex Failures. 72:1-72:16 - Zhiyi Huang

, Zahra Parsaeian, Zixuan Zhu
:
Laminar Matroid Secretary: Greedy Strikes Back. 73:1-73:8 - Dylan Hyatt-Denesik, Afrouz Jabal Ameli

, Laura Sanità:
Improved Approximations for Flexible Network Design. 74:1-74:14 - Yuni Iwamasa, Yusuke Kobayashi, Kenjiro Takazawa:

Finding a Maximum Restricted t-Matching via Boolean Edge-CSP. 75:1-75:15 - Bart M. P. Jansen, Céline M. F. Swennenhuis:

Steiner Tree Parameterized by Multiway Cut and Even Less. 76:1-76:16 - Matthew J. Katz, Rachel Saban, Micha Sharir:

Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain. 77:1-77:17 - Justin Kim, Rahul Varki, Marco Oliva, Christina Boucher

:
Re²Pair: Increasing the Scalability of RePair by Decreasing Memory Usage. 78:1-78:15 - Shimon Kogan, Merav Parter:

Giving Some Slack: Shortcuts and Transitive Closure Compressions. 79:1-79:15 - Shimon Kogan, Merav Parter:

The Algorithmic Power of the Greene-Kleitman Theorem. 80:1-80:14 - Lukasz Kowalik

:
Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time. 81:1-81:17 - Sonja Kraiczy, Edith Elkind

:
A Lower Bound for Local Search Proportional Approval Voting. 82:1-82:14 - Florian Kurpicz

, Pascal Mehnert, Peter Sanders, Matthias Schimek
:
Scalable Distributed String Sorting. 83:1-83:17 - Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck

:
Insights into (k, ρ)-Shortcutting Algorithms. 84:1-84:17 - Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:

Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. 85:1-85:17 - Zsuzsanna Lipták

, Francesco Masillo, Gonzalo Navarro:
A Textbook Solution for Dynamic Strings. 86:1-86:16 - Konrad Majewski, Michal Pilipczuk, Anna Zych-Pawlewicz:

Parameterized Dynamic Data Structure for Split Completion. 87:1-87:17 - Samuel McCauley:

Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion. 88:1-88:19 - Slobodan Mitrovic, Ronitt Rubinfeld, Mihir Singhal:

Locally Computing Edge Orientations. 89:1-89:17 - Alexander Naumann

, Annika Bonerath
, Jan-Henrik Haunert:
Many-To-Many Polygon Matching à La Jaccard. 90:1-90:15 - Zipei Nie, Hang Zhou:

Euclidean Capacitated Vehicle Routing in the Random Setting: A 1.55-Approximation Algorithm. 91:1-91:15 - Zeev Nutov:

Parameterized Algorithms for Node Connectivity Augmentation Problems. 92:1-92:12 - George Osipov, Marcin Pilipczuk, Magnus Wahlström:

Parameterized Complexity of MinCSP over the Point Algebra. 93:1-93:15 - Felipe de Carvalho Pereira

, Pedro Jussieu de Rezende, Tallys H. Yunes, Luiz Fernando Batista Morato
:
A Row Generation Algorithm for Finding Optimal Burning Sequences of Large Graphs. 94:1-94:17 - Rajmohan Rajaraman, Omer Wasim:

Competitive Capacitated Online Recoloring. 95:1-95:17 - Tim Randolph, Karol Wegrzycki:

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM. 96:1-96:19 - Henrik Reinstädtler, Christian Schulz, Bora Uçar:

Engineering Edge Orientation Algorithms. 97:1-97:18 - Gregory Schwartzman:

Local Max-Cut on Sparse Graphs. 98:1-98:6 - Tatsuya Terao

, Ryuhei Mori
:
Parameterized Quantum Query Algorithms for Graph Problems. 99:1-99:16 - Max Dupré la Tour, Monika Henzinger, David Saulpic:

Fully Dynamic k-Means Coreset in Near-Optimal Update Time. 100:1-100:16 - Qisheng Wang

, Zhicheng Zhang:
Time-Efficient Quantum Entropy Estimator via Samplizer. 101:1-101:15 - Henning Martin Woydt

, Christian Komusiewicz, Frank Sommer:
SubModST: A Fast Generic Solver for Submodular Maximization with Size Constraints. 102:1-102:18 - Pu Wu, Huanyu Gu, Huiqin Jiang, Zehui Shao

, Jin Xu:
A Faster Algorithm for the 4-Coloring Problem. 103:1-103:18 - Mingyu Xiao:

Solving Directed Multiway Cut Faster Than 2ⁿ. 104:1-104:13 - Toru Yoshinaga, Yasushi Kawase:

The Last Success Problem with Samples. 105:1-105:15

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID













