Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
About
Wolfgang Mulzer

Wolfgang Mulzer

Freie Universität Berlin
Fachbereich Mathematik und Informatik
Institut für Informatik
AG Theoretische Informatik
Takustraße 9
D-14195 Berlin
Germany
Office: Room 112
Phone: +49 30 838–75165 (–75100)
Fax: +49 30 838–475165
E-mail: mulzer[at]inf.fu-berlin.de
CV

Short Curriculum Vitae

  • November 2023 – April 2024
    I have to push the pram a lot, again
  • May 2021 – October 2021
    I have to push the pram a lot
  • October 2016 – now
    Professor at Freie Universität Berlin
  • November 2010 – September 2016
    Assistant Professor at Freie Universität Berlin
  • October 2010
    Visiting Professor at Freie Universität Berlin
  • May 2010
    PhD (Department of Computer Science, Princeton University, advisor: Bernard Chazelle)
Detailed CV
Publications

Surveys:

  1. Bahareh Banyassady, Matías Korman, and Wolfgang Mulzer

    Geometric Algorithms with Limited Workspace

    ACM SIGACT News, 49(2), June 2018, pp. 77–94

    [pdf] [arXiv] [doi]

  2. Wolfgang Mulzer

    Five Proofs of Chernoff's Bound with Applications

    Bulletin of the EATCS (BEATCS), 124, February 2018

    [pdf] [arXiv] [link]

  3. Joseph S.B. Mitchell and Wolfgang Mulzer

    Proximity Algorithms

    In: Jacob E. Goodman, Joseph O'Rourke, and Csaba D. Tóth (editors), Handbook of Discrete and Computational Geometry, Third Edition, Chapter 32, 2017, pp. 849–874

    [pdf] [link] [doi]

Journals:

  3. Aruni Choudhary and Wolfgang Mulzer

    No-dimensional Tverberg Theorems and Algorithms

    Discrete and Computational Geometry (DCG), 68(4), December 2022, pp. 964–996
    Special Issue on SoCG 2020

    [pdf] [arXiv] [doi]

  7. Sergio Cabello and Wolfgang Mulzer

    Minimum Cuts in Geometric Intersection Graphs

    Computational Geometry: Theory and Applications (CGTA), 94, 2021, Article 101720

    [pdf] [arXiv] [doi]

  8. Bahareh Banyassady, Luis Barba, and Wolfgang Mulzer

    Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees

    Journal of Computational Geometry (JoCG), 11(1), 2020, pp. 525–547

    [pdf] [arXiv] [doi]

  12. Jonas Cleve and Wolfgang Mulzer

    Combinatorics of Beacon-based Routing in Three Dimensions

    Computational Geometry: Theory and Applications (CGTA), 91, 2020, Article 101667

    [pdf] [arXiv] [doi]

  14. Wolfgang Mulzer and Natalia Shenkman

    A Constructive Proof of a Concentration Bound for Real-Valued Random Variables

    Information Processing Letters (IPL), 158, 2020, Article 105942

    [pdf] [arXiv] [doi]

  18. Wolfgang Mulzer and Yannik Stein

    Computational Aspects of the Colorful Carathéodory Theorem

    Discrete and Computational Geometry (DCG), 60(3), October 2018, pp. 720–755

    [pdf] [arXiv] [doi]

  24. Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, and Manuel Wettstein

    An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings

    International Journal of Computational Geometry and Applications (IJCGA), 27(1n2), 2017, pp. 57–83
    Special issue on ISAAC 2015

    [pdf] [arXiv] [doi]

  27. Karl Bringmann and Wolfgang Mulzer

    Approximability of the Discrete Fréchet Distance

    Journal of Computational Geometry (JoCG), 7(2), 2016, pp. 46–76
    Special issue on SoCG 2015

    [pdf] [doi]

  30. Wolfgang Mulzer and Yannik Stein

    Algorithms for Tolerant Tverberg Partitions

    International Journal of Computational Geometry and Applications (IJCGA), 24(4), 2014, pp. 261–273
    Special issue on ISAAC 2013

    [pdf] [arXiv] [doi]

  33. Maarten Löffler and Wolfgang Mulzer

    Unions of Onions: Preprocessing Imprecise Points for Fast Onion Decomposition

    Journal of Computational Geometry (JoCG), 5(1), 2014, pp. 1–13

    [pdf] [arXiv] [doi]

  34. Wolfgang Mulzer and Daniel Werner

    Approximating Tverberg Points in Linear Time for Any Fixed Dimension

    Discrete and Computational Geometry (DCG), 50(2), September 2013, pp. 520–535

    [pdf] [arXiv] [doi]

  36. Esther Ezra and Wolfgang Mulzer

    Convex Hull of Points Lying on Lines in o(n log n) Time after Preprocessing

    Computational Geometry: Theory and Applications (CGTA), 46(4), 2013, pp. 417–434
    Special issue on SoCG 2011

    [pdf] [arXiv] [doi]

  37. John Iacono and Wolfgang Mulzer

    A Static Optimality Transformation with Applications to Planar Point Location

    International Journal of Computational Geometry and Applications (IJCGA), 22(4), 2012, pp. 327–340
    Special issue on SoCG 2011

    [pdf] [arXiv] [doi]

  38. Maarten Löffler and Wolfgang Mulzer

    Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent

    SIAM Journal on Computing (SICOMP), 41(4), 2012, pp. 941–974

    [pdf] [arXiv] [doi]

  39. Tetsuo Asano, Wolfgang Mulzer, and Yajun Wang

    Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons

    Journal of Graph Algorithms and Applications (JGAA), 15(5), 2011, pp. 569–586
    Special issue on WALCOM 2010

    [pdf] [doi]

  41. Tetsuo Asano, Wolfgang Mulzer, Günter Rote, and Yajun Wang

    Constant-Work-Space Algorithms for Geometric Problems

    Journal of Computational Geometry (JoCG), 2(1), 2011, pp. 46–68

    [pdf] [doi]

  42. Bernard Chazelle and Wolfgang Mulzer

    Computing Hereditary Convex Structures

    Discrete and Computational Geometry (DCG), 45(4), June 2011, pp. 796–823
    Special Issue on SoCG 2009

    [pdf] [doi]

  43. Kevin Buchin and Wolfgang Mulzer

    Delaunay Triangulations in O(sort(n)) Time and More

    Journal of the Association for Computing Machinery (JACM), 58(2), April 2011, Article 6

    [pdf] [doi]

  45. 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] [doi]

  46. Wolfgang Mulzer

    A Note on Predecessor Searching in the Pointer Machine Model

    Information Processing Letters (IPL), 109(13), 2009, pp. 726–729

    [pdf] [doi]

