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

1 |
Dynamic Connectivity in Disk Graphs |
Kaplan, Haim et al. |
2022 |

2 |
Long Plane Trees |
Cabello, Sergio et al. |
2022 |

3 |
Nearest-Neighbor Decompositions of Drawings |
Cleve, Jonas et al. |
2022 |

4 |
Well-Separation and Hyperplane Transversals in High Dimensions |
Bergold, Helena et al. |
2022 |

5 |
Compact Routing in Unit Disk Graphs |
Mulzer, Wolfgang et al. |
2020 |

6 |
Computational Complexity of the α-Ham-Sandwich Problem |
Chiu, Man-Kwun et al. |
2020 |

7 |
Long Alternating Paths Exist |
Mulzer, Wolfgang et al. |
2020 |

8 |
Maximum Matchings in Geometric Intersection Graphs |
Bonnet, Édouard et al. |
2020 |

9 |
No-Dimensional Tverberg Theorems and Algorithms |
Choudhary, Aruni et al. |
2020 |

10 |
Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead |
Agarwal, Pankaj K. et al. |
2019 |

11 |
On the Stretch Factor of Polygonal Chains |
Chen, Ke et al. |
2019 |

12 |
Triangles and Girth in Disk Graphs and Transmission Graphs |
Kaplan, Haim et al. |
2019 |

13 |
Approximate Minimum-Weight Matching with Outliers Under Translation |
Agarwal, Pankaj K. et al. |
2018 |

14 |
Asymmetric Convex Intersection Testing |
Barba, Luis et al. |
2018 |

15 |
Stabbing Pairwise Intersecting Disks by Five Points |
Har-Peled, Sariel et al. |
2018 |

16 |
Faster Algorithms for Growing Prioritized Disks and Rectangles |
Ahn, Hee-Kap et al. |
2017 |

17 |
Improved Time-Space Trade-Offs for Computing Voronoi Diagrams |
Banyassady, Bahareh et al. |
2017 |

18 |
Routing in Polygonal Domains |
Banyassady, Bahareh et al. |
2017 |

19 |
Approximability of the Discrete Fréchet Distance |
Bringmann, Karl et al. |
2015 |

20 |
Computational Aspects of the Colorful Carathéodory Theorem |
Mulzer, Wolfgang et al. |
2015 |

21 |
Spanners and Reachability Oracles for Directed Transmission Graphs |
Kaplan, Haim et al. |
2015 |