LIPIcs, Volume 274, ESA 2023

• Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman LIPIcs, Volume 274, ESA 2023, Complete Volume 10.4230/LIPIcs.ESA.2023
• Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.ESA.2023.0
• Martin Dietzfelbinger On Hashing by (Random) Equations (Invited Talk) 10.4230/LIPIcs.ESA.2023.1
• Amir Abboud, Mina Dalirrooyfard, Ray Li, and Virginia Vassilevska Williams On Diameter Approximation in Directed Graphs 10.4230/LIPIcs.ESA.2023.2
• Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., and Ron Safier Can You Solve Closest String Faster Than Exhaustive Search? 10.4230/LIPIcs.ESA.2023.3
• Amir Abboud, Shay Mozes, and Oren Weimann What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? 10.4230/LIPIcs.ESA.2023.4
• Ahmed Abdelkader and David M. Mount Smooth Distance Approximation 10.4230/LIPIcs.ESA.2023.5
• Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tóth, and Thomas Weighill Reconfiguration of Polygonal Subdivisions via Recombination 10.4230/LIPIcs.ESA.2023.6
• Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, and Zixuan Xu Faster Detours in Undirected Graphs 10.4230/LIPIcs.ESA.2023.7
• Shyan Akmal and Nicole Wein A Local-To-Global Theorem for Congested Shortest Paths 10.4230/LIPIcs.ESA.2023.8
• Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, and Torsten Ueckerdt Axis-Parallel Right Angle Crossing Graphs 10.4230/LIPIcs.ESA.2023.9
• Simon Apers, Stacey Jeffery, Galina Pass, and Michael Walter (No) Quantum Space-Time Tradeoff for USTCON 10.4230/LIPIcs.ESA.2023.10
• Júlia Baligács, Yann Disser, Irene Heinrich, and Pascal Schweitzer Exploration of Graphs with Excluded Minors 10.4230/LIPIcs.ESA.2023.11
• Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, and Michalis Xefteris Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else 10.4230/LIPIcs.ESA.2023.12
• Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, and Saket Saurabh A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands 10.4230/LIPIcs.ESA.2023.13
• Hideo Bannai and Jonas Ellert Lyndon Arrays in Sublinear Time 10.4230/LIPIcs.ESA.2023.14
• Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, and Nicola Prezza Sorting Finite Automata via Partition Refinement 10.4230/LIPIcs.ESA.2023.15
• Matthias Bentert, Klaus Heeger, and Tomohiro Koana Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication 10.4230/LIPIcs.ESA.2023.16
• Aaron Berger, Jenny Kaufmann, and Virginia Vassilevska Williams Approximating Min-Diameter: Standard and Bichromatic 10.4230/LIPIcs.ESA.2023.17
• Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michał Pilipczuk, and Erik Jan van Leeuwen Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth 10.4230/LIPIcs.ESA.2023.18
• Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, and Peter Sanders High Performance Construction of RecSplit Based Minimal Perfect Hash Functions 10.4230/LIPIcs.ESA.2023.19
• Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, and Ziena Zeif On the Giant Component of Geometric Inhomogeneous Random Graphs 10.4230/LIPIcs.ESA.2023.20
• Thomas Bläsius and Max Göttlicher An Efficient Algorithm for Power Dominating Set 10.4230/LIPIcs.ESA.2023.21
• Joakim Blikstad and Peter Kiss Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time 10.4230/LIPIcs.ESA.2023.22
• Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, and Alexandra Wesolek Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄ 10.4230/LIPIcs.ESA.2023.23
• Karl Bringmann and Alejandro Cassis Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution 10.4230/LIPIcs.ESA.2023.24
• Gerth Stølting Brodal and Sebastian Wild Funnelselect: Cache-Oblivious Multiple Selection 10.4230/LIPIcs.ESA.2023.25
• Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, and Sampson Wong Oriented Spanners 10.4230/LIPIcs.ESA.2023.26
• Martin Bullinger and René Romen Online Coalition Formation Under Random Arrival or Coalition Dissolution 10.4230/LIPIcs.ESA.2023.27
• Sergio Cabello and Panos Giannopoulos On k-Means for Segments and Polylines 10.4230/LIPIcs.ESA.2023.28
• Dongrun Cai, Xue Chen, and Pan Peng Effective Resistances in Non-Expander Graphs 10.4230/LIPIcs.ESA.2023.29
• Victor Campos, Jonas Costa, Raul Lopes, and Ignasi Sau New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages 10.4230/LIPIcs.ESA.2023.30
• Yixin Cao Enumerating Maximal Induced Subgraphs 10.4230/LIPIcs.ESA.2023.31
• Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, and Liren Shan Approximation Algorithm for Norm Multiway Cut 10.4230/LIPIcs.ESA.2023.32
• Parinya Chalermsook, Fedor Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, and Ly Orgo Polynomial-Time Approximation of Independent Set Parameterized by Treewidth 10.4230/LIPIcs.ESA.2023.33
• Adil Chhabra, Marcelo Fonseca Faraj, and Christian Schulz Faster Local Motif Clustering via Maximum Flows 10.4230/LIPIcs.ESA.2023.34
• Ilan Reuven Cohen and Binghui Peng Primal-Dual Schemes for Online Matching in Bounded Degree Graphs 10.4230/LIPIcs.ESA.2023.35
• Michael Czekanski, Shelby Kimmel, and R. Teal Witter Robust and Space-Efficient Dual Adversary Quantum Query Algorithms 10.4230/LIPIcs.ESA.2023.36
• Arthur Carvalho Walraven Da Cunha, Francesco d'Amore, Frédéric Giroire, Hicham Lesfari, Emanuele Natale, and Laurent Viennot Revisiting the Random Subset Sum Problem 10.4230/LIPIcs.ESA.2023.37
• Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, and Ruilong Zhang Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings 10.4230/LIPIcs.ESA.2023.38
• Max Deppert, Matthias Kaul, and Matthias Mnich A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots 10.4230/LIPIcs.ESA.2023.39
• Xiangyun Ding, Xiaojun Dong, Yan Gu, Youzhe Liu, and Yihan Sun Efficient Parallel Output-Sensitive Edit Distance 10.4230/LIPIcs.ESA.2023.40
• Ming Ding and Peng Zhang Efficient 1-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences 10.4230/LIPIcs.ESA.2023.41
• Dani Dorfman, Haim Kaplan, Robert E. Tarjan, and Uri Zwick Optimal Energetic Paths for Electric Cars 10.4230/LIPIcs.ESA.2023.42
• Jan Dreier, Daniel Mock, and Peter Rossmanith Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond 10.4230/LIPIcs.ESA.2023.43
• Yuval Emek, Yuval Gil, Maciej Pacut, and Stefan Schmid Online Algorithms with Randomly Infused Advice 10.4230/LIPIcs.ESA.2023.44
• Sándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, and Christian Scheffer The Lawn Mowing Problem: From Algebra to Algorithms 10.4230/LIPIcs.ESA.2023.45
• Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, and Giorgio Vinciguerra Learned Monotone Minimal Perfect Hashing 10.4230/LIPIcs.ESA.2023.46
• Aleksander Figiel, Tomohiro Koana, André Nichterlein, and Niklas Wünsche Correlating Theory and Practice in Finding Clubs and Plexes 10.4230/LIPIcs.ESA.2023.47
• Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, and Meirav Zehavi Kernelization for Spreading Points 10.4230/LIPIcs.ESA.2023.48
• Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, and Meirav Zehavi Lossy Kernelization for (Implicit) Hitting Set Problems 10.4230/LIPIcs.ESA.2023.49
• Sebastian Forster, Gramoz Goranci, Yasamin Nazari, and Antonis Skarlatos Bootstrapping Dynamic Distance Oracles 10.4230/LIPIcs.ESA.2023.50
• Daniel Funke, Nicolai Hüning, and Peter Sanders A Sweep-Plane Algorithm for Calculating the Isolation of Mountains 10.4230/LIPIcs.ESA.2023.51
• Amit Ganz, Pranav Nuti, and Roy Schwartz A Tight Competitive Ratio for Online Submodular Welfare Maximization 10.4230/LIPIcs.ESA.2023.52
• Colin Geniet and Stéphan Thomassé First Order Logic and Twin-Width in Tournaments 10.4230/LIPIcs.ESA.2023.53
• Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, and Kevin Schewior Improved Approximation Algorithms for the Expanding Search Problem 10.4230/LIPIcs.ESA.2023.54
• Christoph Grunau, Ahmet Alper Özüdoğru, and Václav Rozhoň Noisy k-Means++ Revisited 10.4230/LIPIcs.ESA.2023.55
• Elfarouk Harb, Kent Quanrud, and Chandra Chekuri Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing 10.4230/LIPIcs.ESA.2023.56
• David G. Harris Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication 10.4230/LIPIcs.ESA.2023.57
• Úrsula Hébert-Johnson, Daniel Lokshtanov, and Eric Vigoda Counting and Sampling Labeled Chordal Graphs in Polynomial Time 10.4230/LIPIcs.ESA.2023.58
• Falko Hegerfeld and Stefan Kratsch Tight Algorithms for Connectivity Problems Parameterized by Clique-Width 10.4230/LIPIcs.ESA.2023.59
• Demian Hespe, Peter Sanders, Sabine Storandt, and Carina Truschel Pareto Sums of Pareto Sets 10.4230/LIPIcs.ESA.2023.60
• Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, and Johnathan Wilson Solving Edge Clique Cover Exactly via Synergistic Data Reduction 10.4230/LIPIcs.ESA.2023.61
• Martin Hoefer and Kevin Schewior Threshold Testing and Semi-Online Prophet Inequalities 10.4230/LIPIcs.ESA.2023.62
• Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, and Vaishali Surianarayanan Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability) 10.4230/LIPIcs.ESA.2023.63
• Adam Izdebski and Ronald de Wolf Improved Quantum Boosting 10.4230/LIPIcs.ESA.2023.64
• Ashwin Jacob, Michał Włodarczyk, and Meirav Zehavi Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large 10.4230/LIPIcs.ESA.2023.65
• Bart M. P. Jansen, Jari J. H. de Kroon, and Michał Włodarczyk 5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size 10.4230/LIPIcs.ESA.2023.66
• Haim Kaplan, Matthew J. Katz, Rachel Saban, and Micha Sharir The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs 10.4230/LIPIcs.ESA.2023.67
• Adam Karczmarz and Marcin Smulewicz On Fully Dynamic Strongly Connected Components 10.4230/LIPIcs.ESA.2023.68
• Dor Katzelnick, Aditya Pillai, Roy Schwartz, and Mohit Singh An Improved Approximation Algorithm for the Max-3-Section Problem 10.4230/LIPIcs.ESA.2023.69
• Evangelos Kipouridis Fitting Tree Metrics with Minimum Disagreements 10.4230/LIPIcs.ESA.2023.70
• Felix Klingelhoefer and Alantha Newman Coloring Tournaments with Few Colors: Algorithms and Complexity 10.4230/LIPIcs.ESA.2023.71
• Tomasz Kociumaka and Adam Polak Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths 10.4230/LIPIcs.ESA.2023.72
• Shimon Kogan and Merav Parter Towards Bypassing Lower Bounds for Graph Shortcuts 10.4230/LIPIcs.ESA.2023.73
• Dominik Köppl, Florian Kurpicz, and Daniel Meyer Faster Block Tree Construction 10.4230/LIPIcs.ESA.2023.74
• Evangelos Kosinas Connectivity Queries Under Vertex Failures: Not Optimal, but Practical 10.4230/LIPIcs.ESA.2023.75
• Adam Kurpisz and Silvan Suter Improved Approximations for Translational Packing of Convex Polygons 10.4230/LIPIcs.ESA.2023.76
• Michael Lampis and Manolis Vasilakis Structural Parameterizations for Two Bounded Degree Problems Revisited 10.4230/LIPIcs.ESA.2023.77
• Zelin Li, Pan Peng, and Xianbin Zhu Massively Parallel Algorithms for the Stochastic Block Model 10.4230/LIPIcs.ESA.2023.78
• Zihui Liang, Bakh Khoussainov, Toru Takisaka, and Mingyu Xiao Connectivity in the Presence of an Opponent 10.4230/LIPIcs.ESA.2023.79
• Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang, and Renfei Zhou On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching 10.4230/LIPIcs.ESA.2023.80
• Nikhil S. Mande and Ronald de Wolf Tight Bounds for Quantum Phase Estimation and Related Problems 10.4230/LIPIcs.ESA.2023.81
• Isja Mannens and Jesper Nederlof A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth 10.4230/LIPIcs.ESA.2023.82
• Francesco Masillo Matching Statistics Speed up BWT Construction 10.4230/LIPIcs.ESA.2023.83
• Ismail Naderi, Mohsen Rezapour, and Mohammad R. Salavatipour Approximation Schemes for Min-Sum k-Clustering 10.4230/LIPIcs.ESA.2023.84
• Eunjin Oh and Seunghyeok Oh Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs 10.4230/LIPIcs.ESA.2023.85
• George Osipov and Magnus Wahlström Parameterized Complexity of Equality MinCSP 10.4230/LIPIcs.ESA.2023.86
• Ioannis Panagiotas, Grégoire Pichon, Somesh Singh, and Bora Uçar Engineering Fast Algorithms for the Bottleneck Matching Problem 10.4230/LIPIcs.ESA.2023.87
• Krzysztof Pióro Subcubic Algorithm for (Unweighted) Unrooted Tree Edit Distance 10.4230/LIPIcs.ESA.2023.88
• Jakub Radoszewski Linear Time Construction of Cover Suffix Tree and Applications 10.4230/LIPIcs.ESA.2023.89
• Ignaz Rutter and Peter Stumpf Simultaneous Representation of Interval Graphs in the Sunflower Case 10.4230/LIPIcs.ESA.2023.90
• Menachem Sadigurschi, Moshe Shechner, and Uri Stemmer Relaxed Models for Adversarial Streaming: The Bounded Interruptions Model and the Advice Model 10.4230/LIPIcs.ESA.2023.91
• Thatchaphol Saranurak and Wuwei Yuan Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k 10.4230/LIPIcs.ESA.2023.92
• Baruch Schieber and Soroush Vahidi Approximating Connected Maximum Cuts via Local Search 10.4230/LIPIcs.ESA.2023.93
• François Sellier Parameterized Matroid-Constrained Maximum Coverage 10.4230/LIPIcs.ESA.2023.94
• Chinmay Sonar, Subhash Suri, and Jie Xue Fault Tolerance in Euclidean Committee Selection 10.4230/LIPIcs.ESA.2023.95
• Jacek Sroka and Jerzy Tyszkiewicz Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat Maps 10.4230/LIPIcs.ESA.2023.96
• Enze Sun, Zonghan Yang, and Yuhao Zhang Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs 10.4230/LIPIcs.ESA.2023.97
• Xiaoming Sun, Jialin Zhang, and Zhijie Zhang Simple Deterministic Approximation for Submodular Multiple Knapsack Problem 10.4230/LIPIcs.ESA.2023.98
• André van Renssen, Yuan Sha, Yucheng Sun, and Sampson Wong The Tight Spanning Ratio of the Rectangle Delaunay Triangulation 10.4230/LIPIcs.ESA.2023.99
• Oleg Verbitsky and Maksim Zhukovskii Canonization of a Random Graph by Two Matrix-Vector Multiplications 10.4230/LIPIcs.ESA.2023.100
• Haitao Wang and Yiming Zhao Improved Algorithms for Distance Selection and Related Problems 10.4230/LIPIcs.ESA.2023.101
• Rowan Warneke, Farhana Choudhury, and Anthony Wirth Maximum Coverage in Random-Arrival Streams 10.4230/LIPIcs.ESA.2023.102
• Chuhan Yang and Christopher Musco Efficient Block Approximate Matrix Multiplication 10.4230/LIPIcs.ESA.2023.103
• Goran Zuzic A Simple Boosting Framework for Transshipment 10.4230/LIPIcs.ESA.2023.104