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]Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz:
Reprint of: Memory-constrained algorithms for simple polygons. Comput. Geom. 47(3): 469-479 (2014) - [j17]Wolfgang Mulzer, Yannik Stein:
Algorithms for Tolerant Tverberg Partitions. Int. J. Comput. Geom. Appl. 24(4): 261-274 (2014) - [j16]Maarten Löffler, Wolfgang Mulzer:
Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition. J. Comput. Geom. 5(1): 1-13 (2014) - [j15]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls. SIAM J. Comput. 43(2): 617-653 (2014) - [c20]Yves Brise, Kevin Buchin, Dustin Eversmann, Michael Hoffmann, Wolfgang Mulzer:
Interference Minimization in Asymmetric Sensor Networks. ALGOSENSORS 2014: 136-151 - [c19]Sebastian Kürten, Wolfgang Mulzer:
LiveCG: an Interactive Visualization Environment for Computational Geometry. SoCG 2014: 86 - [c18]Kevin Buchin, Maike Buchin, Wouter Meulemans, Wolfgang Mulzer:
Four Soviets Walk the Dog - with an Application to Alt's Conjecture. SODA 2014: 1399-1413 - [i20]Yves Brise, Kevin Buchin, Dustin Eversmann, Michael Hoffmann, Wolfgang Mulzer:
Interference Minimization in Asymmetric Sensor Networks. CoRR abs/1406.7753 (2014) - [i19]Wolfgang Mulzer, Huy L. Nguyen, Paul Seiferth, Yannik Stein:
Approximate k-flat Nearest Neighbor Search. CoRR abs/1411.1519 (2014) - [i18]Wolfgang Mulzer, Yannik Stein:
Computational Aspects of the Colorful Caratheodory Theorem. CoRR abs/1412.3347 (2014) - 2013
- [j14]Esther Ezra, Wolfgang Mulzer:
Convex hull of points lying on lines in time after preprocessing. Comput. Geom. 46(4): 417-434 (2013) - [j13]Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz:
Memory-constrained algorithms for simple polygons. Comput. Geom. 46(8): 959-969 (2013) - [j12]Wolfgang Mulzer, Daniel Werner:
Approximating Tverberg Points in Linear Time for Any Fixed Dimension. Discret. Comput. Geom. 50(2): 520-535 (2013) - [c17]Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz:
Flip Distance between Triangulations of a Simple Polygon is NP-Complete. ESA 2013: 13-24 - [c16]Kevin Buchin, Maike Buchin, Rolf van Leusden, Wouter Meulemans, Wolfgang Mulzer:
Computing the Fréchet Distance with a Retractable Leash. ESA 2013: 241-252 - [c15]Kevin Buchin, Olivier Devillers, Wolfgang Mulzer, Okke Schrijvers, Jonathan Richard Shewchuk:
Vertex Deletion for 3D Delaunay Triangulations. ESA 2013: 253-264 - [c14]Wolfgang Mulzer, Yannik Stein:
Algorithms for Tolerated Tverberg Partitions. ISAAC 2013: 295-305 - [c13]Maarten Löffler, Wolfgang Mulzer:
Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition. WADS 2013: 487-498 - [i17]Maarten Löffler, Wolfgang Mulzer:
Unions of Onions. CoRR abs/1302.5328 (2013) - [i16]Wolfgang Mulzer, Yannik Stein:
Algorithms for Tolerated Tverberg Partitions. CoRR abs/1306.3452 (2013) - [i15]Kevin Buchin, Maike Buchin, Rolf van Leusden, Wouter Meulemans, Wolfgang Mulzer:
Computing the Fréchet Distance with a Retractable Leash. CoRR abs/1306.5527 (2013) - 2012
- [j11]John Iacono, Wolfgang Mulzer:
A Static Optimality Transformation with Applications to Planar Point Location. Int. J. Comput. Geom. Appl. 22(4): 327-340 (2012) - [j10]Maarten Löffler, Wolfgang Mulzer:
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent. SIAM J. Comput. 41(4): 941-974 (2012) - [c12]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving algorithms for coordinate-wise maxima. SCG 2012: 277-286 - [c11]Wolfgang Mulzer, Daniel Werner:
Approximating Tverberg points in linear time for any fixed dimension. SCG 2012: 303-310 - [c10]Bernard Chazelle, Wolfgang Mulzer:
Data Structures on Event Graphs. ESA 2012: 313-324 - [i14]Wolfgang Mulzer, Daniel Werner:
A Lower Bound for Shallow Partitions. CoRR abs/1201.2267 (2012) - [i13]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving Algorithms for Coordinate-wise Maxima. CoRR abs/1204.0824 (2012) - [i12]Maarten Löffler, Wolfgang Mulzer:
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent. CoRR abs/1205.4738 (2012) - [i11]Bernard Chazelle, Wolfgang Mulzer:
Data Structures on Event Graphs. CoRR abs/1206.6193 (2012) - [i10]Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz:
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete. CoRR abs/1209.0579 (2012) - [i9]Kevin Buchin, Maike Buchin, Wouter Meulemans, Wolfgang Mulzer:
Four Soviets Walk the Dog - with an Application to Alt's Conjecture. CoRR abs/1209.4403 (2012) - [i8]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls. CoRR abs/1211.0952 (2012) - 2011
- [j9]Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer:
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended. Algorithmica 61(3): 674-693 (2011) - [j8]Bernard Chazelle, Wolfgang Mulzer:
Computing Hereditary Convex Structures. Discret. Comput. Geom. 45(4): 796-823 (2011) - [j7]Kevin Buchin, Wolfgang Mulzer:
Delaunay triangulations in O(sort(n)) time and more. J. ACM 58(2): 6:1-6:27 (2011) - [j6]Tetsuo Asano, Wolfgang Mulzer, Yajun Wang:
Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons. J. Graph Algorithms Appl. 15(5): 569-586 (2011) - [j5]Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang:
Constant-Work-Space Algorithms for Geometric Problems. J. Comput. Geom. 2(1): 46-68 (2011) - [j4]Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms. SIAM J. Comput. 40(2): 350-375 (2011) - [c9]Esther Ezra, Wolfgang Mulzer:
Convex hull of imprecise points in o(n log n) time after preprocessing. SCG 2011: 11-20 - [c8]Maarten Löffler, Wolfgang Mulzer:
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent. SODA 2011: 1759-1777 - [i7]Esther Ezra, Wolfgang Mulzer:
Convex Hull of Imprecise Points in o(n \log{n}) Time after Preprocessing. CoRR abs/1102.2008 (2011) - [i6]John Iacono, Wolfgang Mulzer:
A Static Optimality Transformation with Applications to Planar Point Location. CoRR abs/1104.5597 (2011) - [i5]Wolfgang Mulzer, Daniel Werner:
Approximating Tverberg Points in Linear Time for Any Fixed Dimension. CoRR abs/1107.0104 (2011) - [i4]Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz:
Memory-Constrained Algorithms for Simple Polygons. CoRR abs/1112.5904 (2011) - 2010
- [c7]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving Algorithms for Convex Hulls. SODA 2010: 1546-1565 - [c6]Tetsuo Asano, Wolfgang Mulzer, Yajun Wang:
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. WALCOM 2010: 9-20
2000 – 2009
- 2009
- [j3]Bernard Chazelle, Wolfgang Mulzer:
Markov Incremental Constructions. Discret. Comput. Geom. 42(3): 399-420 (2009) - [j2]Wolfgang Mulzer:
A note on predecessor searching in the pointer machine model. Inf. Process. Lett. 109(13): 726-729 (2009) - [c5]Bernard Chazelle, Wolfgang Mulzer:
Computing hereditary convex structures. SCG 2009: 61-70 - [c4]Kevin Buchin, Wolfgang Mulzer:
Delaunay Triangulations in O(sort(n)) Time and More. FOCS 2009: 139-148 - [c3]Kevin Buchin, Maarten Löffler, Pat Morin, Wolfgang Mulzer:
Delaunay Triangulation of Imprecise Points Simplified and Extended. WADS 2009: 131-143 - [i3]Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms. CoRR abs/0907.0884 (2009) - 2008
- [j1]Wolfgang Mulzer, Günter Rote:
Minimum-weight triangulation is NP-hard. J. ACM 55(2): 11:1-11:29 (2008) - [c2]Bernard Chazelle, Wolfgang Johann Heinrich Mulzer:
Markov incremental constructions. SCG 2008: 156-163 - 2006
- [c1]Wolfgang Mulzer, Günter Rote:
Minimum weight triangulation is NP-hard. SCG 2006: 1-10 - [i2]Wolfgang Mulzer, Günter Rote:
Minimum-weight triangulation is NP-hard. CoRR abs/cs/0601002 (2006) - 2005
- [i1]Christian Knauer, Wolfgang Mulzer:
An exclusion region for minimum dilation triangulations. EuroCG 2005: 33-36
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-10-07 22:22 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:
