Segui
Paul Seiferth
Paul Seiferth
Email verificata su inf.fu-berlin.de - Home page
Titolo
Citata da
Citata da
Anno
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 (3), 838-904, 2020
752020
Routing in unit disk graphs
H Kaplan, W Mulzer, L Roditty, P Seiferth
Algorithmica 80 (3), 830-848, 2018
262018
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
16*2015
Time-Space Trade-offs for Triangulations and Voronoi Diagrams
M Roeloffzen, P Seiferth, Y Stein
Algorithms and Data Structures: 14th International Symposium, WADS 2015 …, 2015
15*2015
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
142021
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
Routing in polygonal domains
B Banyassady, MK Chiu, M Korman, W Mulzer, A Van Renssen, ...
Computational Geometry 87, 101593, 2020
72020
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
72015
Disk Intersection Graphs: Models, Data Structures, and Algorithms
P Seiferth
Dissertation, Berlin, Freie Universität Berlin, 2016, 2016
62016
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
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
22019
Reachability oracles for directed transmission graphs
H Kaplan, W Mulzer, L Roditty, P Seiferth
Algorithmica 82 (5), 1259-1276, 2020
12020
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
H Kaplan, A Kauer, K Klost, K Knorr, W Mulzer, L Roditty, P Seiferth
arXiv preprint arXiv:2106.14935, 2021
2021
Routing in Simple Polygons
M Korman, W Mulzer, A van Renssen, M Roeloffzen, P Seiferth, Y Stein, ...
Proceedings of the 33rd European Workshop on Computational Geometry (EuroCG …, 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
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–18