 | 2012 |
| 26 |  | Wolfgang Mulzer,
Daniel Werner:
A Lower Bound for Shallow Partitions
CoRR abs/1201.2267: (2012) |
| 25 |  | Kenneth L. Clarkson,
Wolfgang Mulzer,
C. Seshadhri:
Self-improving Algorithms for Coordinate-wise Maxima
CoRR abs/1204.0824: (2012) |
| 24 |  | Maarten Löffler,
Wolfgang Mulzer:
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent
CoRR abs/1205.4738: (2012) |
| 2011 |
| 23 |  | Maarten Löffler,
Wolfgang Mulzer:
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent.
SODA 2011: 1759-1777 |
| 22 |  | Esther Ezra,
Wolfgang Mulzer:
Convex hull of imprecise points in o(n log n) time after preprocessing.
Symposium on Computational Geometry 2011: 11-20 |
| 21 |  | Kevin Buchin,
Maarten Löffler,
Pat Morin,
Wolfgang Mulzer:
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended.
Algorithmica 61(3): 674-693 (2011) |
| 20 |  | Esther Ezra,
Wolfgang Mulzer:
Convex Hull of Imprecise Points in o(n \log{n}) Time after Preprocessing
CoRR abs/1102.2008: (2011) |
| 19 |  | Wolfgang Mulzer,
Daniel Werner:
Approximating Tverberg Points in Linear Time for Any Fixed Dimension
CoRR abs/1107.0104: (2011) |
| 18 |  | 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) |
| 17 |  | Bernard Chazelle,
Wolfgang Mulzer:
Computing Hereditary Convex Structures.
Discrete & Computational Geometry 45(4): 796-823 (2011) |
| 16 |  | Kevin Buchin,
Wolfgang Mulzer:
Delaunay triangulations in O(sort(n)) time and more.
J. ACM 58(2): 6 (2011) |
| 15 |  | Tetsuo Asano,
Wolfgang Mulzer,
Günter Rote,
Yajun Wang:
Constant-Work-Space Algorithms for Geometric Problems.
JoCG 2(1): 46-68 (2011) |
| 14 |  | Nir Ailon,
Bernard Chazelle,
Kenneth L. Clarkson,
Ding Liu,
Wolfgang Mulzer,
C. Seshadhri:
Self-Improving Algorithms.
SIAM J. Comput. 40(2): 350-375 (2011) |
| 2010 |
| 13 |  | Kenneth L. Clarkson,
Wolfgang Mulzer,
C. Seshadhri:
Self-improving Algorithms for Convex Hulls.
SODA 2010: 1546-1565 |
| 12 |  | Tetsuo Asano,
Wolfgang Mulzer,
Yajun Wang:
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon.
WALCOM 2010: 9-20 |
| 2009 |
| 11 |  | Kevin Buchin,
Wolfgang Mulzer:
Delaunay Triangulations in O(sort(n)) Time and More.
FOCS 2009: 139-148 |
| 10 |  | Bernard Chazelle,
Wolfgang Mulzer:
Computing hereditary convex structures.
Symposium on Computational Geometry 2009: 61-70 |
| 9 |  | Kevin Buchin,
Maarten Löffler,
Pat Morin,
Wolfgang Mulzer:
Delaunay Triangulation of Imprecise Points Simplified and Extended.
WADS 2009: 131-143 |
| 8 |  | Nir Ailon,
Bernard Chazelle,
Kenneth L. Clarkson,
Ding Liu,
Wolfgang Mulzer,
C. Seshadhri:
Self-Improving Algorithms
CoRR abs/0907.0884: (2009) |
| 7 |  | Bernard Chazelle,
Wolfgang Mulzer:
Markov Incremental Constructions.
Discrete & Computational Geometry 42(3): 399-420 (2009) |
| 6 |  | Wolfgang Mulzer:
A note on predecessor searching in the pointer machine model.
Inf. Process. Lett. 109(13): 726-729 (2009) |
| 2008 |
| 5 |  | Bernard Chazelle,
Wolfgang Johann Heinrich Mulzer:
Markov incremental constructions.
Symposium on Computational Geometry 2008: 156-163 |
| 4 |  | Wolfgang Mulzer,
Günter Rote:
Minimum-weight triangulation is NP-hard.
J. ACM 55(2): (2008) |
| 2006 |
| 3 |  | Wolfgang Mulzer,
Günter Rote:
Minimum weight triangulation is NP-hard.
Symposium on Computational Geometry 2006: 1-10 |
| 2 |  | Wolfgang Mulzer,
Günter Rote:
Minimum-weight triangulation is NP-hard
CoRR abs/cs/0601002: (2006) |
| 2005 |
| 1 |  | Christian Knauer,
Wolfgang Mulzer:
An exclusion region for minimum dilation triangulations.
EuroCG 2005: 33-36 |