Wolfgang Mulzer
Department of Computer Science
Princeton University
35 Olden Street
Princeton, NJ 08540-5233
USA

Office: Room 103A
Phone: (609) 258-6795

My CV ([pdf] and [ps.gz]).

Publications

Journals

• Bernard Chazelle and Wolfgang Mulzer.
  Markov Incremental Constructions.
  Discrete and Computational Geometry (DCG) 42(3), October 2009, pp. 399-420
  Special Issue on SoCG 2008.
  [pdf] [ps.gz] [doi]
  
• Wolfgang Mulzer.
  A Note on Predecessor Searching in the Pointer Machine Model.
  Information Processing Letters 109(13), 2009, pp. 726-729
  [pdf] [ps.gz] [doi]
  
• Wolfgang Mulzer and Günter Rote.
  Minimum Weight Triangulation is NP-hard.
  Journal of the Association for Computing Machinery (JACM) 55(2), Article 11, May 2008.
  Technical report: [pdf] [ps.gz]
  Journal version: [pdf] [ps.gz] [doi] [gadgets and software]
  

Refereed Conferences

• Kenneth L. Clarkson, Wolfgang Mulzer, and C. Seshadhri.
  Self-Improving Algorithms for Convex Hulls
  Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), Austin, USA, 2010.
  [pdf] [ps.gz]
  
• Kevin Buchin and Wolfgang Mulzer.
  Delaunay Triangulations in O(sort(n)) Time and More
  Proceedings of the 50th Annual Symposium on Foundations of Computer Science (FOCS), Atlanta, USA, 2009, pp. 139-148.
  Brief Description: [pdf] [ps.gz]
  Proceedings version: [pdf] [ps.gz]
• Kevin Buchin, Maarten Löffler, Pat Morin, and Wolfgang Mulzer.
  Delaunay Triangulation of Imprecise Points Simplified and Extended.
  Proceedings of the 11th Algorithms and Data Structures Symposium (WADS), Banff, Canada, 2009, pp. 131-143.
  [pdf] [ps.gz] [doi]
  
• Bernard Chazelle and Wolfgang Mulzer.
  Computing Hereditary Convex Structures.
  Proceedings of the 25th Annual ACM Symposium on Computational Geometry (SoCG), Aarhus, Denmark, 2009, pp. 61-70.
  [pdf] [ps.gz] [doi]
  
• Bernard Chazelle and Wolfgang Mulzer.
  Markov Incremental Constructions.
  Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG), College Park, USA, 2008, pp. 156-163.
  [pdf] [ps.gz] [doi]
  
• Wolfgang Mulzer and Günter Rote.
  Minimum Weight Triangulation is NP-hard.
  Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (SoCG), Sedona, USA, 2006, pp. 1-10.
  Technical report: [pdf] [ps.gz]
  Proceedings version: [pdf] [ps.gz] [doi] [gadgets and software]
  

Non-Refereed Conferences and Workshops

• Kevin Buchin and Wolfgang Mulzer.
  Linear-Time Delaunay Triangulations Simplified.
  Proceedings of the 25th European Workshop on Computational Geometry (EWCG), Brussels, Belgium, 2009, pp. 235-238.
  [pdf] [ps.gz]
• Christian Knauer and Wolfgang Mulzer.
  An Exclusion Region for the Minimum Dilation Triangulation.
  Proceedings of the 21st European Workshop on Computational Geometry (EWCG), Eindhoven, The Netherlands, 2005, pp. 33-36.
  [pdf]

Technical Reports etc

• Tetsuo Asano, Wolfgang Mulzer, and Yajun Wang.
  A Constant-Work-Space Algorithm for Shortest Paths in Simple Polygons.
  To appear as an invited talk in Proceedings of the 4th Workshop on Algorithms and Computation (WALCOM), Dhaka, Bangladesh, 2010.
  [pdf] [ps.gz]
• Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, and C. Seshadhri.
  Self-Improving Algorithms.
  arXiv:0907.0884
  [pdf] [ps.gz]
• Wolfgang Mulzer.
  Minimum Dilation Triangulations for the Regular n-Gon.
  Masters Thesis. Freie Universität Berlin, 2004.
  [pdf] [ps.gz]
• Christian Knauer and Wolfgang Mulzer.
  Minimum Dilation Triangulations.
  Technical Report B-05-06. Freie Universität Berlin, April 2005.
  [ps.gz]