Personal information

Emails & domains

Verified email domains

Other IDs

Scopus Author ID: 14321813300

Activities

Collapse all

Works (46)

Routing in unit disk graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2016 | Book
DOI: 10.1007/978-3-662-49529-2_40
EID:

2-s2.0-84961755011
Contributors: Kaplan, H.; Mulzer, W.; Roditty, L.; Seiferth, P.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

An optimal algorithm for reconstructing point set order types from radial orderings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2015 | Book
DOI: 10.1007/978-3-662-48971-0_43
EID:

2-s2.0-84952032021
Contributors: Aichholzer, O.; Kusters, V.; Mulzer, W.; Pilz, A.; Wettstein, M.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Approximability of the Discrete Fréchet Distance

Leibniz International Proceedings in Informatics, LIPIcs
2015 | Conference paper
DOI: 10.4230/LIPIcs.SOCG.2015.739
EID:

2-s2.0-84958164042
Contributors: Bringmann, K.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Approximate k-flat nearest neighbor search

Proceedings of the Annual ACM Symposium on Theory of Computing
2015 | Conference paper
DOI: 10.1145/2746539.2746559
EID:

2-s2.0-84958742773
Contributors: Mulzer, W.; Nguyen, H.L.; Seiferth, P.; Stein, Y.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Computational Aspects of the Colorful Carathéodory Theorem

Leibniz International Proceedings in Informatics, LIPIcs
2015 | Conference paper
DOI: 10.4230/LIPIcs.SOCG.2015.44
EID:

2-s2.0-84958161032
Contributors: Mulzer, W.; Stein, Y.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Data Structures on Event Graphs

Algorithmica
2015 | Journal article
DOI: 10.1007/s00453-013-9838-4
EID:

2-s2.0-84924851621
Contributors: Chazelle, B.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Flip Distance Between Triangulations of a Simple Polygon is NP-Complete

Discrete and Computational Geometry
2015 | Journal article
DOI: 10.1007/s00454-015-9709-7
EID:

2-s2.0-84938985962
Contributors: Aichholzer, O.; Mulzer, W.; Pilz, A.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Foreword

Leibniz International Proceedings in Informatics, LIPIcs
2015 | Conference paper
EID:

2-s2.0-84958214071
Contributors: Arge, L.; Pach, J.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Interference minimization in asymmetric sensor networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2015 | Book
DOI: 10.1007/978-3-662-46018-4_9
EID:

2-s2.0-84927725671
Contributors: Brise, Y.; Buchin, K.; Eversmann, D.; Hoffmann, M.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Spanners and Reachability Oracles for Directed Transmission Graphs

Leibniz International Proceedings in Informatics, LIPIcs
2015 | Conference paper
DOI: 10.4230/LIPIcs.SOCG.2015.156
EID:

2-s2.0-84958172532
Contributors: Kaplan, H.; Mulzer, W.; Roditty, L.; Seiferth, P.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Time-space trade-offs for triangulations and Voronoi diagrams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2015 | Book
DOI: 10.1007/978-3-319-21840-3_40
EID:

2-s2.0-84951771493
Contributors: Korman, M.; Mulzer, W.; Van Renssen, A.; Roeloffzen, M.; Seiferth, P.; Stein, Y.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Algorithms for tolerant tverberg partitions

International Journal of Computational Geometry and Applications
2014 | Journal article
DOI: 10.1142/S0218195914600073
EID:

2-s2.0-84929901234
Contributors: Mulzer, W.; Stein, Y.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

LiveCG: An interactive visualization environment for Computational Geometry

Proceedings of the Annual Symposium on Computational Geometry
2014 | Conference paper
DOI: 10.1145/2582112.2595645
EID:

2-s2.0-84904423905
Contributors: Kürten, S.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Reprint of: Memory-constrained algorithms for simple polygons

Computational Geometry: Theory and Applications
2014 | Journal article
DOI: 10.1016/j.comgeo.2013.11.004
EID:

2-s2.0-84890125703
Contributors: Asano, T.; Buchin, K.; Buchin, M.; Korman, M.; Mulzer, W.; Rote, G.; Schulz, A.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Self-improving algorithms for coordinatewise maxima and convex hulls

