pith. sign in

Wolfgang Mulzer

Identifiers

  • name variant Wolfgang Mulzer 0.60 · backfill

Papers (34)

  1. Triangles and Girth in Disk Graphs and Transmission Graphs cs.CG · 2019 · author #3
  2. An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model cs.CG · 2019 · author #2
  3. Dynamic Maintenance of the Lower Envelope of Pseudo-Lines cs.CG · 2019 · author #4
  4. Routing in Histograms cs.CG · 2019 · author #5
  5. Approximate Minimum-Weight Matching with Outliers under Translation cs.CG · 2018 · author #4
  6. Asymmetric Convex Intersection Testing cs.CG · 2018 · author #2
  7. Geometric Algorithms with Limited Workspace: A Survey cs.CG · 2018 · author #3
  8. Five Proofs of Chernoff's Bound with Applications cs.DM · 2018 · author #1
  9. Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors cs.CG · 2017 · author #2
  10. Improved Time-Space Trade-offs for Computing Voronoi Diagrams cs.CG · 2017 · author #3
  11. The Rainbow at the End of the Line --- A PPAD Formulation of the Colorful Carath\'eodory Theorem with Applications cs.CG · 2016 · author #2
  12. Encoding Arguments cs.IT · 2016 · author #2
  13. Routing in Unit Disk Graphs cs.CG · 2015 · author #2
  14. An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings cs.CG · 2015 · author #3
  15. The Dual Diameter of Triangulations cs.CG · 2015 · author #3
  16. Computational Aspects of the Colorful Carath\'eodory Theorem cs.CG · 2014 · author #1
  17. Approximate k-flat Nearest Neighbor Search cs.CG · 2014 · author #1
  18. Interference Minimization in Asymmetric Sensor Networks cs.CG · 2014 · author #5
  19. Computing the Fr\'echet Distance with a Retractable Leash cs.CG · 2013 · author #5
  20. Algorithms for Tolerant Tverberg Partitions cs.CG · 2013 · author #1
  21. Greedy is as Good as Delaunay (Almost) cs.CG · 2013 · author #1
  22. Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition cs.CG · 2013 · author #2
  23. Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls cs.CG · 2012 · author #2
  24. Four Soviets Walk the Dog-Improved Bounds for Computing the Fr\'echet Distance cs.CG · 2012 · author #4
  25. Flip Distance Between Triangulations of a Simple Polygon is NP-Complete cs.CG · 2012 · author #2
  26. Data Structures on Event Graphs cs.DS · 2012 · author #2
  27. Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent cs.CG · 2012 · author #2
  28. Self-improving Algorithms for Coordinate-wise Maxima cs.CG · 2012 · author #2
  29. A Lower Bound for Shallow Partitions cs.CG · 2012 · author #1
  30. Memory-Constrained Algorithms for Simple Polygons cs.CG · 2011 · author #5
  31. A Static Optimality Transformation with Applications to Planar Point Location cs.CG · 2011 · author #2
  32. Convex Hull of Points Lying on Lines in o(n log n) Time after Preprocessing cs.CG · 2011 · author #2
  33. Self-Improving Algorithms cs.DS · 2009 · author #5
  34. Minimum-weight triangulation is NP-hard cs.CG · 2006 · author #1

Mentions

  • 1306.5527 #5 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1306.3452 #1 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1302.5635 #1 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1302.5328 #2 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1211.0952 #2 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1209.4403 #4 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1209.0579 #2 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1206.6193 #2 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1205.4738 #2 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1204.0824 #2 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1201.2267 #1 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1112.5904 #5 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1104.5597 #2 · backfill · confidence 0.70 Wolfgang Mulzer
  • 1102.2008 #2 · backfill · confidence 0.70 Wolfgang Mulzer
  • 0907.0884 #5 · backfill · confidence 0.70 Wolfgang Mulzer

Frequent Coauthors