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