Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Computational Aspects of the Colorful Carathéodory Theorem.

W. Mulzer, and Y. Stein. Symposium on Computational Geometry, volume 34 of LIPIcs, page 44-58. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Stein University of Stuttgart

Yannik Wohnsdorf University of Stuttgart

Franziska Stein University of Stuttgart

Yannik Feldner University of Stuttgart

Felix Stein University of Stuttgart

Other publications of authors with the same name

Computational Aspects of the Colorful Caratheodory Theorem.W. Mulzer, and Y. Stein. CoRR, (2014)Algorithms for Tolerant Tverberg Partitions.W. Mulzer, and Y. Stein. Int. J. Comput. Geometry Appl., 24 (4): 261-274 (2014)Routing in Polygons with Holes.M. Korman, W. Mulzer, A. van Renssen, M. Roeloffzen, P. Seiferth, Y. Stein, B. Vogtenhuber, and M. Willert. CoRR, (2017)The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications.F. Meunier, W. Mulzer, P. Sarrabezolles, and Y. Stein. SODA, page 1342-1351. SIAM, (2017)Time-space trade-offs for triangulations and Voronoi diagrams.M. Korman, W. Mulzer, A. van Renssen, M. Roeloffzen, P. Seiferth, and Y. Stein. Comput. Geom., (2018)Computational Aspects of the Colorful Carathéodory Theorem.W. Mulzer, and Y. Stein. Symposium on Computational Geometry, volume 34 of LIPIcs, page 44-58. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2015)Approximate k-flat Nearest Neighbor Search.W. Mulzer, H. Nguyên, P. Seiferth, and Y. Stein. STOC, page 783-792. ACM, (2015)Improved time-space trade-offs for computing Voronoi diagrams.B. Banyassady, M. Korman, W. Mulzer, A. van Renssen, M. Roeloffzen, P. Seiferth, and Y. Stein. JoCG, 9 (1): 191-212 (2018)Algorithms for Tolerated Tverberg Partitions.W. Mulzer, and Y. Stein. ISAAC, volume 8283 of Lecture Notes in Computer Science, page 295-305. Springer, (2013)Routing in Polygonal Domains.B. Banyassady, M. Chiu, M. Korman, W. Mulzer, A. van Renssen, M. Roeloffzen, P. Seiferth, Y. Stein, B. Vogtenhuber, and M. Willert. ISAAC, volume 92 of LIPIcs, page 10:1-10:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)