Follow
Paul Seiferth
Paul Seiferth
Verified email at inf.fu-berlin.de - Homepage
Title
Cited by
Cited by
Year
Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
H Kaplan, W Mulzer, L Roditty, P Seiferth, M Sharir
Discrete & Computational Geometry 64, 838-904, 2020
942020
Routing in unit disk graphs
H Kaplan, W Mulzer, L Roditty, P Seiferth
Algorithmica 80, 830-848, 2018
332018
Stabbing pairwise intersecting disks by five points
S Har-Peled, H Kaplan, W Mulzer, L Roditty, P Seiferth, M Sharir, M Willert
Discrete Mathematics 344 (7), 112403, 2021
202021
Spanners and reachability oracles for directed transmission graphs
H Kaplan, W Mulzer, L Roditty, P Seiferth
31st International Symposium on Computational Geometry (SoCG 2015), 2015
20*2015
Time–space trade-offs for triangulations and Voronoi diagrams
M Korman, W Mulzer, A Van Renssen, M Roeloffzen, P Seiferth, Y Stein
Computational Geometry 73, 35-45, 2018
152018
Improved Time-Space Trade-Offs for Computing Voronoi Diagrams
B Banyassady, M Korman, W Mulzer, A van Renssen, M Roeloffzen, ...
LIPIcs-Leibniz International Proceedings in Informatics 66, 2017
122017
Approximate k-flat nearest neighbor search
W Mulzer, HL Nguyên, P Seiferth, Y Stein
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of …, 2015
92015
Triangles and girth in disk graphs and transmission graphs
H Kaplan, K Klost, W Mulzer, L Roditty, P Seiferth, M Sharir
arXiv preprint arXiv:1907.01980, 2019
82019
Dynamic connectivity in disk graphs
H Kaplan, A Kauer, K Klost, K Knorr, W Mulzer, L Roditty, P Seiferth
arXiv preprint arXiv:2106.14935, 2021
72021
Routing in polygonal domains
B Banyassady, MK Chiu, M Korman, W Mulzer, A Van Renssen, ...
Computational Geometry 87, 101593, 2020
72020
Disk Intersection Graphs: Models, Data Structures, and Algorithms
P Seiferth
Dissertation, Berlin, Freie Universität Berlin, 2016, 2016
62016
Reachability oracles for directed transmission graphs
H Kaplan, W Mulzer, L Roditty, P Seiferth
Algorithmica 82 (5), 1259-1276, 2020
32020
Dynamic connectivity for unit disk graphs
H Kaplan, W Mulzer, L Roditty, P Seiferth
32nd European Workshop on Computational Geometry (Lugano 2016), 183-186, 2016
32016
Finding triangles and computing the girth in disk graphs
H Kaplan, W Mulzer, L Roditty, P Seiferth
Proc. 33rd European Workshop Comput. Geom.(EWCG), 205-208, 2017
12017
Dynamic Connectivity in Disk Graphs
A Baumann, H Kaplan, K Klost, K Knorr, W Mulzer, L Roditty, P Seiferth
Discrete & Computational Geometry, 1-64, 2024
2024
Routing in Simple Polygons
M Korman, W Mulzer, A van Renssen, M Roeloffzen, P Seiferth, Y Stein, ...
33rd European Workshop on Computational Geometry: EuroCG 2017, 17-20, 2017
2017
Computational Aspects of Triangulations with Bounded Dilation
W Mulzer, P Seiferth
Efficient Spanner Construction for Directed Transmission Graphs
H Kaplan, W Mulzer, L Roditty, P Seiferth
Reachability Oracles for Disk Transmission Graphs
H Kaplan, W Mulzer, L Roditty, P Seiferth
The system can't perform the operation now. Try again later.
Articles 1–19