default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th ESA 2022: Berlin/Potsdam, Germany
- Shiri Chechik, Gonzalo Navarro
, Eva Rotenberg, Grzegorz Herman:
30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany. LIPIcs 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-247-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:22
- Faisal N. Abu-Khzam, Henning Fernau, Benjamin Gras, Mathieu Liedloff, Kevin Mann:
Enumerating Minimal Connected Dominating Sets. 1:1-1:15 - Raghavendra Addanki, Andrew McGregor, Cameron Musco:
Non-Adaptive Edge Counting and Sampling via Bipartite Independent Set Queries. 2:1-2:16 - Oswin Aichholzer, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Zuzana Masárová, Mikhail Rudoy, Virginia Vassilevska Williams, Nicole Wein:
Hardness of Token Swapping on Trees. 3:1-3:15 - Susanne Albers, Sebastian Schubert:
Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities. 4:1-4:16 - Henk Alkema, Mark de Berg, Morteza Monemizadeh, Leonidas Theocharous:
TSP in a Simple Polygon. 5:1-5:14 - Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha:
Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming. 6:1-6:18 - Georg Anegg, Laura Vargas Koch, Rico Zenklusen:
Techniques for Generalized Colorful k-Center Problems. 7:1-7:14 - Mohammad Ansari, Mohammad Saneian, Hamid Zarrabi-Zadeh:
Simple Streaming Algorithms for Edge Coloring. 8:1-8:4 - Antonios Antoniadis, Mark de Berg, Sándor Kisfaludi-Bak, Antonis Skarlatos:
Computing Smallest Convex Intersecting Polygons. 9:1-9:13 - Anna Arutyunova, Heiko Röglin:
The Price of Hierarchical Clustering. 10:1-10:14 - Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff:
Bounding and Computing Obstacle Numbers of Graphs. 11:1-11:13 - Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto:
Computing NP-Hard Repetitiveness Measures via MAX-SAT. 12:1-12:16 - Nikhil Bansal, Christian Coester:
Online Metric Allocation and Time-Varying Regularization. 13:1-13:13 - Florian Barth, Stefan Funke, Claudius Proissl:
An Upper Bound on the Number of Extreme Shortest Paths in Arbitrary Dimensions. 14:1-14:12 - Valentin Bartier, Nicolas Bousquet, Amer E. Mouawad:
Galactic Token Sliding. 15:1-15:14 - Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul Alam Chowdhury, Rob Johnson, Rishab Nithyanand, Michael A. Bender:
When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting. 16:1-16:17 - Sayan Bhattacharya, Thatchaphol Saranurak, Pattara Sukprasert:
Simple Dynamic Spanners with Near-Optimal Recourse Against an Adaptive Adversary. 17:1-17:19 - Sujoy Bhore, Arnold Filtser, Hadi Khodabandeh, Csaba D. Tóth:
Online Spanners in Metric Spaces. 18:1-18:20 - Davide Bilò, Gianlorenzo D'Angelo, Luciano Gualà, Stefano Leucci, Mirko Rossi:
Sparse Temporal Spanners with Low Stretch. 19:1-19:16 - Daniel Blankenburg:
Resource Sharing Revisited: Local Weak Duality and Optimal Convergence. 20:1-20:14 - Thomas Bläsius, Philipp Fischbeck:
On the External Validity of Average-Case Analyses of Graph Algorithms. 21:1-21:14 - Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla:
On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. 22:1-22:16 - Kobi Bodek, Moran Feldman:
Maximizing Sums of Non-Monotone Submodular and Linear Functions: Understanding the Unconstrained Case. 23:1-23:17 - Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
List Colouring Trees in Logarithmic Space. 24:1-24:15 - Bartlomiej Bosek, Anna Zych-Pawlewicz:
Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget. 25:1-25:14 - Lukasz Bozyk, Michal Pilipczuk:
Polynomial Kernel for Immersion Hitting in Tournaments. 26:1-26:17 - Jendrik Brachter, Pascal Schweitzer:
A Systematic Study of Isomorphism Invariants of Finite Groups via the Weisfeiler-Leman Dimension. 27:1-27:14 - Frederik Brüning, Jacobus Conradi, Anne Driemel:
Faster Approximate Covering of Subcurves Under the Fréchet Distance. 28:1-28:16 - Maike Buchin, Ivor van der Hoog, Tim Ophelders, Lena Schlipf, Rodrigo I. Silveira, Frank Staals:
Efficient Fréchet Distance Queries for Segments. 29:1-29:14 - Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon:
Search-Space Reduction via Essential Vertices. 30:1-30:15 - Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. 31:1-31:14 - Amit Chakrabarti, Themistoklis K. Haris:
Counting Simplices in Hypergraph Streams. 32:1-32:19 - Deeparnab Chakrabarty, Maryam Negahbani, Ankita Sarkar:
Approximation Algorithms for Continuous Clustering and Facility Location Problems. 33:1-33:15 - Sourav Chakraborty, N. V. Vinodchandran, Kuldeep S. Meel:
Distinct Elements in Streams: An Algorithm for the (Text) Book. 34:1-34:6 - Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching. 35:1-35:19 - Jiehua Chen, Sanjukta Roy:
Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. 36:1-36:16 - Markus Chimani, Finn Stutzenstein:
Spanner Approximations in Practice. 37:1-37:15 - Radu Curticapean:
Determinants from Homomorphisms. 38:1-38:7 - Justin Dallant, John Iacono:
Conditional Lower Bounds for Dynamic Geometric Measure Problems. 39:1-39:17 - Syamantak Das, Andreas Wiese:
A Simpler QPTAS for Scheduling Jobs with Precedence Constraints. 40:1-40:11 - Argyrios Deligkas, Michail Fasoulakis, Evangelos Markakis:
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games. 41:1-41:14 - Dipan Dey, Manoj Gupta:
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path Problem. 42:1-42:18 - Tamal K. Dey, Tao Hou:
Fast Computation of Zigzag Persistence. 43:1-43:15 - Alexander Dobler, Manuel Sorge, Anaïs Villedieu:
Turbocharging Heuristics for Weak Coloring Numbers. 44:1-44:18 - Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis, Mauricio G. C. Resende, Quico Spaen:
A Local Search Algorithm for Large Maximum Weight Independent Set Problems. 45:1-45:16 - Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
SAT Backdoors: Depth Beats Size. 46:1-46:18 - Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider:
Finding a Cluster in Incomplete Data. 47:1-47:14 - Jonas Ellert:
Lyndon Arrays Simplified. 48:1-48:14 - Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty. 49:1-49:18 - Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. 50:1-50:19 - Esther Ezra, Micha Sharir:
Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection. 51:1-51:17 - Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Submodular Maximization Subject to Matroid Intersection on the Fly. 52:1-52:14 - Aleksander Figiel, Vincent Froese, André Nichterlein, Rolf Niedermeier:
There and Back Again: On Applying Data Reduction Rules by Undoing Others. 53:1-53:15 - Alejandro Flores-Velazco:
Improved Search of Relevant Points for Nearest-Neighbor Classification. 54:1-54:10 - Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov:
Longest Cycle Above Erdős-Gallai Bound. 55:1-55:15 - Zachary Friggstad, Mahya Jamshidian:
Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters. 56:1-56:14 - Travis Gagie:
Simple Worst-Case Optimal Adaptive Prefix-Free Coding. 57:1-57:5 - Jakub Gajarský, Lars Jaffke, Paloma T. Lima, Jana Novotná, Marcin Pilipczuk, Pawel Rzazewski, Uéverton S. Souza:
Taming Graphs with No Large Creatures and Skinny Ladders. 58:1-58:8 - Younan Gao, Meng He:
Faster Path Queries in Colored Trees via Sparse Matrix Multiplication and Min-Plus Product. 59:1-59:15 - Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. 60:1-60:16 - Tatsuya Gima, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi:
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited. 61:1-61:15 - Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt:
Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs. 62:1-62:14 - Bernhard Haepler, D. Ellis Hershkowitz, Goran Zuzic:
Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings. 63:1-63:14 - Tesshu Hanaka, Michael Lampis:
Hedonic Games and Treewidth Revisited. 64:1-64:16 - Monika Henzinger, Ami Paz, A. R. Sricharan:
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. 65:1-65:14 - D. Ellis Hershkowitz, Jason Li:
O(1) Steiner Point Removal in Series-Parallel Graphs. 66:1-66:17 - Thijs van der Horst, Maarten Löffler, Frank Staals:
Chromatic k-Nearest Neighbor Queries. 67:1-67:14 - Chien-Chung Huang, François Sellier:
Maximum Weight b-Matchings in Random-Order Streams. 68:1-68:14 - Leo van Iersel, Mark Jones, Mathias Weller:
Embedding Phylogenetic Trees in Networks of Low Treewidth. 69:1-69:14 - Han Jiang, Shang-En Huang, Thatchaphol Saranurak, Tian Zhang:
Vertex Sparsifiers for Hyperedge Connectivity. 70:1-70:13 - Debajyoti Kar, Arindam Khan, Andreas Wiese:
Approximation Algorithms for Round-UFP and Round-SAP. 71:1-71:19 - Shahbaz Khan, Alexandru I. Tomescu:
Optimizing Safe Flow Decompositions in DAGs. 72:1-72:17 - Dusan Knop, Martin Koutecký:
Scheduling Kernels via Configuration LP. 73:1-73:15 - Lex de Kogel, Marc J. van Kreveld, Jordi L. Vermeulen:
Abstract Morphing Using the Hausdorff Distance and Voronoi Diagrams. 74:1-74:16 - Soh Kumabe, Yuichi Yoshida:
Average Sensitivity of the Knapsack Problem. 75:1-75:14 - Aleksander Lukasiewicz, Przemyslaw Uznanski:
Cardinality Estimation Using Gumbel Distribution. 76:1-76:13 - Marten Maack, Simon Pukrop, Anna Rodriguez Rasmussen:
(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. 77:1-77:13 - Clément Maria, Owen Rouillé:
Localized Geometric Moves to Compute Hyperbolic Structures on Triangulated 3-Manifolds. 78:1-78:13 - Wojciech Nadara, Michal Pilipczuk, Marcin Smulewicz:
Computing Treedepth in Polynomial Space and Linear FPT Time. 79:1-79:14 - Bento Natura, Meike Neuwohner, Stefan Weltge:
The Pareto Cover Problem. 80:1-80:12 - Ofer Neiman, Idan Shabat:
A Unified Framework for Hopsets. 81:1-81:13 - Zeev Nutov:
Data Structures for Node Connectivity Queries. 82:1-82:12 - Rajmohan Rajaraman, Omer Wasim:
Improved Bounds for Online Balanced Graph Re-Partitioning. 83:1-83:15 - Chris Schwiegelshohn, Omar Ali Sheikh-Omar:
An Empirical Evaluation of k-Means Coresets. 84:1-84:17 - Marek Szykula, Adam Zyzik:
An Improved Algorithm for Finding the Shortest Synchronizing Words. 85:1-85:15 - Alexander Tiskin:
Fast RSK Correspondence by Doubling Search. 86:1-86:10 - Stefan Walzer:
Insertion Time of Random Walk Cuckoo Hashing below the Peeling Threshold. 87:1-87:11 - Yiqiu Wang, Rahul Yesantharao, Shangdi Yu, Laxman Dhulipala, Yan Gu, Julian Shun:
ParGeo: A Library for Parallel Computational Geometry. 88:1-88:19 - Nils Werner, Tim Zeitz:
Combining Predicted and Live Traffic with Time-Dependent A* Potentials. 89:1-89:15 - Zoe Xi, William Kuszmaul:
Approximating Dynamic Time Warping Distance Between Run-Length Encoded Strings. 90:1-90:19 - Sheng Yang, Samir Khuller, Sunav Choudhary, Subrata Mitra, Kanak Mahadik:
Correlated Stochastic Knapsack with a Submodular Objective. 91:1-91:14 - Or Zamir:
Faster Algorithm for Unique (k, 2)-CSP. 92:1-92:13
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-01-24 17:03 CET 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:
