default search action
Paul Seiferth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Alexander Baumann
, Haim Kaplan, Katharina Klost
Dynamic Connectivity in Disk Graphs. Discret. Comput. Geom. 71(1): 214-277 (2024) - 2022
- [c10]Haim Kaplan, Alexander Kauer
Dynamic Connectivity in Disk Graphs. SoCG 2022: 49:1-49:17 - 2021
- [j8]Sariel Har-Peled
Stabbing pairwise intersecting disks by five points. Discret. Math. 344(7): 112403 (2021) - [i11]Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. CoRR abs/2106.14935 (2021) - 2020
- [j7]Haim Kaplan, Wolfgang Mulzer
Reachability Oracles for Directed Transmission Graphs. Algorithmica 82(5): 1259-1276 (2020) - [j6]Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert:
Routing in polygonal domains. Comput. Geom. 87: 101593 (2020) - [j5]Haim Kaplan, Wolfgang Mulzer
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. Discret. Comput. Geom. 64(3): 838-904 (2020)
2010 – 2019
- 2019
- [c9]Haim Kaplan, Katharina Klost, Wolfgang Mulzer
Triangles and Girth in Disk Graphs and Transmission Graphs. ESA 2019: 64:1-64:14 - [i10]Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Triangles and Girth in Disk Graphs and Transmission Graphs. CoRR abs/1907.01980 (2019) - 2018
- [j4]Haim Kaplan, Wolfgang Mulzer
Routing in Unit Disk Graphs. Algorithmica 80(3): 830-848 (2018) - [j3]Matias Korman, Wolfgang Mulzer, André van Renssen
Time-space trade-offs for triangulations and Voronoi diagrams. Comput. Geom. 73: 35-45 (2018) - [j2]Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein:
Improved time-space trade-offs for computing Voronoi diagrams. J. Comput. Geom. 9(1): 191-212 (2018) - [j1]Haim Kaplan, Wolfgang Mulzer
Spanners for Directed Transmission Graphs. SIAM J. Comput. 47(4): 1585-1609 (2018) - [c8]Sariel Har-Peled
Stabbing Pairwise Intersecting Disks by Five Points. ISAAC 2018: 50:1-50:12 - [i9]Sariel Har-Peled
Stabbing pairwise intersecting disks by five points. CoRR abs/1801.03158 (2018) - 2017
- [c7]Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen
Routing in Polygonal Domains. ISAAC 2017: 10:1-10:13 - [c6]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. SODA 2017: 2495-2504 - [c5]Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen
Improved Time-Space Trade-Offs for Computing Voronoi Diagrams. STACS 2017: 9:1-9:14 - [i8]Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, Max Willert:
Routing in Polygons with Holes. CoRR abs/1703.09533 (2017) - [i7]Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein:
Improved Time-Space Trade-offs for Computing Voronoi Diagrams. CoRR abs/1708.00814 (2017) - 2016
- [b1]Paul Seiferth:
Disk Intersection Graphs: Models, Data Structures, and Algorithms. Free University of Berlin, Dahlem, Germany, 2016 - [c4]Haim Kaplan, Wolfgang Mulzer
Routing in Unit Disk Graphs. LATIN 2016: 536-548 - [i6]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Reachability Oracles for Directed Transmission Graphs. CoRR abs/1601.07797 (2016) - [i5]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Spanners for Directed Transmission Graphs. CoRR abs/1601.07798 (2016) - [i4]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. CoRR abs/1604.03654 (2016) - 2015
- [c3]Haim Kaplan, Wolfgang Mulzer
Spanners and Reachability Oracles for Directed Transmission Graphs. SoCG 2015: 156-170 - [c2]Wolfgang Mulzer
Approximate k-flat Nearest Neighbor Search. STOC 2015: 783-792 - [c1]Matias Korman, Wolfgang Mulzer
Time-Space Trade-offs for Triangulations and Voronoi Diagrams. WADS 2015: 482-494 - [i3]Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein:
Time-Space Trade-offs for Triangulations and Voronoi Diagrams. CoRR abs/1507.03403 (2015) - [i2]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Routing in Unit Disk Graphs. CoRR abs/1510.01072 (2015) - 2014
- [i1]Wolfgang Mulzer, Huy L. Nguyen, Paul Seiferth, Yannik Stein:
Approximate k-flat Nearest Neighbor Search. CoRR abs/1411.1519 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: