معرفی
Paul Seiferth is affiliated with the Department of Computer Science at Freie Universität Berlin. His research focuses on computational geometry, algorithms, data structures, and graph theory. He has contributed to topics like Voronoi diagrams, dynamic planar graphs, unit disk routing, and spanner construction. His work emphasizes algorithmic efficiency, time-space trade-offs, and geometric data structures.
Education:
- PhD (2012–2016), Freie Universität Berlin
- Master's (2010–2012), Freie Universität Berlin
Research Interests:
His research addresses fundamental problems in computational geometry and graph theory, with applications to wireless networks and geometric algorithms. Key themes include dynamic data structures for proximity problems (e.g., Voronoi diagrams), routing in unit disk graphs, and efficient spanner constructions for directed transmission graphs.
Key Contributions:
His work on time-space trade-offs for Voronoi diagrams and dynamic planar Voronoi diagrams has advanced algorithmic techniques for geometric problems. He also developed efficient routing schemes for unit disk graphs and reachability oracles for transmission graphs, balancing theoretical guarantees with practical efficiency.
Teaching:
He teaches ProInformatik I: Logik und Diskrete Mathematik.
Labs/Teams:
Associated with the AG Theoretische Informatik research group at Freie Universität Berlin.
