An exclusion region for minimum dilation triangulations. - Christian Knauer; Wolfgang Mulzer (EuroCG, 2005)

Minimum-weight triangulation is NP-hard. - Wolfgang Mulzer; Günter Rote (J. ACM, 2008)

Delaunay Triangulations in O(sort(n)) Time and More. - Kevin Buchin; Wolfgang Mulzer (FOCS, 2009)

Delaunay Triangulation of Imprecise Points Simplified and Extended. - Kevin Buchin; Maarten Löffler; Pat Morin; Wolfgang Mulzer (WADS, 2009)

Markov Incremental Constructions. - Bernard Chazelle; Wolfgang Mulzer (Discret. Comput. Geom., 2009)

A note on predecessor searching in the pointer machine model. - Wolfgang Mulzer (Inf. Process. Lett., 2009)

Self-improving Algorithms for Convex Hulls. - Kenneth L. Clarkson; Wolfgang Mulzer; C. Seshadhri 001 (SODA, 2010)

Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon. - Tetsuo Asano; Wolfgang Mulzer; Yajun Wang (WALCOM, 2010)

Convex hull of imprecise points in o(n log n) time after preprocessing. - Esther Ezra; Wolfgang Mulzer (SCG, 2011)

Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended. - Kevin Buchin; Maarten Löffler; Pat Morin; Wolfgang Mulzer (Algorithmica, 2011)

Convex Hull of Imprecise Points in o(n log{n}) Time after Preprocessing - Esther Ezra; Wolfgang Mulzer (CoRR, 2011)

Computing Hereditary Convex Structures. - Bernard Chazelle; Wolfgang Mulzer (Discret. Comput. Geom., 2011)

Delaunay triangulations in O(sort(n)) time and more. - Kevin Buchin; Wolfgang Mulzer (J. ACM, 2011)

Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons. - Tetsuo Asano; Wolfgang Mulzer; Yajun Wang (J. Graph Algorithms Appl., 2011)

Constant-Work-Space Algorithms for Geometric Problems. - Tetsuo Asano; Wolfgang Mulzer; Günter Rote; Yajun Wang (J. Comput. Geom., 2011)

Self-Improving Algorithms. - Nir Ailon; Bernard Chazelle; Kenneth L. Clarkson; Ding Liu; Wolfgang Mulzer; C. Seshadhri 001 (SIAM J. Comput., 2011)

Self-improving algorithms for coordinate-wise maxima. - Kenneth L. Clarkson; Wolfgang Mulzer; C. Seshadhri 001 (SCG, 2012)

A Lower Bound for Shallow Partitions - Wolfgang Mulzer; Daniel Werner (CoRR, 2012)

Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls - Kenneth L. Clarkson; Wolfgang Mulzer; C. Seshadhri 001 (CoRR, 2012)

A Static Optimality Transformation with Applications to Planar Point Location. - John Iacono; Wolfgang Mulzer (Int. J. Comput. Geom. Appl., 2012)

Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent. - Maarten Löffler; Wolfgang Mulzer (SIAM J. Comput., 2012)

Vertex Deletion for 3D Delaunay Triangulations. - Kevin Buchin; Olivier Devillers; Wolfgang Mulzer; Okke Schrijvers; Jonathan Richard Shewchuk (ESA, 2013)

Algorithms for Tolerated Tverberg Partitions. - Wolfgang Mulzer; Yannik Stein (ISAAC, 2013)

Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition. - Maarten Löffler; Wolfgang Mulzer (WADS, 2013)

Memory-constrained algorithms for simple polygons. - Tetsuo Asano; Kevin Buchin; Maike Buchin; Matias Korman; Wolfgang Mulzer; Günter Rote; André Schulz 001 (Comput. Geom., 2013)

Convex hull of points lying on lines in time after preprocessing. - Esther Ezra; Wolfgang Mulzer (Comput. Geom., 2013)

Unions of Onions - Maarten Löffler; Wolfgang Mulzer (CoRR, 2013)

Approximating Tverberg Points in Linear Time for Any Fixed Dimension. - Wolfgang Mulzer; Daniel Werner (Discret. Comput. Geom., 2013)

