- Karl Bringmann, Alejandro Cassis:
Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution. ESA 2023: 24:1-24:16 - Gerth Stølting Brodal, Sebastian Wild:
Funnelselect: Cache-Oblivious Multiple Selection. ESA 2023: 25:1-25:17 - Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong:
Oriented Spanners. ESA 2023: 26:1-26:16 - Martin Bullinger, René Romen:
Online Coalition Formation Under Random Arrival or Coalition Dissolution. ESA 2023: 27:1-27:18 - Sergio Cabello, Panos Giannopoulos:
On k-Means for Segments and Polylines. ESA 2023: 28:1-28:14 - Dongrun Cai, Xue Chen, Pan Peng:
Effective Resistances in Non-Expander Graphs. ESA 2023: 29:1-29:18 - Victor A. Campos, Jonas Costa, Raul Lopes, Ignasi Sau:
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. ESA 2023: 30:1-30:18 - Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan:
Approximation Algorithm for Norm Multiway Cut. ESA 2023: 32:1-32:14 - Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo:
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA 2023: 33:1-33:13 - Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Faster Local Motif Clustering via Maximum Flows. ESA 2023: 34:1-34:16 - Ilan Reuven Cohen, Binghui Peng:
Primal-Dual Schemes for Online Matching in Bounded Degree Graphs. ESA 2023: 35:1-35:17 - Arthur Carvalho Walraven da Cunha, Francesco D'Amore, Frédéric Giroire, Hicham Lesfari, Emanuele Natale, Laurent Viennot:
Revisiting the Random Subset Sum Problem. ESA 2023: 37:1-37:11 - Michael Czekanski, Shelby Kimmel, R. Teal Witter:
Robust and Space-Efficient Dual Adversary Quantum Query Algorithms. ESA 2023: 36:1-36:19 - Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang:
Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings. ESA 2023: 38:1-38:15 - Max Deppert, Matthias Kaul, Matthias Mnich:
A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. ESA 2023: 39:1-39:15 - Martin Dietzfelbinger:
On Hashing by (Random) Equations (Invited Talk). ESA 2023: 1:1-1:1 - Xiangyun Ding, Xiaojun Dong, Yan Gu, Youzhe Liu, Yihan Sun:
Efficient Parallel Output-Sensitive Edit Distance. ESA 2023: 40:1-40:20 - Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Optimal Energetic Paths for Electric Cars. ESA 2023: 42:1-42:17 - Jan Dreier, Daniel Mock, Peter Rossmanith:
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. ESA 2023: 43:1-43:17 - Yuval Emek, Yuval Gil, Maciej Pacut, Stefan Schmid:
Online Algorithms with Randomly Infused Advice. ESA 2023: 44:1-44:19 - Sándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, Christian Scheffer:
The Lawn Mowing Problem: From Algebra to Algorithms. ESA 2023: 45:1-45:18 - Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra:
Learned Monotone Minimal Perfect Hashing. ESA 2023: 46:1-46:17 - Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche:
Correlating Theory and Practice in Finding Clubs and Plexes. ESA 2023: 47:1-47:18 - Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. ESA 2023: 48:1-48:16 - Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Lossy Kernelization for (Implicit) Hitting Set Problems. ESA 2023: 49:1-49:14 - Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos:
Bootstrapping Dynamic Distance Oracles. ESA 2023: 50:1-50:16 - Daniel Funke, Nicolai Hüning, Peter Sanders:
A Sweep-Plane Algorithm for Calculating the Isolation of Mountains. ESA 2023: 51:1-51:17 - Amit Ganz, Pranav Nuti, Roy Schwartz:
A Tight Competitive Ratio for Online Submodular Welfare Maximization. ESA 2023: 52:1-52:17 - Colin Geniet, Stéphan Thomassé:
First Order Logic and Twin-Width in Tournaments. ESA 2023: 53:1-53:14 - Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior:
Improved Approximation Algorithms for the Expanding Search Problem. ESA 2023: 54:1-54:15