| 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 |
| 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 |
Tag hinzufügen