Author of the publication

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.

 

Other publications of authors with the same name

Shellability is NP-complete., , , , and . CoRR, (2017)Multilevel Polynomial Partitions and Simplified Range Searching., and . Discret. Comput. Geom., 54 (1): 22-41 (2015)Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex., , , , and . Discret. Comput. Geom., 54 (3): 610-636 (2015)Shellability is NP-complete., , , , and . J. ACM, 66 (3): 21:1-21:18 (2019)Barycentric Cuts Through a Convex Body., , and . SoCG, volume 164 of LIPIcs, page 62:1-62:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Bounding Helly Numbers via Betti Numbers., , , , and . SoCG, volume 34 of LIPIcs, page 507-521. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane., , , , and . J. Graph Algorithms Appl., 21 (5): 939-981 (2017)Barycentric Cuts Through a Convex Body., , and . Discret. Comput. Geom., 68 (4): 1133-1154 (2022)On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result., , , , , and . SoCG, volume 34 of LIPIcs, page 476-490. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)A Stepping-Up Lemma for Topological Set Systems., , and . SoCG, volume 189 of LIPIcs, page 40:1-40:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)