No. |
Title |
Author |
Year |
---|

1 |
Rolling Polyhedra on Tessellations |
Baes, Akira et al. |
2022 |

2 |
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region |
Kostitsyna, Irina et al. |
2018 |

3 |
Dynamic Trees with Almost-Optimal Access Cost |
Golin, Mordecai et al. |
2018 |

4 |
Subquadratic Encodings for Point Configurations |
Cardinal, Jean et al. |
2018 |

5 |
Self-Approaching Paths in Simple Polygons |
Bose, Prosenjit et al. |
2017 |

6 |
Subquadratic Algorithms for Algebraic Generalizations of 3SUM |
Barba, Luis et al. |
2017 |

7 |
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino |
Langerman, Stefan et al. |
2016 |

8 |
Incremental Voronoi diagrams |
Allen, Sarah R. et al. |
2016 |

9 |
Threes!, Fives, 1024!, and 2048 are Hard |
Langerman, Stefan et al. |
2016 |

10 |
Space-Time Trade-offs for Stack-Based Algorithms |
Barba, Luis et al. |
2013 |