| 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 |
| Reachability Problems for Transmission Graphs
|
2021 |
An, Shinwoo |
| On Minimum Generalized Manhattan Connections
|
2021 |
Antoniadis, Antonios |
| Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations
|
2021 |
Bercea, Toana O. |
| HalftimeHash: Modern Hashing Without 64-Bit Multipliers or Finite Fields
|
2021 |
Apple, Jim |
| Improved Bounds on the Spanning Ratio of the Theta-5-Graph
|
2021 |
Bose, Prosenjit |
| Computing Weighted Subset Transversals in H-Free Graphs
|
2021 |
Brettell, Nick |
| How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
|
2021 |
Goodrich, Michael T. |
| A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs
|
2021 |
Kimmel, Shelby |
| Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance
|
2021 |
Hoog, Ivor van der |
| 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 |
Tag hinzufügen