Interference Minimization in Asymmetric Sensor Networks. - Yves Brise; Kevin Buchin; Dustin Eversmann; Michael Hoffmann 001; Wolfgang Mulzer (ALGOSENSORS, 2014)

LiveCG: an Interactive Visualization Environment for Computational Geometry. - Sebastian Kürten; Wolfgang Mulzer (SoCG, 2014)

Four Soviets Walk the Dog - with an Application to Alt's Conjecture. - Kevin Buchin; Maike Buchin; Wouter Meulemans; Wolfgang Mulzer (SODA, 2014)

Reprint of: Memory-constrained algorithms for simple polygons. - Tetsuo Asano; Kevin Buchin; Maike Buchin; Matias Korman; Wolfgang Mulzer; Günter Rote; André Schulz 001 (Comput. Geom., 2014)

Algorithms for Tolerant Tverberg Partitions. - Wolfgang Mulzer; Yannik Stein (Int. J. Comput. Geom. Appl., 2014)

Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition. - Maarten Löffler; Wolfgang Mulzer (J. Comput. Geom., 2014)

Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls. - Kenneth L. Clarkson; Wolfgang Mulzer; C. Seshadhri 001 (SIAM J. Comput., 2014)

Spanners and Reachability Oracles for Directed Transmission Graphs. - Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (SoCG, 2015)

Approximate k-flat Nearest Neighbor Search. - Wolfgang Mulzer; Huy L. Nguyên; Paul Seiferth; Yannik Stein (STOC, 2015)

Data Structures on Event Graphs. - Bernard Chazelle; Wolfgang Mulzer (Algorithmica, 2015)

Flip Distance Between Triangulations of a Simple Polygon is NP-Complete. - Oswin Aichholzer; Wolfgang Mulzer; Alexander Pilz (Discret. Comput. Geom., 2015)

Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon. - Yeganeh Bahoo; Bahareh Banyassady; Prosenjit Bose; Stephane Durocher; Wolfgang Mulzer (CoRR, 2016)

Computing the Fréchet Distance with a Retractable Leash. - Kevin Buchin; Maike Buchin; Rolf van Leusden; Wouter Meulemans; Wolfgang Mulzer (Discret. Comput. Geom., 2016)

Approximability of the discrete Fréchet distance. - Karl Bringmann; Wolfgang Mulzer (J. Comput. Geom., 2016)

The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications. - Frédéric Meunier; Wolfgang Mulzer; Pauline Sarrabezolles; Yannik Stein (SODA, 2017)

Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space. - Marcel Ehrhardt; Wolfgang Mulzer (WADS, 2017)

Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon. - Yeganeh Bahoo; Bahareh Banyassady; Prosenjit Bose; Stephane Durocher; Wolfgang Mulzer (WALCOM, 2017)

Routing in Polygons with Holes. - Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein; Birgit Vogtenhuber; Max Willert (CoRR, 2017)

Encoding Arguments. - Pat Morin; Wolfgang Mulzer; Tommy Reddad (ACM Comput. Surv., 2017)

Four Soviets Walk the Dog: Improved Bounds for Computing the Fréchet Distance. - Kevin Buchin; Maike Buchin; Wouter Meulemans; Wolfgang Mulzer (Discret. Comput. Geom., 2017)

An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings. - Oswin Aichholzer; Vincent Kusters; Wolfgang Mulzer; Alexander Pilz; Manuel Wettstein (Int. J. Comput. Geom. Appl., 2017)

Approximate Minimum-Weight Matching with Outliers Under Translation. - Pankaj K. Agarwal; Haim Kaplan; Geva Kipper; Wolfgang Mulzer; Günter Rote; Micha Sharir; Allen Xiao (ISAAC, 2018)

Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors. - Katharina Klost; Wolfgang Mulzer (LATIN, 2018)

Routing in Unit Disk Graphs. - Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (Algorithmica, 2018)

The dual diameter of triangulations. - Matias Korman; Stefan Langerman; Wolfgang Mulzer; Alexander Pilz; Maria Saumell; Birgit Vogtenhuber (Comput. Geom., 2018)