Refereed Conferences:

  8. Wolfgang Mulzer and Max Willert

    Compact Routing in Unit Disk Graphs

    Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC), Hong Kong, 2020, pp. 16:1–16:14

    [pdf] [arXiv] [doi]

  9. Man-Kwun Chiu, Aruni Choudhary, and Wolfgang Mulzer

    Computational Complexity of the Alpha-Ham-Sandwich Problem

    Proceedings of the 47th International Colloquium on Automata, Languages and Programming (ICALP), Saarbrücken, Germany, 2020, pp. 31:1–31:18

    [pdf] [arXiv] [doi]

  10. Aruni Choudhary and Wolfgang Mulzer

    No-dimensional Tverberg Theorems and Algorithms

    Proceedings of the 36th International Symposium on Computational Geometry (SoCG), Zürich, Switzerland, 2020, pp. 31:1–31:17

    [pdf] [arXiv] [doi]

  11. Wolfgang Mulzer and Pavel Valtr

    Long Alternating Paths Exist

    Proceedings of the 36th International Symposium on Computational Geometry (SoCG), Zürich, Switzerland, 2020, pp. 57:1–57:16

    [pdf] [arXiv] [doi]

  12. Édouard Bonnet, Sergio Cabello, and Wolfgang Mulzer

    Maximum Matchings in Geometric Intersection Graphs

    Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science (STACS), Montpellier, France, 2020, pp. 31:1–31:17

    [pdf] [arXiv] [doi]

  16. Ke Chen, Adrian Dumitrescu, Wolfgang Mulzer, and Csaba D. Tóth

    On the Stretch Factor of Polygonal Chains

    Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science (MFCS), Aachen, Germany, 2019, pp. 56:1–56:14

    [pdf] [arXiv] [doi]

  17. Jonas Cleve and Wolfgang Mulzer

    An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant Workspace Model

    Proceedings of the Special Event on Analysis of Experimental Algorithms (SEA2), Kalmata, Greece, 2019, pp. 317–331

    [pdf] [arXiv] [doi]

  18. Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, and Wolfgang Mulzer

    Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead

    Proceedings of the 35th International Symposium on Computational Geometry (SoCG), Portland, USA, 2019, pp. 26:1–26:15

    [pdf] [arXiv1] [arXiv2] [doi]

  19. Luis Barba and Wolfgang Mulzer

    Asymmetric Convex Intersection Testing

    Proceedings of the 2nd Symposium on Simplicity in Algorithms (SOSA), San Diego, USA, 2019, pp. 9:1–9:14

    [pdf] [arXiv] [doi]

  22. Bahareh Banyassady, Luis Barba, and Wolfgang Mulzer

    Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees

    Proceedings of the 13th Latin American Theoretical Informatics Symposium (LATIN), Buenos Aires, Argentina, 2018, pp. 108–119

    [pdf] [arXiv] [doi]

  23. Jonas Cleve and Wolfgang Mulzer

    Combinatorics of Beacon-based Routing in Three Dimensions

    Proceedings of the 13th Latin American Theoretical Informatics Symposium (LATIN), Buenos Aires, Argentina, 2018, pp. 346–360

    [pdf] [arXiv] [doi]

  24. Katharina Klost and Wolfgang Mulzer

    Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors

    Proceedings of the 13th Latin American Theoretical Informatics Symposium (LATIN), Buenos Aires, Argentina, 2018, pp. 683–696

    [pdf] [arXiv] [doi]

  27. Marcel Ehrhardt and Wolfgang Mulzer

    Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space

    Proceedings of the 15th Algorithms and Data Structures Symposium (WADS), St John's, Canada, 2017, pp. 361–372

    [pdf] [doi]

  28. Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, and Wolfgang Mulzer

    Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon

    Proceedings of the 11th International Conference and Workshops on Algorithms and Computation (WALCOM), Hsinchu, Taiwan, 2017, pp. 308–319

    [pdf] [arXiv] [doi]

  33. Oswin Aichholzer, Vincent Kusters, Wolfgang Mulzer, Alexander Pilz, and Manuel Wettstein

    An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings

    Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC), Nagoya, Japan, 2015, pp. 505–516

    [pdf] [arXiv] [doi]

  35. Karl Bringmann and Wolfgang Mulzer

    Approximability of the Discrete Fréchet Distance

    Proceedings of the 31st International Symposium on Computational Geometry (SoCG), Eindhoven, The Netherlands, 2015, pp. 739–753

    [pdf] [doi]

  37. Wolfgang Mulzer and Yannik Stein

    Computational Aspects of the Colorful Carathéodory Theorem

    Proceedings of the 31st International Symposium on Computational Geometry (SoCG), Eindhoven, The Netherlands, 2015, pp. 44–58

    [pdf] [arXiv] [doi]

  39. Yves Brise, Kevin Buchin, Dustin Eversmann, Michael Hoffmann, and Wolfgang Mulzer

    Interference Minimization in Asymmetric Sensor Networks

    Proceedings of the 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), Wrozwław, Poland, 2014, pp. 135–151

    [pdf] [arXiv] [doi]

  41. Wolfgang Mulzer and Yannik Stein

    Algorithms for Tolerated Tverberg Partition

    Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC), Hong Kong, 2013, pp. 295–305

    [pdf] [arXiv] [doi]

  42. Oswin Aichholzer, Wolfgang Mulzer, and Alexander Pilz

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

    Proceedings of the 21st Annual European Symposium on Algorithms (ESA), Sophia Antipolis, France, 2013, pp. 13–24

    [pdf] [arXiv] [doi]

  45. Maarten Löffler and Wolfgang Mulzer

    Unions of Onions

    Proceedings of the 13th Algorithms and Data Structures Symposium (WADS), London, Canada, 2013, pp. 487–498

    [pdf] [arXiv] [doi]

  46. Bernard Chazelle and Wolfgang Mulzer

    Data Structures on Event Graphs

    Proceedings of the 20th Annual European Symposium on Algorithms (ESA), Ljubljana, Slovenia, 2012, pp. 313–324

    [pdf] [arXiv] [doi]

  47. Wolfgang Mulzer and Daniel Werner

    Approximating Tverberg Points in Linear Time for Any Fixed Dimension

    Proceedings of the 28th Annual Symposium on Computational Geometry (SoCG), Chapel Hill, USA, 2012, pp. 303–310

    [pdf] [arXiv] [doi]

  49. Esther Ezra and Wolfgang Mulzer

    Convex Hull of Imprecise Points in o(n log n) Time after Preprocessing

    Proceedings of the 27th Annual Symposium on Computational Geometry (SoCG), Paris, France, 2011, pp. 11–20

    [full version] [arXiv] [doi]

  50. Maarten Löffler and Wolfgang Mulzer

    Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent

    Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, USA, 2011, pp. 1759–1777

    [pdf] [arXiv] [doi]

  52. 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] [doi]

  53. 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] [doi]

  54. Bernard Chazelle and Wolfgang Mulzer

    Computing Hereditary Convex Structures

    Proceedings of the 25th Annual Symposium on Computational Geometry (SoCG), Aarhus, Denmark, 2009, pp. 61–70

    [pdf] [doi]

  55. Bernard Chazelle and Wolfgang Mulzer

    Markov Incremental Constructions

    Proceedings of the 24th Annual Symposium on Computational Geometry (SoCG), College Park, USA, 2008, pp. 156–163

    [pdf] [doi]

