default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th ESA 2021: Lisbon, Portugal (Virtual Conference)
- Petra Mutzel
, Rasmus Pagh, Grzegorz Herman:
29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference). LIPIcs 204, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-204-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Lukas Glomb, Benno Hoch, Frauke Liers, Florian Rösel:
Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk). 1:1-1:3 - Aaron Roth:
A User Friendly Power Tool for Deriving Online Learning Algorithms (Invited Talk). 2:1-2:1 - Saman Ahmadi, Guido Tack, Daniel Harabor, Philip Kilby:
Bi-Objective Search with Bi-Directional A. 3:1-3:15 - Maor Akav, Liam Roditty:
A Unified Approach for All Pairs Approximate Shortest Paths in Weighted Undirected Graphs. 4:1-4:18 - Carlos Alegría, Ioannis Mantas, Evanthia Papadopoulou, Marko Savic, Hendrik Schrezenmaier, Carlos Seara, Martin Suderland:
The Voronoi Diagram of Rotating Rays With applications to Floodlight Illumination. 5:1-5:16 - Markus Anders, Pascal Schweitzer:
Parallel Computation of Combinatorial Symmetries. 6:1-6:18 - Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna:
Graph Connectivity and Single Element Recovery via Linear and OR Queries. 7:1-7:19 - Sepehr Assadi, Shay Solomon:
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. 8:1-8:18 - Nikhil Ayyadevara, Ashish Chiplunkar:
The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential. 9:1-9:11 - Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter:
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. 10:1-10:18 - Jørgen Bang-Jensen, Kristine Vitting Klinkby, Saket Saurabh:
k-Distinct Branchings Admits a Polynomial Kernel. 11:1-11:15 - Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. 12:1-12:18 - Mark de Berg, Morteza Monemizadeh, Yu Zhong:
k-Center Clustering with Outliers in the Sliding-Window Model. 13:1-13:13 - Aaron Bernstein, Aditi Dudeja, Seth Pettie:
Incremental SCC Maintenance in Sparse Graphs. 14:1-14:16 - Nico Bertram, Jonas Ellert, Johannes Fischer:
Lyndon Words Accelerate Suffix Sorting. 15:1-15:13 - Sujoy Bhore, Csaba D. Tóth:
Online Euclidean Spanners. 16:1-16:19 - Therese Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud:
Distant Representatives for Rectangles in the Plane. 17:1-17:18 - Davide Bilò, Sarel Cohen, Tobias Friedrich, Martin Schirneck:
Near-Optimal Deterministic Single-Source Distance Sensitivity Oracles. 18:1-18:17 - Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. 19:1-19:14 - Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann:
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry. 20:1-20:15 - Thomas Bläsius, Tobias Friedrich, Christopher Weyand:
Efficiently Computing Maximum Flows in Scale-Free Networks. 21:1-21:14 - Alexander Braun, Matthias Buttkus, Thomas Kesselheim:
Asymptotically Optimal Welfare of Posted Pricing for Multiple Items with MHR Distributions. 22:1-22:16 - David Caballero, Timothy Gomez, Robert T. Schweller, Tim Wylie:
Covert Computation in Staged Self-Assembly: Verification Is PSPACE-Complete. 23:1-23:18 - Jean Cardinal, Justin Dallant, John Iacono:
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. 24:1-24:14 - Jean Cardinal, John Iacono, Grigorios Koumoutsos:
Worst-Case Efficient Dynamic Geometric Independent Set. 25:1-25:15 - Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Balanced Crown Decomposition for Connectivity Constraints. 26:1-26:15 - Timothy M. Chan:
All-Pairs Shortest Paths for Real-Weighted Undirected Graphs with Small Additive Error. 27:1-27:9 - Timothy M. Chan, Zhengcheng Huang:
Dynamic Colored Orthogonal Range Searching. 28:1-28:13 - Karthekeyan Chandrasekaran, Weihang Wang:
ℓp-Norm Multiway Cut. 29:1-29:15 - Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Faster Algorithms for Longest Common Substring. 30:1-30:17 - Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu:
Feature Cross Search via Submodular Optimization. 31:1-31:16 - Éric Colin de Verdière, Thomas Magnard:
An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes. 32:1-32:17 - Jana Cslovjecsek, Friedrich Eisenbrand, Michal Pilipczuk, Moritz Venzin, Robert Weismantel:
Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity. 33:1-33:14 - Radu Curticapean, Holger Dell, Thore Husfeldt:
Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths. 34:1-34:17 - Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, Grigory Reznikov:
Minimum Common String Partition: Exact Algorithms. 35:1-35:16 - Daniel Dadush, Zhuan Khye Koh, Bento Natura, László A. Végh:
An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems. 36:1-36:15 - Michal Debski, Marta Piecyk, Pawel Rzazewski:
Faster 3-Coloring of Small-Diameter Graphs. 37:1-37:15 - Hu Ding:
Stability Yields Sublinear Time Algorithms for Geometric Optimization in Machine Learning. 38:1-38:19 - Pavel Dvorák, Michal Koucký, Karel Král, Veronika Slívová:
Data Structures Lower Bounds and Popular Conjectures. 39:1-39:15 - Zdenek Dvorák, Abhiruk Lahiri:
Approximation Schemes for Bounded Distance Problems on Fractionally Treewidth-Fragile Graphs. 40:1-40:10 - Yaron Fairstein, Ariel Kulik, Hadas Shachnai:
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. 41:1-41:16 - Hendrik Fichtenberger, Monika Henzinger, Lara Ost:
Differentially Private Algorithms for Graphs Under Continual Observation. 42:1-42:16 - Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees. 43:1-43:13 - Alejandro Flores-Velazco, David M. Mount:
Boundary-Sensitive Approach for Approximate Nearest-Neighbor Classification. 44:1-44:15 - Moses Ganardi:
Compression by Contracting Straight-Line Programs. 45:1-45:16 - Younan Gao, Meng He:
Space Efficient Two-Dimensional Orthogonal Colored Range Counting. 46:1-46:17 - Loukas Georgiadis, Giuseppe F. Italiano, Evangelos Kosinas:
Computing the 4-Edge-Connected Components of a Graph in Linear Time. 47:1-47:17 - Lars Gottesbüren, Tobias Heuer, Peter Sanders, Christian Schulz, Daniel Seemaier:
Deep Multilevel Graph Partitioning. 48:1-48:17 - Fabrizio Grandoni, Tobias Mömke, Andreas Wiese:
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. 49:1-49:15 - Yassine Hamoudi:
Quantum Sub-Gaussian Mean Estimator. 50:1-50:17 - Sariel Har-Peled, Timothy Zhou:
Improved Approximation Algorithms for Tverberg Partitions. 51:1-51:15 - Zhiyang He, Jason Li, Magnus Wahlström:
Near-Linear-Time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs. 52:1-52:14 - Klaus Jansen, Malin Rau:
Closing the Gap for Single Resource Constraint Scheduling. 53:1-53:15 - Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou, Martin Suderland, Chee Yap:
Certified Approximation Algorithms for the Fermat Point and n-Ellipses. 54:1-54:19 - Leon Kellerhals, Malte Renken, Philipp Zschoche:
Parameterized Algorithms for Diverse Multistage Problems. 55:1-55:17 - Dominik Kempa, Ben Langmead:
Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. 56:1-56:14 - Boris Klemz:
Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing. 57:1-57:15 - Benoît Larose, Petar Markovic, Barnaby Martin, Daniël Paulusma, Siani Smith, Stanislav Zivný:
QCSP on Reflexive Tournaments. 58:1-58:15 - Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. 59:1-59:17 - David J. Lee, Samuel McCauley, Shikha Singh, Max Stein:
Telescoping Filter: A Practical Adaptive Filter. 60:1-60:18 - Jasper C. H. Lee, Jerry Li, Christopher Musco, Jeff M. Phillips, Wai Ming Tai:
Finding an Approximate Mode of a Kernel Density Estimate. 61:1-61:19 - Marilena Leichter, Benjamin Moseley, Kirk Pruhs:
An Efficient Reduction of a Gammoid to a Partition Matroid. 62:1-62:13 - Daniel Lokshtanov, Subhash Suri, Jie Xue:
Efficient Algorithms for Least Square Piecewise Polynomial Regression. 63:1-63:15 - Grigorios Loukides, Solon P. Pissis:
Bidirectional String Anchors: A New String Sampling Mechanism. 64:1-64:21 - Anna Lubiw, Anurag Murty Naredla:
The Visibility Center of a Simple Polygon. 65:1-65:14 - Ryoga Mahara:
Extension of Additive Valuations to General Valuations on the Existence of EFX. 66:1-66:15 - Tomás Martínez-Muñoz, Andreas Wiese:
FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees. 67:1-67:15 - Claire Mathieu, Hang Zhou:
A Simple Algorithm for Graph Reconstruction. 68:1-68:18 - William Maxwell, Amir Nayyeri:
Generalized Max-Flows and Min-Cuts in Simplicial Complexes. 69:1-69:16 - J. Ian Munro, Patrick K. Nicholson, Louisa Seelbach Benkner, Sebastian Wild:
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima. 70:1-70:18 - Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, Marek Sokolowski:
Determining 4-Edge-Connected Components in Linear Time. 71:1-71:15 - Daniel Neuen:
Isomorphism Testing Parameterized by Genus and Beyond. 72:1-72:18 - Katarzyna Paluch, Mateusz Wasylkiewicz:
Restricted t-Matchings via Half-Edges. 73:1-73:17 - Ojas Parekh, Kevin Thompson:
Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems. 74:1-74:18 - Eden Pelleg, Stanislav Zivný:
Additive Sparsification of CSPs. 75:1-75:15 - Krzysztof Potepa:
Faster Deterministic Modular Subset Sum. 76:1-76:16 - Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Hardness of Detecting Abelian and Additive Square Factors in Strings. 77:1-77:19 - M. S. Ramanujan:
On Approximate Compressions for Connected Minor-Hitting Sets. 78:1-78:16 - Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt:
Restricted Adaptivity in Stochastic Scheduling. 79:1-79:14 - Yishu Wang, Arnaud Mary, Marie-France Sagot, Blerina Sinaimeri:
A General Framework for Enumerating Equivalence Classes of Solutions. 80:1-80:14 - Marvin Williams, Peter Sanders, Roman Dementiev:
Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues. 81:1-81:17 - Florian Wörz, Jan-Hendrik Lorenz:
Evidence for Long-Tails in SLS Algorithms. 82:1-82:16
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-11-04 00:38 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:
