| Euclidean Maximum Matchings in the Plane—Local to Global
|
2021 |
Biniaz, Ahmad |
| Strictly In-Place Algorithms for Permuting and Inverting Permutations
|
2021 |
Dudek, Barttomiej |
| Parameterized Complexity of Categorical Clustering with Size Constraints
|
2021 |
Fomin, Fedor V. |
| Graph Pricing with Limited Supply
|
2021 |
Friggstad, Zachary |
| Characterization of Super-Stable Matchings
|
2021 |
Hu, Changyong |
| Upper and Lower Bounds for Fully Retroactive Graph Problems
|
2021 |
Henzinger, Monika |
| 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 |
| The Neighborhood Polynomial of Chordal Graphs
|
2021 |
Bergold, Helena |
| Solving Problems on Generalized Convex Graphs via Mim-Width
|
2021 |
Bonomo-Braberman, Flavia |
| An APTAS for Bin Packing with Clique-Graph Conflicts
|
2021 |
Doron-Arad, Tlan |
| Finding a Largest-Area Triangle in a Terrain in Near-Linear Time
|
2021 |
Cabello, Sergio |
| Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs
|
2021 |
Dragan, Feodor F. |
| A Stronger Lower Bound on Parametric Minimum Spanning Trees
|
2021 |
Eppstein, David |
| Online Bin Packing of Squares and Cubes
|
2021 |
Epstein, Leah |
| Exploration of k&-Edge-Deficient Temporal Graphs
|
2021 |
Erlebach, Thomas |
| Algorithms for Radius-Optimally Augmenting Trees in a Metric Space
|
2021 |
Gudmundsson, Joachim |
| Particle-Based Assembly Using Precise Global Control
|
2021 |
Keller, Jakob |
Tag hinzufügen