Time-space trade-offs for triangulations and Voronoi diagrams. - Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein (Comput. Geom., 2018)

Geometric Algorithms with Limited Workspace: A Survey. - Bahareh Banyassady; Matias Korman; Wolfgang Mulzer (CoRR, 2018)

Computational Aspects of the Colorful Carathéodory Theorem. - Wolfgang Mulzer; Yannik Stein (Discret. Comput. Geom., 2018)

Five Proofs of Chernoff's Bound with Applications. - Wolfgang Mulzer (Bull. EATCS, 2018)

Improved time-space trade-offs for computing Voronoi diagrams. - Bahareh Banyassady; Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein (J. Comput. Geom., 2018)

Spanners for Directed Transmission Graphs. - Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (SIAM J. Comput., 2018)

Computational Geometry Column 67. - Bahareh Banyassady; Matias Korman; Wolfgang Mulzer (SIGACT News, 2018)

Triangles and Girth in Disk Graphs and Transmission Graphs. - Haim Kaplan; Katharina Klost; Wolfgang Mulzer; Liam Roditty; Paul Seiferth; Micha Sharir (ESA, 2019)

An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model. - Jonas Cleve; Wolfgang Mulzer (SEA², 2019)

Asymmetric Convex Intersection Testing. - Luis Barba; Wolfgang Mulzer (SOSA, 2019)

Faster algorithms for growing prioritized disks and rectangles. - Hee-Kap Ahn; Sang Won Bae 001; Jong Min Choi; Matias Korman; Wolfgang Mulzer; Eunjin Oh 001; Ji-won Park; André van Renssen; Antoine Vigneron (Comput. Geom., 2019)

Special Issue on the 34th European Workshop on Computational Geometry, Guest Editors' Foreword. - Matias Korman; Wolfgang Mulzer (Comput. Geom., 2019)

Dynamic Maintenance of the Lower Envelope of Pseudo-Lines. - Pankaj K. Agarwal; Ravid Cohen; Dan Halperin; Wolfgang Mulzer (CoRR, 2019)

A time-space trade-off for computing the k-visibility region of a point in a polygon. - Yeganeh Bahoo; Bahareh Banyassady; Prosenjit K. Bose; Stephane Durocher; Wolfgang Mulzer (Theor. Comput. Sci., 2019)

Long Alternating Paths Exist. - Wolfgang Mulzer; Pavel Valtr 001 (SoCG, 2020)

Computational Complexity of the α-Ham-Sandwich Problem. - Man-Kwun Chiu; Aruni Choudhary; Wolfgang Mulzer (ICALP, 2020)

Compact Routing in Unit Disk Graphs. - Wolfgang Mulzer; Max Willert (ISAAC, 2020)

Routing in Histograms. - Man-Kwun Chiu; Jonas Cleve; Katharina Klost; Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Max Willert (WALCOM, 2020)

Reachability Oracles for Directed Transmission Graphs. - Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (Algorithmica, 2020)

Routing in polygonal domains. - Bahareh Banyassady; Man-Kwun Chiu; Matias Korman; Wolfgang Mulzer; André van Renssen; Marcel Roeloffzen; Paul Seiferth; Yannik Stein; Birgit Vogtenhuber; Max Willert (Comput. Geom., 2020)

Combinatorics of beacon-based routing in three dimensions. - Jonas Cleve; Wolfgang Mulzer (Comput. Geom., 2020)

The Tree Stabbing Number is not Monotone. - Wolfgang Mulzer; Johannes Obenaus (CoRR, 2020)

Routing in Unit Disk Graphs without Dynamic Headers. - Wolfgang Mulzer; Max Willert (CoRR, 2020)

Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. - Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth; Micha Sharir (Discret. Comput. Geom., 2020)

A constructive proof of a concentration bound for real-valued random variables. - Wolfgang Mulzer; Natalia Shenkman (Inf. Process. Lett., 2020)

