default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWolfgang Mulzer
Wolfgang Johann Heinrich Mulzer
Person information
- affiliation: Free University of Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j51]Alexander Baumann
, Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. Discret. Comput. Geom. 71(1): 214-277 (2024)- [c58]Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. SOSA 2024: 299-305 - [e1]Wolfgang Mulzer, Jeff M. Phillips:
40th International Symposium on Computational Geometry, SoCG 2024, June 11-14, 2024, Athens, Greece. LIPIcs 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-316-4 [contents] - [i65]Katharina Klost, Wolfgang Mulzer:
Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs. CoRR abs/2405.01180 (2024) - 2023
- [j50]Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. Discret. Comput. Geom. 70(3): 550-579 (2023) - [c57]Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber:
Flipping Plane Spanning Paths. WALCOM 2023: 49-60 - [i64]Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. CoRR abs/2306.15338 (2023) - 2022
- [j49]Aruni Choudhary, Wolfgang Mulzer:
No-Dimensional Tverberg Theorems and Algorithms. Discret. Comput. Geom. 68(4): 964-996 (2022) - [j48]Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer:
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead. ACM Trans. Algorithms 18(3): 26:1-26:27 (2022) - [c56]Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec:
Long Plane Trees. SoCG 2022: 23:1-23:17 - [c55]Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. SoCG 2022: 49:1-49:17 - [c54]Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Nicolas El Maalouly, Johannes Obenaus, Rosna Paul, Meghana M. Reddy, Birgit Vogtenhuber, Alexandra Weinberger:
Compatible Spanning Trees in Simple Drawings of Kn. GD 2022: 16-24 - [c53]Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer, Patrick Schnider:
Well-Separation and Hyperplane Transversals in High Dimensions. SWAT 2022: 16:1-16:14 - [c52]Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer, Daniel Perz:
Nearest-Neighbor Decompositions of Drawings. SWAT 2022: 21:1-21:16 - [i63]Oswin Aichholzer, Kristin Knorr, Maarten Löffler, Zuzana Masárová, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber:
Flipping Plane Spanning Paths. CoRR abs/2202.10831 (2022) - [i62]Michaela Borzechowski, Wolfgang Mulzer:
Unique Sink Orientations of Grids is in Unique End of Potential Line. CoRR abs/2209.02101 (2022) - [i61]Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer, Daniel Perz:
Nearest-Neighbor Decompositions of Drawings. CoRR abs/2209.02103 (2022) - [i60]Helena Bergold, Daniel Bertschinger, Nicolas Grelier, Wolfgang Mulzer, Patrick Schnider:
Well-Separation and Hyperplane Transversals in High Dimensions. CoRR abs/2209.02319 (2022) - 2021
- [j47]Sergio Cabello, Wolfgang Mulzer:
Minimum cuts in geometric intersection graphs. Comput. Geom. 94: 101720 (2021) - [j46]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. Discret. Math. 344(7): 112403 (2021) - [j45]Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth:
On the Stretch Factor of Polygonal Chains. SIAM J. Discret. Math. 35(3): 1592-1614 (2021) - [i59]Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec:
Long plane trees. CoRR abs/2101.00445 (2021) - [i58]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
- [j44]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Reachability Oracles for Directed Transmission Graphs. Algorithmica 82(5): 1259-1276 (2020) - [j43]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) - [j42]Jonas Cleve, Wolfgang Mulzer:
Combinatorics of beacon-based routing in three dimensions. Comput. Geom. 91: 101667 (2020) - [j41]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. Discret. Comput. Geom. 64(3): 838-904 (2020) - [j40]Wolfgang Mulzer, Natalia Shenkman:
A constructive proof of a concentration bound for real-valued random variables. Inf. Process. Lett. 158: 105942 (2020) - [j39]Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24(4): 551-572 (2020) - [j38]Michiel Smid, Anil Maheshwari, Wolfgang Mulzer:
A simple randomized $O(n \log n)$-time closest-pair algorithm in doubling metrics. J. Comput. Geom. 11(1): 507-524 (2020) - [j37]Bahareh Banyassady, Luis Barba, Wolfgang Mulzer:
Time-space trade-offs for computing Euclidean minimum spanning trees. J. Comput. Geom. 11(1): 525-547 (2020) - [c51]Aruni Choudhary, Wolfgang Mulzer:
No-Dimensional Tverberg Theorems and Algorithms. SoCG 2020: 31:1-31:17 - [c50]Wolfgang Mulzer, Pavel Valtr:
Long Alternating Paths Exist. SoCG 2020: 57:1-57:16 - [c49]Man-Kwun Chiu, Aruni Choudhary, Wolfgang Mulzer:
Computational Complexity of the α-Ham-Sandwich Problem. ICALP 2020: 31:1-31:18 - [c48]Wolfgang Mulzer, Max Willert:
Compact Routing in Unit Disk Graphs. ISAAC 2020: 16:1-16:14 - [c47]Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. STACS 2020: 31:1-31:17 - [c46]Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Max Willert:
Routing in Histograms. WALCOM 2020: 43-54 - [i57]Wolfgang Mulzer, Johannes Obenaus:
The Tree Stabbing Number is not Monotone. CoRR abs/2002.08198 (2020) - [i56]Wolfgang Mulzer, Max Willert:
Routing in Unit Disk Graphs without Dynamic Headers. CoRR abs/2002.10841 (2020) - [i55]Man-Kwun Chiu, Aruni Choudhary, Wolfgang Mulzer:
Computational Complexity of the α-Ham-Sandwich Problem. CoRR abs/2003.09266 (2020) - [i54]Wolfgang Mulzer, Pavel Valtr:
Long Alternating Paths Exist. CoRR abs/2003.13291 (2020) - [i53]Anil Maheshwari, Wolfgang Mulzer, Michiel H. M. Smid:
A Simple Randomized O(n log n)-Time Closest-Pair Algorithm in Doubling Metrics. CoRR abs/2004.05883 (2020) - [i52]Sergio Cabello, Wolfgang Mulzer:
Minimum Cuts in Geometric Intersection Graphs. CoRR abs/2005.00858 (2020)
2010 – 2019
- 2019
- [j36]Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron:
Faster algorithms for growing prioritized disks and rectangles. Comput. Geom. 80: 23-39 (2019) - [j35]Matias Korman, Wolfgang Mulzer:
Special Issue on the 34th European Workshop on Computational Geometry, Guest Editors' Foreword. Comput. Geom. 84: 1-2 (2019) - [j34]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit K. Bose, Stephane Durocher, Wolfgang Mulzer:
A time-space trade-off for computing the k-visibility region of a point in a polygon. Theor. Comput. Sci. 789: 13-21 (2019) - [c45]Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer:
Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead. SoCG 2019: 26:1-26:15 - [c44]Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Triangles and Girth in Disk Graphs and Transmission Graphs. ESA 2019: 64:1-64:14 - [c43]Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. GD 2019: 101-113 - [c42]Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth:
On the Stretch Factor of Polygonal Chains. MFCS 2019: 56:1-56:14 - [c41]Jonas Cleve, Wolfgang Mulzer:
An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model. SEA² 2019: 317-331 - [c40]Luis Barba, Wolfgang Mulzer:
Asymmetric Convex Intersection Testing. SOSA 2019: 9:1-9:14 - [i51]Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Max Willert:
Routing in Histograms. CoRR abs/1902.06599 (2019) - [i50]Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer:
Dynamic Maintenance of the Lower Envelope of Pseudo-Lines. CoRR abs/1902.09565 (2019) - [i49]Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, Wolfgang Mulzer:
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead. CoRR abs/1903.10943 (2019) - [i48]Jonas Cleve, Wolfgang Mulzer:
An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model. CoRR abs/1904.03050 (2019) - [i47]Wolfgang Mulzer, Natalia Shenkman:
A Constructive Proof of a Concentration Bound for Real-Valued Random Variables. CoRR abs/1905.01172 (2019) - [i46]Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, Csaba D. Tóth:
On the Stretch Factor of Polygonal Chains. CoRR abs/1906.10217 (2019) - [i45]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) - [i44]Aruni Choudhary, Wolfgang Mulzer:
No-dimensional Tverberg Theorems and Algorithms. CoRR abs/1907.04284 (2019) - [i43]Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl:
Minimal Representations of Order Types by Geometric Graphs. CoRR abs/1908.05124 (2019) - [i42]Édouard Bonnet, Sergio Cabello, Wolfgang Mulzer:
Maximum Matchings in Geometric Intersection Graphs. CoRR abs/1910.02123 (2019) - 2018
- [j33]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Routing in Unit Disk Graphs. Algorithmica 80(3): 830-848 (2018) - [j32]Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, Birgit Vogtenhuber:
The dual diameter of triangulations. Comput. Geom. 68: 243-252 (2018) - [j31]Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein:
Time-space trade-offs for triangulations and Voronoi diagrams. Comput. Geom. 73: 35-45 (2018) - [j30]Wolfgang Mulzer, Yannik Stein:
Computational Aspects of the Colorful Carathéodory Theorem. Discret. Comput. Geom. 60(3): 720-755 (2018) - [j29]Wolfgang Mulzer:
Five Proofs of Chernoff's Bound with Applications. Bull. EATCS 124 (2018) - [j28]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) - [j27]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Spanners for Directed Transmission Graphs. SIAM J. Comput. 47(4): 1585-1609 (2018) - [j26]Bahareh Banyassady, Matias Korman, Wolfgang Mulzer:
Computational Geometry Column 67. SIGACT News 49(2): 77-94 (2018) - [c39]Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao:
Approximate Minimum-Weight Matching with Outliers Under Translation. ISAAC 2018: 26:1-26:13 - [c38]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing Pairwise Intersecting Disks by Five Points. ISAAC 2018: 50:1-50:12 - [c37]Bahareh Banyassady, Luis Barba, Wolfgang Mulzer:
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees. LATIN 2018: 108-119 - [c36]Jonas Cleve, Wolfgang Mulzer:
Combinatorics of Beacon-Based Routing in Three Dimensions. LATIN 2018: 346-360 - [c35]Katharina Klost, Wolfgang Mulzer:
Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors. LATIN 2018: 683-696 - [i41]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. CoRR abs/1801.03158 (2018) - [i40]Wolfgang Mulzer:
Five Proofs of Chernoff's Bound with Applications. CoRR abs/1801.03365 (2018) - [i39]Bahareh Banyassady, Matias Korman, Wolfgang Mulzer:
Geometric Algorithms with Limited Workspace: A Survey. CoRR abs/1806.05868 (2018) - [i38]Luis Barba, Wolfgang Mulzer:
Asymmetric Convex Intersection Testing. CoRR abs/1808.06460 (2018) - [i37]Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao:
Approximate Minimum-Weight Matching with Outliers under Translation. CoRR abs/1810.10466 (2018) - 2017
- [j25]Pat Morin, Wolfgang Mulzer, Tommy Reddad:
Encoding Arguments. ACM Comput. Surv. 50(3): 46:1-46:36 (2017) - [j24]Kevin Buchin, Maike Buchin, Wouter Meulemans, Wolfgang Mulzer:
Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance. Discret. Comput. Geom. 58(1): 180-216 (2017) - [j23]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein:
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. Int. J. Comput. Geom. Appl. 27(1-2): 57-84 (2017) - [c34]Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron:
Faster Algorithms for Growing Prioritized Disks and Rectangles. ISAAC 2017: 3:1-3:13 - [c33]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. ISAAC 2017: 10:1-10:13 - [c32]Frédéric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles, Yannik Stein:
The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications. SODA 2017: 1342-1351 - [c31]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 - [c30]Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein:
Improved Time-Space Trade-Offs for Computing Voronoi Diagrams. STACS 2017: 9:1-9:14 - [c29]Marcel Ehrhardt, Wolfgang Mulzer:
Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space. WADS 2017: 361-372 - [c28]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer:
Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon. WALCOM 2017: 308-319 - [i36]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) - [i35]Hee-Kap Ahn, Sang Won Bae, Jong Min Choi, Matias Korman, Wolfgang Mulzer, Eunjin Oh, Ji-won Park, André van Renssen, Antoine Vigneron:
Faster Algorithms for Growing Prioritized Disks and Rectangles. CoRR abs/1704.07580 (2017) - [i34]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) - [i33]Bahareh Banyassady, Luis Barba, Wolfgang Mulzer:
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees. CoRR abs/1712.06431 (2017) - [i32]Jonas Cleve, Wolfgang Mulzer:
Combinatorics of Beacon-based Routing in Three Dimensions. CoRR abs/1712.07416 (2017) - [i31]Katharina Klost, Wolfgang Mulzer:
Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors. CoRR abs/1712.07559 (2017) - 2016
- [j22]Kevin Buchin, Maike Buchin, Rolf van Leusden, Wouter Meulemans, Wolfgang Mulzer:
Computing the Fréchet Distance with a Retractable Leash. Discret. Comput. Geom. 56(2): 315-336 (2016) - [j21]Karl Bringmann, Wolfgang Mulzer:
Approximability of the discrete Fréchet distance. J. Comput. Geom. 7(2): 46-76 (2016) - [c27]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Routing in Unit Disk Graphs. LATIN 2016: 536-548 - [i30]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Reachability Oracles for Directed Transmission Graphs. CoRR abs/1601.07797 (2016) - [i29]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Spanners for Directed Transmission Graphs. CoRR abs/1601.07798 (2016) - [i28]Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer:
Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon. CoRR abs/1603.02853 (2016) - [i27]Pat Morin, Wolfgang Mulzer, Tommy Reddad:
Encoding Arguments. CoRR abs/1603.08777 (2016) - [i26]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) - [i25]Frédéric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles, Yannik Stein:
The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications. CoRR abs/1608.01921 (2016) - 2015
- [j20]Bernard Chazelle, Wolfgang Mulzer:
Data Structures on Event Graphs. Algorithmica 71(4): 1007-1020 (2015) - [j19]Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz:
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete. Discret. Comput. Geom. 54(2): 368-389 (2015) - [c26]Wolfgang Mulzer, Yannik Stein:
Computational Aspects of the Colorful Carathéodory Theorem. SoCG 2015: 44-58 - [c25]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Spanners and Reachability Oracles for Directed Transmission Graphs. SoCG 2015: 156-170 - [c24]Karl Bringmann, Wolfgang Mulzer:
Approximability of the Discrete Fréchet Distance. SoCG 2015: 739-753 - [c23]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein:
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. ISAAC 2015: 505-516 - [c22]Wolfgang Mulzer, Huy L. Nguyên, Paul Seiferth, Yannik Stein:
Approximate k-flat Nearest Neighbor Search. STOC 2015: 783-792 - [c21]Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein:
Time-Space Trade-offs for Triangulations and Voronoi Diagrams. WADS 2015: 482-494 - [i24]Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, Birgit Vogtenhuber:
The Dual Diameter of Triangulations. CoRR abs/1503.08518 (2015) - [i23]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) - [i22]Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, Manuel Wettstein:
An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. CoRR abs/1507.08080 (2015) - [i21]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Routing in Unit Disk Graphs. CoRR abs/1510.01072 (2015) - 2014
- [j18]