default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th WADS 2021: Virtual Event
- Anna Lubiw
, Mohammad R. Salavatipour:
Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings. Lecture Notes in Computer Science 12808, Springer 2021, ISBN 978-3-030-83507-1 - Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose:
On the Spanning and Routing Ratios of the Directed $\varTheta _6$-Graph. 1-14 - Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid:
The Minimum Moving Spanning Tree Problem. 15-28 - Susanne Albers, Alexander Eckl:
Scheduling with Testing on Multiple Identical Parallel Machines. 29-42 - Susanne Albers, Maximilian Janke:
Online Makespan Minimization with Budgeted Uncertainty. 43-56 - Corentin Allair, Antoine Vigneron:
Pattern Matching in Doubling Spaces. 57-70 - Shinwoo An, Eunjin Oh:
Reachability Problems for Transmission Graphs. 71-84 - Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase:
On Minimum Generalized Manhattan Connections. 85-100 - Jim Apple:
HalftimeHash: Modern Hashing Without 64-Bit Multipliers or Finite Fields. 101-114 - Ívar Marrow Arnþórsson, Steven Chaplick, Jökull Snær Gylfason, Magnús M. Halldórsson, Jökull Máni Reynisson, Tigran Tonoyan:
Generalized Disk Graphs. 115-128 - Stav Ashur, Matthew J. Katz:
A 4-Approximation of the $\frac{2\pi }{3}$-MST. 129-143 - Ioana O. Bercea, Guy Even:
Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations. 144-157 - Helena Bergold, Winfried Hochstättler, Uwe Mayer:
The Neighborhood Polynomial of Chordal Graphs. 158-171 - Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
Incomplete Directed Perfect Phylogeny in Linear Time. 172-185 - Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. 186-199 - Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma:
Solving Problems on Generalized Convex Graphs via Mim-Width. 200-214 - Prosenjit Bose, Darryl Hill, Aurélien Ooms:
Improved Bounds on the Spanning Ratio of the Theta-5-Graph. 215-228 - Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Transversals in H-Free Graphs. 229-242 - Kevin Buchin, Maarten Löffler, Tim Ophelders, Aleksandr Popov, Jérôme Urhausen, Kevin Verbeek:
Computing the Fréchet Distance Between Uncertain Curves in One Dimension. 243-257 - Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. 258-270 - Steven Chaplick, Giordano Da Lozzo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani:
Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees. 271-285 - Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An APTAS for Bin Packing with Clique-Graph Conflicts. 286-299 - Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera:
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs. 300-314 - Anne Driemel, Ioannis Psarros:
ANN for Time Series Under the Fréchet Distance. 315-328 - Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski:
Strictly In-Place Algorithms for Permuting and Inverting Permutations. 329-342 - David Eppstein:
A Stronger Lower Bound on Parametric Minimum Spanning Trees. 343-356 - Leah Epstein, Loay Mualem:
Online Bin Packing of Squares and Cubes. 357-370 - Thomas Erlebach, Jakob T. Spooner:
Exploration of k-Edge-Deficient Temporal Graphs. 371-384 - Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit:
Parameterized Complexity of Categorical Clustering with Size Constraints. 385-398 - Zachary Friggstad, Maryam Mahboub:
Graph Pricing with Limited Supply. 399-413 - Zachary Friggstad, Ramin Mousavi:
Fair Correlation Clustering with Global and Local Guarantees. 414-427 - Pawel Gawrychowski, Przemyslaw Uznanski:
Better Distance Labeling for Unweighted Planar Graphs. 428-441 - Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias:
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. 442-456 - Joachim Gudmundsson, Yuan Sha:
Algorithms for Radius-Optimally Augmenting Trees in a Metric Space. 457-470 - Monika Henzinger, Xiaowei Wu:
Upper and Lower Bounds for Fully Retroactive Graph Problems. 471-484 - Changyong Hu, Vijay K. Garg:
Characterization of Super-Stable Matchings. 485-498 - Jeannette C. M. Janssen, Zhiyuan Zhang:
Uniform Embeddings for Robinson Similarity Matrices. 499-512 - Jakob Keller, Christian Rieck, Christian Scheffer, Arne Schmidt:
Particle-Based Assembly Using Precise Global Control. 513-527 - Yash Khanna, Anand Louis, Rameesh Paul:
Independent Sets in Semi-random Hypergraphs. 528-542 - Shelby Kimmel, R. Teal Witter:
A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs. 543-555 - Tsvi Kopelowitz, Samuel McCauley, Ely Porat:
Support Optimality and Adaptive Cuckoo Filters. 556-570 - Arne Leitert:
Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time. 571-584 - Logan Pedersen, Haitao Wang:
Algorithms for the Line-Constrained Disk Coverage and Related Problems. 585-598 - Joe Sawada, Aaron Williams:
A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations). 599-612 - Prosenjit Bose, Tyler Tuttle:
Routing on Heavy-Path WSPD-Spanners. 613-626 - Ivor van der Hoog, Mees van de Kerkhof, Marc J. van Kreveld, Maarten Löffler, Frank Staals, Jérôme Urhausen, Jordi L. Vermeulen:
Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance. 627-640 - Marc J. van Kreveld, Bettina Speckmann, Jérôme Urhausen:
Diverse Partitions of Colored Points. 641-654 - Haitao Wang, Yiming Zhao:
Reverse Shortest Path Problem for Unit-Disk Graphs. 655-668
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 2026-08-12 22:54 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
