| Pattern Matching in Doubling Spaces
|
2021 |
Allair, Corentin |
| Generalized Disk Graphs
|
2021 |
Arnbörsson, Ivar Marrow |
| A 4-Approximation of the 2π/3-MST
|
2021 |
Ashur, Stav |
| Incomplete Directed Perfect Phylogeny in Linear Time
|
2021 |
Bernardini, Giulia |
| Computing the Frechet Distance Between Uncertain Curves in One Dimension
|
2021 |
Buchin, Kevin |
| ANN for Time Series Under the Frechet Distance
|
2021 |
Driemel, Anne |
| Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees
|
2021 |
Chaplick, Steven |
| Better Distance Labeling for Unweighted Planar Graphsans
|
2021 |
Gawrychowski, Pawel |
| Fair Correlation Clustering with Global and Local Guarantees
|
2021 |
Friggstad, Zachary |
| Uniform Embeddings for Robinson Similarity Matrices
|
2021 |
Janssen, Jeannette |
| Independent Sets in Semi-random Hypergraphs
|
2021 |
Khanna, Yash |
| Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time
|
2021 |
Leitert, Arne |
| A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations)
|
2021 |
Sawada, J. |
| Algorithms for the Line-Constrained Disk Coverage and Related Problems
|
2021 |
Pedersen, Logan |
| Routing on Heavy-Path WSPD-Spanners
|
2021 |
Bose, Prosenjit |
| Reverse Shortest Path Problem for Unit-Disk Graphs
|
2021 |
Wang, Haitao |
| On the Spanning and Routing Ratios of the Directed O6-Graph
|
2021 |
Akitaya, Hugo A. |
| The Minimum Moving Spanning Tree Problem
|
2021 |
Akitaya, Hugo A. |
| Online Makespan Minimization with Budgeted Uncertainty
|
2021 |
Albers, Susanne |
| Scheduling with Testing on Multiple Identical Parallel Machines
|
2021 |
Albers, Susanne |
Tag hinzufügen