SIAM Journal on Computing
2014 | Journal article
DOI: 10.1137/12089702X
EID:

2-s2.0-84899640035
Contributors: Clarkson, K.L.; Mulzer, W.; Seshadhri, C.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Algorithms for tolerated Tverberg partitions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2013 | Book
DOI: 10.1007/978-3-642-45030-3_28
EID:

2-s2.0-84893347768
Contributors: Mulzer, W.; Stein, Y.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Approximating Tverberg Points in Linear Time for Any Fixed Dimension

Discrete and Computational Geometry
2013 | Journal article
DOI: 10.1007/s00454-013-9528-7
EID:

2-s2.0-84881612196
Contributors: Mulzer, W.; Werner, D.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Computing the Fréchet distance with a retractable leash

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2013 | Book
DOI: 10.1007/978-3-642-40450-4_21
EID:

2-s2.0-84884294706
Contributors: Buchin, K.; Buchin, M.; Van Leusden, R.; Meulemans, W.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Flip distance between triangulations of a simple polygon is NP-complete

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2013 | Book
DOI: 10.1007/978-3-642-40450-4_2
EID:

2-s2.0-84884343070
Contributors: Aichholzer, O.; Mulzer, W.; Pilz, A.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Four Soviets Walk the Dog—with an Application to Alt's Conjecture

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2013 | Other
DOI: 10.1137/1.9781611973402.103
Contributors: Kevin Buchin; Maike Buchin; Wouter Meulemans; Wolfgang Mulzer
Source: Self-asserted source
Wolfgang Mulzer via Crossref Metadata Search

Memory-constrained algorithms for simple polygons

Computational Geometry: Theory and Applications
2013 | Journal article
DOI: 10.1016/j.comgeo.2013.04.005
EID:

2-s2.0-84878597001
Contributors: Asano, T.; Buchin, K.; Buchin, M.; Korman, M.; Mulzer, W.; Rote, G.; Schulz, A.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Unions of onions: Preprocessing imprecise points for fast onion layer decomposition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2013 | Book
DOI: 10.1007/978-3-642-40104-6_42
EID:

2-s2.0-84881121262
Contributors: Löffler, M.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Vertex deletion for 3D Delaunay triangulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2013 | Book
DOI: 10.1007/978-3-642-40450-4_22
EID:

2-s2.0-84884324386
Contributors: Buchin, K.; Devillers, O.; Mulzer, W.; Schrijvers, O.; Shewchuk, J.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

A static optimality transformation with applications to planar point location

International Journal of Computational Geometry and Applications
2012 | Journal article
DOI: 10.1142/S0218195912600084
EID:

2-s2.0-84868144228
Contributors: Iacono, J.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier
grade
Preferred source (of 2)‎

Approximating Tverberg points in linear time for any fixed dimension

Proceedings of the Annual Symposium on Computational Geometry
2012 | Conference paper
DOI: 10.1145/2261250.2261294
EID:

2-s2.0-84863963933
Contributors: Mulzer, W.; Werner, D.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Convex hull of points lying on lines in o (n log n) time after preprocessing

Computational Geometry: Theory and Applications
2012 | Journal article
DOI: 10.1016/j.comgeo.2012.03.004
EID:

2-s2.0-84868608266
Contributors: Ezra, E.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Data structures on event graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2012 | Book
DOI: 10.1007/978-3-642-33090-2_28
EID:

2-s2.0-84866683857
Contributors: Chazelle, B.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Self-improving algorithms for coordinate-wise maxima

Proceedings of the Annual Symposium on Computational Geometry
2012 | Conference paper
DOI: 10.1145/2261250.2261291
EID:

2-s2.0-84863937955
Contributors: Clarkson, K.L.; Mulzer, W.; Seshadhri, C.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Triangulating the square and squaring the triangle: Quadtrees and Delaunay triangulations are equivalent

SIAM Journal on Computing
2012 | Journal article
DOI: 10.1137/110825698
EID:

2-s2.0-84866429399
Contributors: Löffler, M.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Computing Hereditary Convex Structures

Discrete and Computational Geometry
2011 | Journal article
DOI: 10.1007/s00454-011-9346-8
EID:

