default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st ESA 2023: Amsterdam, The Netherlands
- Inge Li Gørtz
, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman:
31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands. LIPIcs 274, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-295-2 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:22
- Martin Dietzfelbinger:
On Hashing by (Random) Equations (Invited Talk). 1:1-1:1 - Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams:
On Diameter Approximation in Directed Graphs. 2:1-2:17 - Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier:
Can You Solve Closest String Faster Than Exhaustive Search? 3:1-3:17 - Amir Abboud, Shay Mozes, Oren Weimann:
What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? 4:1-4:20 - Ahmed Abdelkader, David M. Mount:
Smooth Distance Approximation. 5:1-5:18 - Hugo A. Akitaya, Andrei Gonczi, Diane L. Souvaine, Csaba D. Tóth, Thomas Weighill:
Reconfiguration of Polygonal Subdivisions via Recombination. 6:1-6:16 - Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, Zixuan Xu:
Faster Detours in Undirected Graphs. 7:1-7:17 - Shyan Akmal, Nicole Wein:
A Local-To-Global Theorem for Congested Shortest Paths. 8:1-8:17 - Patrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann, Maximilian Pfister, Torsten Ueckerdt:
Axis-Parallel Right Angle Crossing Graphs. 9:1-9:15 - Simon Apers, Stacey Jeffery, Galina Pass, Michael Walter:
(No) Quantum Space-Time Tradeoff for USTCON. 10:1-10:17 - Júlia Baligács, Yann Disser, Irene Heinrich, Pascal Schweitzer:
Exploration of Graphs with Excluded Minors. 11:1-11:15 - Evripidis Bampis, Bruno Escoffier, Themis Gouleakis, Niklas Hahn, Kostas Lakis, Golnoosh Shahkarami, Michalis Xefteris:
Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else. 12:1-12:17 - Jørgen Bang-Jensen, Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh:
A Parameterized Algorithm for Vertex Connectivity Survivable Network Design Problem with Uniform Demands. 13:1-13:15 - Hideo Bannai, Jonas Ellert:
Lyndon Arrays in Sublinear Time. 14:1-14:16 - Ruben Becker, Manuel Cáceres, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, Nicola Prezza:
Sorting Finite Automata via Partition Refinement. 15:1-15:15 - Matthias Bentert, Klaus Heeger, Tomohiro Koana:
Fully Polynomial-Time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication. 16:1-16:16 - Aaron Berger, Jenny Kaufmann, Virginia Vassilevska Williams:
Approximating Min-Diameter: Standard and Bichromatic. 17:1-17:14 - Benjamin Bergougnoux, Vera Chekan, Robert Ganian, Mamadou Moustapha Kanté, Matthias Mnich, Sang-il Oum, Michal Pilipczuk, Erik Jan van Leeuwen:
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth. 18:1-18:18 - Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders:
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions. 19:1-19:16 - Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Janosch Ruff, Ziena Zeif:
On the Giant Component of Geometric Inhomogeneous Random Graphs. 20:1-20:13 - Thomas Bläsius, Max Göttlicher:
An Efficient Algorithm for Power Dominating Set. 21:1-21:15 - Joakim Blikstad, Peter Kiss:
Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time. 22:1-22:19 - Édouard Bonnet, Julien Duron, Colin Geniet, Stéphan Thomassé, Alexandra Wesolek:
Maximum Independent Set When Excluding an Induced Minor: K₁ + tK₂ and tC₃ ⊎ C₄. 23:1-23:15 - Karl Bringmann, Alejandro Cassis:
Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution. 24:1-24:16 - Gerth Stølting Brodal, Sebastian Wild:
Funnelselect: Cache-Oblivious Multiple Selection. 25:1-25:17 - Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, Sampson Wong:
Oriented Spanners. 26:1-26:16 - Martin Bullinger, René Romen:
Online Coalition Formation Under Random Arrival or Coalition Dissolution. 27:1-27:18 - Sergio Cabello, Panos Giannopoulos:
On k-Means for Segments and Polylines. 28:1-28:14 - Dongrun Cai, Xue Chen, Pan Peng:
Effective Resistances in Non-Expander Graphs. 29:1-29:18 - Victor A. Campos, Jonas Costa Ferreira da Silva, Raul Lopes, Ignasi Sau:
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. 30:1-30:18 - Yixin Cao:
Enumerating Maximal Induced Subgraphs. 31:1-31:13 - Charlie Carlson, Jafar Jafarov, Konstantin Makarychev, Yury Makarychev, Liren Shan:
Approximation Algorithm for Norm Multiway Cut. 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. 33:1-33:13 - Adil Chhabra, Marcelo Fonseca Faraj, Christian Schulz:
Faster Local Motif Clustering via Maximum Flows. 34:1-34:16 - Ilan Reuven Cohen, Binghui Peng:
Primal-Dual Schemes for Online Matching in Bounded Degree Graphs. 35:1-35:17 - Michael Czekanski, Shelby Kimmel, R. Teal Witter:
Robust and Space-Efficient Dual Adversary Quantum Query Algorithms. 36:1-36:19 - Arthur Carvalho Walraven da Cunha, Francesco D'Amore, Frédéric Giroire, Hicham Lesfari, Emanuele Natale, Laurent Viennot:
Revisiting the Random Subset Sum Problem. 37:1-37:11 - Christoph Damerius, Peter Kling, Minming Li, Chenyang Xu, Ruilong Zhang:
Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings. 38:1-38:15 - Max A. Deppert, Matthias Kaul, Matthias Mnich:
A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. 39:1-39:15 - Xiangyun Ding, Xiaojun Dong, Yan Gu, Youzhe Liu, Yihan Sun:
Efficient Parallel Output-Sensitive Edit Distance. 40:1-40:20 - Ming Ding, Peng Zhang:
Efficient 1-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences. 41:1-41:19 - Dani Dorfman, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Optimal Energetic Paths for Electric Cars. 42:1-42:17 - Jan Dreier, Daniel Mock, Peter Rossmanith:
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. 43:1-43:17 - Yuval Emek, Yuval Gil, Maciej Pacut, Stefan Schmid:
Online Algorithms with Randomly Infused Advice. 44:1-44:19 - Sándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, Christian Scheffer:
The Lawn Mowing Problem: From Algebra to Algorithms. 45:1-45:18 - Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, Giorgio Vinciguerra:
Learned Monotone Minimal Perfect Hashing. 46:1-46:17 - Aleksander Figiel, Tomohiro Koana, André Nichterlein, Niklas Wünsche:
Correlating Theory and Practice in Finding Clubs and Plexes. 47:1-47:18 - Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh, Meirav Zehavi:
Kernelization for Spreading Points. 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. 49:1-49:14 - Sebastian Forster, Gramoz Goranci, Yasamin Nazari, Antonis Skarlatos:
Bootstrapping Dynamic Distance Oracles. 50:1-50:16 - Daniel Funke, Nicolai Hüning, Peter Sanders:
A Sweep-Plane Algorithm for Calculating the Isolation of Mountains. 51:1-51:17 - Amit Ganz, Pranav Nuti, Roy Schwartz:
A Tight Competitive Ratio for Online Submodular Welfare Maximization. 52:1-52:17 - Colin Geniet, Stéphan Thomassé:
First Order Logic and Twin-Width in Tournaments. 53:1-53:14 - Svenja M. Griesbach, Felix Hommelsheim, Max Klimm, Kevin Schewior:
Improved Approximation Algorithms for the Expanding Search Problem. 54:1-54:15 - Christoph Grunau, Ahmet Alper Özüdogru, Václav Rozhon:
Noisy k-Means++ Revisited. 55:1-55:7 - Elfarouk Harb, Kent Quanrud, Chandra Chekuri:
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing. 56:1-56:17 - David G. Harris:
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication. 57:1-57:17 - Úrsula Hébert-Johnson, Daniel Lokshtanov, Eric Vigoda:
Counting and Sampling Labeled Chordal Graphs in Polynomial Time. 58:1-58:17 - Falko Hegerfeld, Stefan Kratsch:
Tight Algorithms for Connectivity Problems Parameterized by Clique-Width. 59:1-59:19 - Demian Hespe, Peter Sanders, Sabine Storandt, Carina Truschel:
Pareto Sums of Pareto Sets. 60:1-60:17 - Anthony Hevia, Benjamin Kallus, Summer McClintic, Samantha Reisner, Darren Strash, Johnathan Wilson:
Solving Edge Clique Cover Exactly via Synergistic Data Reduction. 61:1-61:19 - Martin Hoefer, Kevin Schewior:
Threshold Testing and Semi-Online Prophet Inequalities. 62:1-62:15 - Tanmay Inamdar, Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan:
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability). 63:1-63:17 - Adam Izdebski, Ronald de Wolf:
Improved Quantum Boosting. 64:1-64:16 - Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi:
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. 65:1-65:17 - Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk:
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. 66:1-66:16 - Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir:
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. 67:1-67:14 - Adam Karczmarz, Marcin Smulewicz:
On Fully Dynamic Strongly Connected Components. 68:1-68:15 - Dor Katzelnick, Aditya Pillai, Roy Schwartz, Mohit Singh:
An Improved Approximation Algorithm for the Max-3-Section Problem. 69:1-69:17 - Evangelos Kipouridis:
Fitting Tree Metrics with Minimum Disagreements. 70:1-70:10 - Felix Klingelhöfer, Alantha Newman:
Coloring Tournaments with Few Colors: Algorithms and Complexity. 71:1-71:14 - Tomasz Kociumaka, Adam Polak:
Bellman-Ford Is Optimal for Shortest Hop-Bounded Paths. 72:1-72:10 - Shimon Kogan, Merav Parter:
Towards Bypassing Lower Bounds for Graph Shortcuts. 73:1-73:16 - Dominik Köppl, Florian Kurpicz, Daniel Meyer:
Faster Block Tree Construction. 74:1-74:20 - Evangelos Kosinas:
Connectivity Queries Under Vertex Failures: Not Optimal, but Practical. 75:1-75:13 - Adam Kurpisz, Silvan Suter:
Improved Approximations for Translational Packing of Convex Polygons. 76:1-76:14 - Michael Lampis, Manolis Vasilakis:
Structural Parameterizations for Two Bounded Degree Problems Revisited. 77:1-77:16 - Zelin Li, Pan Peng, Xianbin Zhu:
Massively Parallel Algorithms for the Stochastic Block Model. 78:1-78:17 - Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao:
Connectivity in the Presence of an Opponent. 79:1-79:14 - Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang, Renfei Zhou:
On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. 80:1-80:15 - Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for Quantum Phase Estimation and Related Problems. 81:1-81:16 - Isja Mannens, Jesper Nederlof:
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. 82:1-82:17 - Francesco Masillo:
Matching Statistics Speed up BWT Construction. 83:1-83:15 - Ismail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Min-Sum k-Clustering. 84:1-84:16 - Eunjin Oh, Seunghyeok Oh:
Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs. 85:1-85:15 - George Osipov, Magnus Wahlström:
Parameterized Complexity of Equality MinCSP. 86:1-86:17 - Ioannis Panagiotas, Grégoire Pichon, Somesh Singh, Bora Uçar:
Engineering Fast Algorithms for the Bottleneck Matching Problem. 87:1-87:15 - Krzysztof Pióro:
Subcubic Algorithm for (Unweighted) Unrooted Tree Edit Distance. 88:1-88:14 - Jakub Radoszewski:
Linear Time Construction of Cover Suffix Tree and Applications. 89:1-89:17 - Ignaz Rutter, Peter Stumpf:
Simultaneous Representation of Interval Graphs in the Sunflower Case. 90:1-90:15 - Menachem Sadigurschi, Moshe Shechner, Uri Stemmer:
Relaxed Models for Adversarial Streaming: The Bounded Interruptions Model and the Advice Model. 91:1-91:14 - Thatchaphol Saranurak, Wuwei Yuan:
Maximal k-Edge-Connected Subgraphs in Almost-Linear Time for Small k. 92:1-92:9 - Baruch Schieber, Soroush Vahidi:
Approximating Connected Maximum Cuts via Local Search. 93:1-93:17 - François Sellier:
Parameterized Matroid-Constrained Maximum Coverage. 94:1-94:16 - Chinmay Sonar, Subhash Suri, Jie Xue:
Fault Tolerance in Euclidean Committee Selection. 95:1-95:14 - Jacek Sroka, Jerzy Tyszkiewicz:
Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat Maps. 96:1-96:13 - Enze Sun, Zonghan Yang, Yuhao Zhang:
Improved Algorithms for Online Rent Minimization Problem Under Unit-Size Jobs. 97:1-97:14 - Xiaoming Sun, Jialin Zhang, Zhijie Zhang:
Simple Deterministic Approximation for Submodular Multiple Knapsack Problem. 98:1-98:15 - André van Renssen, Yuan Sha, Yucheng Sun, Sampson Wong:
The Tight Spanning Ratio of the Rectangle Delaunay Triangulation. 99:1-99:15 - Oleg Verbitsky, Maksim Zhukovskii:
Canonization of a Random Graph by Two Matrix-Vector Multiplications. 100:1-100:13 - Haitao Wang, Yiming Zhao:
Improved Algorithms for Distance Selection and Related Problems. 101:1-101:14 - Rowan Warneke, Farhana Murtaza Choudhury, Anthony Wirth:
Maximum Coverage in Random-Arrival Streams. 102:1-102:15 - Chuhan Yang, Christopher Musco:
Efficient Block Approximate Matrix Multiplication. 103:1-103:15 - Goran Zuzic:
A Simple Boosting Framework for Transshipment. 104:1-104:14
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.
last updated on 2025-10-22 02:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
