- Helena Bergold, Winfried Hochstättler, Uwe Mayer:
The Neighborhood Polynomial of Chordal Graphs. WADS 2021: 158-171 - Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
Incomplete Directed Perfect Phylogeny in Linear Time. WADS 2021: 172-185 - Ahmad Biniaz, Anil Maheshwari, Michiel Smid:
Euclidean Maximum Matchings in the Plane - Local to Global. WADS 2021: 186-199 - Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniël Paulusma:
Solving Problems on Generalized Convex Graphs via Mim-Width. WADS 2021: 200-214 - Prosenjit Bose, Darryl Hill, Aurélien Ooms:
Improved Bounds on the Spanning Ratio of the Theta-5-Graph. WADS 2021: 215-228 - Prosenjit Bose, Tyler Tuttle:
Routing on Heavy-Path WSPD-Spanners. WADS 2021: 613-626 - Nick Brettell, Matthew Johnson, Daniël Paulusma:
Computing Weighted Subset Transversals in H-Free Graphs. WADS 2021: 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. WADS 2021: 243-257 - Sergio Cabello, Arun Kumar Das, Sandip Das, Joydeep Mukherjee:
Finding a Largest-Area Triangle in a Terrain in Near-Linear Time. WADS 2021: 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. WADS 2021: 271-285 - Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera:
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs. WADS 2021: 300-314 - Anne Driemel, Ioannis Psarros:
ANN for Time Series Under the Fréchet Distance. WADS 2021: 315-328 - Bartlomiej Dudek, Pawel Gawrychowski, Karol Pokorski:
Strictly In-Place Algorithms for Permuting and Inverting Permutations. WADS 2021: 329-342 - David Eppstein:
A Stronger Lower Bound on Parametric Minimum Spanning Trees. WADS 2021: 343-356 - Leah Epstein, Loay Mualem:
Online Bin Packing of Squares and Cubes. WADS 2021: 357-370 - Thomas Erlebach, Jakob T. Spooner:
Exploration of k-Edge-Deficient Temporal Graphs. WADS 2021: 371-384 - Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit:
Parameterized Complexity of Categorical Clustering with Size Constraints. WADS 2021: 385-398 - Zachary Friggstad, Maryam Mahboub:
Graph Pricing with Limited Supply. WADS 2021: 399-413 - Zachary Friggstad, Ramin Mousavi:
Fair Correlation Clustering with Global and Local Guarantees. WADS 2021: 414-427 - Pawel Gawrychowski, Przemyslaw Uznanski:
Better Distance Labeling for Unweighted Planar Graphs. WADS 2021: 428-441 - Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias:
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. WADS 2021: 442-456 - Joachim Gudmundsson, Yuan Sha:
Algorithms for Radius-Optimally Augmenting Trees in a Metric Space. WADS 2021: 457-470 - Monika Henzinger, Xiaowei Wu:
Upper and Lower Bounds for Fully Retroactive Graph Problems. WADS 2021: 471-484 - 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. WADS 2021: 627-640 - Changyong Hu, Vijay K. Garg:
Characterization of Super-Stable Matchings. WADS 2021: 485-498 - Jeannette C. M. Janssen, Zhiyuan Zhang:
Uniform Embeddings for Robinson Similarity Matrices. WADS 2021: 499-512 - Yash Khanna, Anand Louis, Rameesh Paul:
Independent Sets in Semi-random Hypergraphs. WADS 2021: 528-542 - Shelby Kimmel, R. Teal Witter:
A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs. WADS 2021: 543-555 - Tsvi Kopelowitz, Samuel McCauley, Ely Porat:
Support Optimality and Adaptive Cuckoo Filters. WADS 2021: 556-570