Minimal Representations of Order Types by Geometric Graphs. - Oswin Aichholzer; Martin Balko; Michael Hoffmann 001; Jan Kyncl; Wolfgang Mulzer; Irene Parada; Alexander Pilz; Manfred Scheucher; Pavel Valtr 001; Birgit Vogtenhuber; Emo Welzl (J. Graph Algorithms Appl., 2020)

Time-space trade-offs for computing Euclidean minimum spanning trees. - Bahareh Banyassady; Luis Barba; Wolfgang Mulzer (J. Comput. Geom., 2020)

A simple randomized $O(n log n)$-time closest-pair algorithm in doubling metrics. - Michiel Smid; Anil Maheshwari; Wolfgang Mulzer (J. Comput. Geom., 2020)

Minimum cuts in geometric intersection graphs. - Sergio Cabello; Wolfgang Mulzer (Comput. Geom., 2021)

Stabbing pairwise intersecting disks by five points. - Sariel Har-Peled; Haim Kaplan; Wolfgang Mulzer; Liam Roditty; Paul Seiferth; Micha Sharir; Max Willert (Discret. Math., 2021)

On the Stretch Factor of Polygonal Chains. - Ke Chen 011; Adrian Dumitrescu; Wolfgang Mulzer; Csaba D. Tóth (SIAM J. Discret. Math., 2021)

Long Plane Trees. - Sergio Cabello; Michael Hoffmann 001; Katharina Klost; Wolfgang Mulzer; Josef Tkadlec (SoCG, 2022)

Dynamic Connectivity in Disk Graphs. - Haim Kaplan; Alexander Kauer; Katharina Klost; Kristin Knorr; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (SoCG, 2022)

Compatible Spanning Trees in Simple Drawings of Kn. - Oswin Aichholzer; Kristin Knorr; Wolfgang Mulzer; Nicolas El Maalouly; Johannes Obenaus; Rosna Paul; Meghana M. Reddy; Birgit Vogtenhuber; Alexandra Weinberger (GD, 2022)

Well-Separation and Hyperplane Transversals in High Dimensions. - Helena Bergold; Daniel Bertschinger; Nicolas Grelier; Wolfgang Mulzer; Patrick Schnider (SWAT, 2022)

Nearest-Neighbor Decompositions of Drawings. - Jonas Cleve; Nicolas Grelier; Kristin Knorr; Maarten Löffler; Wolfgang Mulzer; Daniel Perz (SWAT, 2022)

Flipping Plane Spanning Paths. - Oswin Aichholzer; Kristin Knorr; Maarten Löffler; Zuzana Masárová; Wolfgang Mulzer; Johannes Obenaus; Rosna Paul; Birgit Vogtenhuber (CoRR, 2022)

Unique Sink Orientations of Grids is in Unique End of Potential Line. - Michaela Borzechowski; Wolfgang Mulzer (CoRR, 2022)

No-Dimensional Tverberg Theorems and Algorithms. - Aruni Choudhary; Wolfgang Mulzer (Discret. Comput. Geom., 2022)

Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead. - Pankaj K. Agarwal; Ravid Cohen; Dan Halperin; Wolfgang Mulzer (ACM Trans. Algorithms, 2022)

Flipping Plane Spanning Paths. - Oswin Aichholzer; Kristin Knorr; Wolfgang Mulzer; Johannes Obenaus; Rosna Paul; Birgit Vogtenhuber (WALCOM, 2023)

Maximum Matchings in Geometric Intersection Graphs. - Édouard Bonnet; Sergio Cabello; Wolfgang Mulzer (Discret. Comput. Geom., 2023)

Insertion-Only Dynamic Connectivity in General Disk Graphs. - Haim Kaplan; Katharina Klost; Kristin Knorr; Wolfgang Mulzer; Liam Roditty (SOSA, 2024)

Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs. - Katharina Klost; Wolfgang Mulzer (CoRR, 2024)

Dynamic Connectivity in Disk Graphs. - Alexander Baumann; Haim Kaplan; Katharina Klost; Kristin Knorr; Wolfgang Mulzer; Liam Roditty; Paul Seiferth (Discret. Comput. Geom., 2024)