Institut für Informatik, AG TI
Freie Universität Berlin
Takustr. 9
14195 Berlin, Germany

Journals

• Time-Space Trade-offs for Triangulations and Voronoi Diagrams

  Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, and Yannik Stein. Computational Geometry: Theory and Applications (CGTA), special issue on EWCG 2015, to appear.

  [pdf] [arXiv] [doi]

• Algorithms for Tolerant Tverberg Partitions

  Wolfgang Mulzer and Yannik Stein. International Journal of Computational Geometry and Applications (IJCGA), 24(4), 2014, pp. 261–273, special issue on ISAAC 2013.

  [pdf] [arXiv] [doi]

Refereed Conferences

• Improved Time-Space Trade-offs for Computing Voronoi Diagrams

  Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, and Yannik Stein. Proceedings of the 34th International Symposium on Theoretical Aspects of Computer Science (STACS), Hannover, Germany, 2017, to appear.

• The Rainbow at the End of the Line — A PPAD Formulation of the Colorful Carathéodory Theorem with Applications

  Frédéric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles, and Yannik Stein. Proceedings of the 28th ACM-SIAM Symposium on Discrete Algorithms (SODA), Barcelona, Spain, 2017, pp. 1342–1351.

  [pdf] [arXiv] [doi]

• Time-Space Trade-offs for Triangulations and Voronoi Diagrams

  Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, and Yannik Stein. Proceedings of the 14th Algorithms and Data Structures Symposium (WADS), Victoria, Canada, 2015, pp. 482–494.

  [pdf] [arXiv] [doi]

• Computational Aspects of the Colorful Carathéodory Theorem

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

  [pdf] [arXiv] [doi]

• Approximate k-flat Nearest Neighbor Search

  Wolfgang Mulzer, Huy L. Nguyen, Paul Seiferth, and Yannik Stein. Proceedings of the 47th ACM Symposium on Theory of Computing (STOC), Portland, USA, 2015, pp. 783–792.

  [pdf] [arXiv] [doi]

• Algorithms for Tolerated Tverberg Partitions

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

  [pdf] [arXiv] [doi]

Weakly-Refereed Conferences and Workshops

• Approximating the Simplicial Depth in High Dimensions

  Peyman Afshani, Don Sheehy, and Yannik Stein. Proceedings of the 32nd European Workshop on Computational Geometry (EWCG), Lugano, Switzerland.

  [pdf]

• Generalized Colorful Linear Programming and Further Applications

  Frédéric Meunier, Wolfgang Mulzer, Pauline Sarrabezolles, and Yannik Stein. Proceedings of the 32nd European Workshop on Computational Geometry (EWCG), Lugano, Switzerland.

  [pdf]

• Time-Space Trade-offs for Voronoi Diagrams

  Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, and Yannik Stein. Proceedings of the 31st European Workshop on Computational Geometry (EWCG), Ljubljana, Slovenia, 2015.

  [pdf]

• Approximating the Colorful Carathéodory Theorem

  Wolfgang Mulzer and Yannik Stein. Proceedings of the 31st European Workshop on Computational Geometry (EWCG), Ljubljana, Slovenia, 2015.

  [pdf]

• Complexity of Finding Nearest Colorful Polytopes

  Wolfgang Mulzer and Yannik Stein. Proceedings of the 30th European Workshop on Computational Geometry (EWCG), Ein-Gedi, Israel, 2014.

  [pdf]

Technical Reports & Misc.

• The Colorful Carathéodory Problem and its Descendants

  PhD thesis. Freie Universität Berlin, 2016.

  [FU document server]

• Approximating the Simplicial Depth

  Peyman Afshani, Donald R. Sheehy, and Yannik Stein, 2015.

  [pdf] [arXiv]

• Tolerated Tverberg Partitions: An Algorithmic Approach

  Masters thesis. Freie Universität Berlin, 2013.

  [pdf]

• ProInformatik I: Logik und Diskrete Mathematik (2016)
• Höhere Algorithmik II (SS 15)
• Ausgewählte Themen der Algorithmik: Datenstrukturen (SS 14)
• Seminar über Algorithmen (WS 13/14)