Weakly-Refereed Conferences and Workshops:

  1. Katharina Klost and Wolfgang Mulzer

    Robust Algorithms for Finding Triangles and Computing the Girth in Unit Disk and Transmission Graphs

    Proceedings of the 40th European Workshop on Computational Geometry (EWCG), Ioannina, Greece, 2024, 53:1–53:7

    [pdf]

  4. Michaela Borzechowski and Wolfgang Mulzer

    Unique Sink Orientations of Grids is in Unique End of Potential Line

    Proceedings of the 38th European Workshop on Computational Geometry (EWCG), Perugia, Italy, 2022, 34:1–34:8

    [pdf] [arXiv]

  10. Man-Kwun Chiu, Aruni Choudhary, and Wolfgang Mulzer

    Computational Complexity of the Alpha-Ham-Sandwich Problem

    Proceedings of the 36th European Workshop on Computational Geometry (EWCG), Würzburg, Germany, 2020, 33:1–33:8

    [pdf] [arXiv]

  11. Wolfgang Mulzer and Max Willert

    Headerless Routing in Unit Disk Graphs

    Proceedings of the 36th European Workshop on Computational Geometry (EWCG), Würzburg, Germany, 2020, 54:1–54:6

    [pdf] [arXiv]

  13. Wolfgang Mulzer and Johannes Obenaus

    The Tree Stabbing Number is not Monotone

    Proceedings of the 36th European Workshop on Computational Geometry (EWCG), Würzburg, Germany, 2020, 78:1–78:8

    [pdf] [arXiv]

  16. Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, and Wolfgang Mulzer

    Dynamic Maintenance of the Lower Envelope of Pseudo-Lines

    Proceedings of the 35th European Workshop on Computational Geometry (EWCG), Utrecht, The Netherlands, 2019, 27:1–7

    [pdf] [arXiv1] [arXiv2]

  17. Alexander Kauer and Wolfgang Mulzer

    Dynamic Disk Connectivity

    Proceedings of the 35th European Workshop on Computational Geometry (EWCG), Utrecht, The Netherlands, 2019, 50:1–6

    [pdf]

  21. Jonas Cleve and Wolfgang Mulzer

    Combinatorics of Beacon-based Routing in Three Dimensions

    Proceedings of the 34th European Workshop on Computational Geometry (EWCG), Berlin, Germany, 2018, pp. 48:1–6

    [pdf] [arXiv]

  22. Luis Barba, Bahareh Banyassady, and Wolfgang Mulzer

    Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees

    Proceedings of the 34th European Workshop on Computational Geometry (EWCG), Berlin, Germany, 2018, pp. 51:1–6

    [pdf] [arXiv]

  23. Haim Kaplan, Katharina Klost, Wolfgang Mulzer, and Liam Roditty

    Finding the Girth in Disk Graphs and a Directed Triangle in Transmission Graphs

    Proceedings of the 34th European Workshop on Computational Geometry (EWCG), Berlin, Germany, 2018, pp. 68:1–6

    [pdf] [arXiv]

  25. Jonas Cleve and Wolfgang Mulzer

    An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant Workspace Model

    Proceedings of the 33rd European Workshop on Computational Geometry (EWCG), Malmö, Sweden, 2017, pp. 165–168

    [pdf] [arXiv]

  27. Marcel Ehrhardt and Wolfgang Mulzer

    Delta-Fast Tries: Local Searches in Bounded Universes with Linear Space

    Proceedings of the 33rd European Workshop on Computational Geometry (EWCG), Malmö, Sweden, 2017, pp. 257–260

    [pdf]

  28. Bahareh Banyassady and Wolfgang Mulzer

    A Simple Analysis of Rabin's Algorithm for Finding Closest Pairs

    Proceedings of the 33rd European Workshop on Computational Geometry (EWCG), Malmö, Sweden, 2017, pp. 261–264

    [pdf]

  31. Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, and Wolfgang Mulzer

    Finding the k-Visibility Region of a Point in a Simple Polygon in the Memory-Constrained Model

    Proceedings of the 32nd European Workshop on Computational Geometry (EWCG), Lugano, Switzerland, 2016

    [pdf] [arXiv]

  33. Wolfgang Mulzer and Yannik Stein

    Approximating the Colorful Carathéodory Theorem

    Proceedings of the 31st European Workshop on Computational Geometry (EWCG), Ljubljana, Slovenia, 2015, pp. 20–23

    [pdf] [arXiv]

  34. Heuna Kim, Wolfgang Mulzer, and Eunjin Oh

    The Number of Combinatorially Different Convex Hulls of Points in Lines

    Proceedings of the 31st European Workshop on Computational Geometry (EWCG), Ljubljana, Slovenia, 2015, pp. 161–164

    [pdf]

  35. Haim Kaplan, Wolfgang Mulzer, Liam Roditty, and Paul Seiferth

    Efficient Spanner Construction for Directed Transmission Graphs

    Proceedings of the 31st European Workshop on Computational Geometry (EWCG), Ljubljana, Slovenia, 2015, pp. 172–175

    [pdf] [arXiv]

  37. Panos Giannopoulos, Maximilian Konzack, and Wolfgang Mulzer

    Low-Crossing Spanning Trees: an Alternative Proof and Experiments

    Proceedings of the 30th European Workshop on Computational Geometry (EWCG), Ein-Gedi, Israel, 2014

    [pdf]

  40. Wolfgang Mulzer and Yannik Stein

    Complexity of Finding Nearest Colorful Polytopes

    Proceedings of the 30th European Workshop on Computational Geometry (EWCG), Ein-Gedi, Israel, 2014

    [pdf] [arXiv]

  41. Maarten Löffler and Wolfgang Mulzer

    Unions of Onions

    Proceedings of the 29th European Workshop on Computational Geometry (EWCG), Brunswick, Germany, 2013, pp. 61–64

    [pdf] [arXiv]

  42. Oswin Aichholzer, Wolfgang Mulzer, and Alexander Pilz

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

    Proceedings of the 29th European Workshop on Computational Geometry (EWCG), Brunswick, Germany, 2013, pp. 115–118

    [pdf] [arXiv]

  43. Wolfgang Mulzer and Paul Seiferth

    Computational Aspects of Triangulations with Bounded Dilation

    Proceedings of the 29th European Workshop on Computational Geometry (EWCG), Brunswick, Germany, 2013, pp. 123–126

    [pdf]

  46. Wolfgang Mulzer and Daniel Werner

    A Lower Bound for Shallow Partitions

    Proceedings of the 28th European Workshop on Computational Geometry (EWCG), Assisi, Italy, 2012, pp. 129–132

    [pdf] [arXiv]

  47. Wolfgang Mulzer and Daniel Werner

    Approximating Tverberg Points in Linear Time for Any Fixed Dimension

    Proceedings of the 28th European Workshop on Computational Geometry (EWCG), Assisi, Italy, 2012, pp. 165–168

    [pdf] [arXiv]

  48. Esther Ezra and Wolfgang Mulzer

    Convex Hull of Imprecise Points in o(n log n) Time after Preprocessing

    Proceedings of the 27th European Workshop on Computational Geometry (EWCG), Morschach, Switzerland, 2011, pp. 209–212

    [pdf] [arXiv]

  49. 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]

  50. 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:

  1. Sergio Cabello and Wolfgang Mulzer

    Maximum matching in disk graphs of bounded depth

    Talk presented at the XVIII Spanish Meeting on Computational Geometry (EGC), Girona, Spain, 2019, p. 4

    [pdf] [link]

  2. Sebastian Kürten and Wolfgang Mulzer

    LiveCG: an Interactive Visualization Environment for Computational Geometry

    Multimedia Proceedings of the 30 Annual ACM Symposium on Computational Geometry (SoCG), Kyoto, Japan, 2014, pp. 86–87

    [pdf] [video] [link] [doi]

  3. Wolfgang Mulzer

    Low-Entropy Computational Geometry

    Doctoral Thesis. Princeton University, 2010

    [pdf]

  4. Tetsuo Asano, Wolfgang Mulzer, and Yajun Wang

    A Constant-Work-Space Algorithm for Shortest Paths in Simple Polygons

    Accompanying an invited talk in Proceedings of the 4th Workshop on Algorithms and Computation (WALCOM), Dhaka, Bangladesh, 2010, pp. 9–20

    [Journal PDF] [doi]

  5. Christian Knauer and Wolfgang Mulzer

    Minimum Dilation Triangulations

    Technical Report B-05-06. Freie Universität Berlin, April 2005

    [ps.gz]

  6. Wolfgang Mulzer

    Minimum Dilation Triangulations for the Regular n-Gon

    Masters Thesis. Freie Universität Berlin, 2004

    [pdf]

Teaching Notes

AlP 3:


Algorithmische Geometrie:


Höhere Algorithmik:


GTI:


Miscellaneous: