Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Mulzer, Wolfgang"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Self-improving algorithms for coordinatewise maxima and convex hulls
Kenneth L. Clarkson
,
Wolfgang Mulzer
,
C. Seshadhri
SIAM Journal on Computing
43
(2), 2014, pp. 617-653
Flip distance between triangulations of a simple polygon is NP-complete
Oswin Aichholzer
,
Wolfgang Mulzer
,
Alexander Pilz
Lecture Notes in Computer Science
8125
, 2013, pp. 13-24
Computing the Fréchet distance with a retractable leash
Kevin Buchin
,
Maike Buchin
,
Rolf van Leusden
,
Wouter Meulemans
,
Wolfgang Mulzer
Lecture Notes in Computer Science
8125
, 2013, pp. 241-252
Vertex deletion for 3D Delaunay triangulations
Kevin Buchin
,
Olivier Devillers
,
Wolfgang Mulzer
,
Okke Schrijvers
,
Jonathan Shewchuk
Lecture Notes in Computer Science
8125
, 2013, pp. 253-264
Unions of onions: Preprocessing imprecise points for fast onion layer decomposition
Maarten Löffler
,
Wolfgang Mulzer
Lecture Notes in Computer Science
8037
, 2013, pp. 487-498
Algorithms for tolerated Tverberg partitions
Wolfgang Mulzer
,
Yannik Stein
Lecture Notes in Computer Science
8283
, 2013, pp. 295-305
Data structures on event graphs
Bernard Chazelle
,
Wolfgang Mulzer
Lecture Notes in Computer Science
7501
, 2012, pp. 313-324
Self-improving algorithms for coordinate-wise maxima
Kenneth L. Clarkson
,
Wolfgang Mulzer
,
C. Seshadhri
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 277-286
Triangulating the square and squaring the triangle: Quadtrees and Delaunay triangulations are equivalent
Maarten Löffler
,
Wolfgang Mulzer
SIAM Journal on Computing
41
(4), 2012, pp. 941-974
Approximating Tverberg points in linear time for any fixed dimension
Wolfgang Mulzer
,
Daniel Werner
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 303-309
Self-improving algorithms
Nir Ailon
,
Bernard Chazelle
,
Kenneth L. Clarkson
,
Ding Liu
,
Wolfgang Mulzer
,
C. Seshadhri
SIAM Journal on Computing
40
(2), 2011, pp. 350-375
Preprocessing imprecise points for Delaunay triangulation: Simplified and extended
Kevin Buchin
,
Maarten Löffler
,
Pat Morin
,
Wolfgang Mulzer
Algorithmica
61
(3), 2011, pp. 674-693
Delaunay triangulations in
O(\mbox {sort}(n))
time and more
Kevin Buchin
,
Wolfgang Mulzer
Journal of the ACM
58
(2), 2011, pp. 6: 1-27
Delaunay triangulation of imprecise points simplified and extended
Kevin Buchin
,
Maarten Löffler
,
Pat Morin
,
Wolfgang Mulzer
Lecture Notes in Computer Science
5664
, 2009, pp. 131-143
A note on predecessor searching in the pointer machine model
Wolfgang Mulzer
Information Processing Letters
109
(13), 2009, pp. 726-729
Minimum-weight triangulation is
NP
-hard
Wolfgang Mulzer
,
Günter Rote
Journal of the ACM
55
(2), 2008, pp. 11: 1-29