2-s2.0-79954632224
Contributors: Chazelle, B.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Constant-work-space algorithms for shortest paths in trees and simple polygons

Journal of Graph Algorithms and Applications
2011 | Journal article
DOI: 10.7155/jgaa.00240
EID:

2-s2.0-84866642107
Contributors: Asano, T.; Mulzer, W.; Wang, Y.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Convex hull of imprecise points in o(n log n) time after preprocessing

Proceedings of the Annual Symposium on Computational Geometry
2011 | Conference paper
DOI: 10.1145/1998196.1998199
EID:

2-s2.0-79960199478
Contributors: Ezra, E.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Delaunay triangulations in O(sort(n)) time and more

Journal of the ACM
2011 | Journal article
DOI: 10.1145/1944345.1944347
EID:

2-s2.0-79953884648
Contributors: Buchin, K.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Preprocessing imprecise points for delaunay triangulation: Simplified and extended

Algorithmica (New York)
2011 | Journal article
DOI: 10.1007/s00453-010-9430-0
EID:

2-s2.0-80052856820
Contributors: Buchin, K.; Löffler, M.; Morin, P.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Self-improving algorithms

SIAM Journal on Computing
2011 | Journal article
DOI: 10.1137/090766437
EID:

2-s2.0-79957513990
Contributors: Ailon, N.; Chazelle, B.; Clarkson, K.L.; Liu, D.; Mulzer, W.; Seshadhri, C.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Triangulating the square and squaring the triangle: Quadtrees and delaunay triangulations are equivalent

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
2011 | Conference paper
EID:

2-s2.0-79953883866
Contributors: Löffler, M.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Constant-work-space algorithm for a shortest path in a simple polygon

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2010 | Book
DOI: 10.1007/978-3-642-11440-3_2
EID:

2-s2.0-77949615085
Contributors: Asano, T.; Mulzer, W.; Wang, Y.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Self-improving Algorithms for Convex Hulls

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms
2010-01 | Other
DOI: 10.1137/1.9781611973075.126
Contributors: Kenneth L. Clarkson; Wolfgang Mulzer; C. Seshadhri
Source: Self-asserted source
Wolfgang Mulzer via Crossref Metadata Search

A note on predecessor searching in the pointer machine model

Information Processing Letters
2009 | Journal article
DOI: 10.1016/j.ipl.2009.03.003
EID:

2-s2.0-67349113144
Contributors: Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Computing hereditary convex structures

Proceedings of the Annual Symposium on Computational Geometry
2009 | Conference paper
DOI: 10.1145/1542362.1542374
EID:

2-s2.0-70849112136
Contributors: Chazelle, B.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Delaunay triangulation of imprecise points simplified and extended

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2009 | Book
DOI: 10.1007/978-3-642-03367-4_12
EID:

2-s2.0-69949181216
Contributors: Buchin, K.; Löffler, M.; Morin, P.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Delaunay triangulations in O(sort(n)) time and more

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
2009 | Conference paper
DOI: 10.1109/FOCS.2009.53
EID:

2-s2.0-77952399260
Contributors: Buchin, K.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Markov incremental constructions

Discrete and Computational Geometry
2009 | Journal article
DOI: 10.1007/s00454-009-9170-6
EID:

2-s2.0-70349729976
Contributors: Chazelle, B.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Markov incremental constructions

Proceedings of the Annual Symposium on Computational Geometry
2008 | Conference paper
DOI: 10.1145/1377676.1377701
EID:

2-s2.0-57349160226
Contributors: Chazelle, B.; Mulzer, W.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Minimum-weight triangulation is NP-hard

Journal of the ACM
2008 | Journal article
DOI: 10.1145/1346330.1346336
EID:

2-s2.0-43949096573
Contributors: Mulzer, W.; Rote, G.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Minimum weight triangulation is NP-hard

Proceedings of the Annual Symposium on Computational Geometry
2006 | Conference paper
EID:

2-s2.0-33748085387
Contributors: Mulzer, W.; Rote, G.
Source: Self-asserted source
Wolfgang Mulzer via Scopus - Elsevier

Peer review (2 reviews for 2 publications/grants)

Review activity for Algorithmica. (1)
Review activity for Information processing letters. (1)
How many people are using ORCID?