| No. |
Title |
Author |
Year |
| 1 |
Conditional Lower Bounds for Dynamic Geometric Measure Problems |
Dallant, Justin et al. |
2022 |
| 2 |
External-Memory Dictionaries with Worst-Case Update Cost |
Das, Rathish et al. |
2022 |
| 3 |
How Fast Can We Play Tetris Greedily with Rectangular Pieces? |
Dallant, Justin et al. |
2022 |
| 4 |
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility |
Cardinal, Jean et al. |
2021 |
| 5 |
Scalable Data Structures (Dagstuhl Seminar 21071) |
Brodal, Gerth Stølting et al. |
2021 |
| 6 |
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model |
Aronov, Boris et al. |
2021 |
| 7 |
Worst-Case Efficient Dynamic Geometric Independent Set |
Cardinal, Jean et al. |
2021 |
| 8 |
External Memory Planar Point Location with Fast Updates |
Iacono, John et al. |
2019 |
| 9 |
External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms |
Iacono, John et al. |
2019 |
| 10 |
Dynamic Trees with Almost-Optimal Access Cost |
Golin, Mordecai et al. |
2018 |
| 11 |
Subquadratic Encodings for Point Configurations |
Cardinal, Jean et al. |
2018 |
| 12 |
Subquadratic Algorithms for Algebraic Generalizations of 3SUM |
Barba, Luis et al. |
2017 |
| 13 |
Incremental Voronoi diagrams |
Allen, Sarah R. et al. |
2016 |
| 14 |
Solving k-SUM Using Few Linear Queries |
Cardinal, Jean et al. |
2016 |
| 15 |
Mergeable Dictionaries |
Iacono, John et al. |
2010 |
