No. Title Author Year
1 Computational Complexity of the α-Ham-Sandwich Problem Chiu, Man-Kwun et al. 2020
2 Long Alternating Paths Exist Mulzer, Wolfgang et al. 2020
3 Maximum Matchings in Geometric Intersection Graphs Bonnet, Édouard et al. 2020
4 No-Dimensional Tverberg Theorems and Algorithms Choudhary, Aruni et al. 2020
5 Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead Agarwal, Pankaj K. et al. 2019
6 On the Stretch Factor of Polygonal Chains Chen, Ke et al. 2019
7 Triangles and Girth in Disk Graphs and Transmission Graphs Kaplan, Haim et al. 2019
8 Approximate Minimum-Weight Matching with Outliers Under Translation Agarwal, Pankaj K. et al. 2018
9 Asymmetric Convex Intersection Testing Barba, Luis et al. 2018
10 Stabbing Pairwise Intersecting Disks by Five Points Har-Peled, Sariel et al. 2018
11 Faster Algorithms for Growing Prioritized Disks and Rectangles Ahn, Hee-Kap et al. 2017
12 Improved Time-Space Trade-Offs for Computing Voronoi Diagrams Banyassady, Bahareh et al. 2017
13 Routing in Polygonal Domains Banyassady, Bahareh et al. 2017
14 Approximability of the Discrete Fréchet Distance Bringmann, Karl et al. 2015
15 Computational Aspects of the Colorful Carathéodory Theorem Mulzer, Wolfgang et al. 2015
16 Spanners and Reachability Oracles for Directed Transmission Graphs Kaplan, Haim et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 16

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI