Author of the publication

On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems.

, , and . STACS, volume 9 of LIPIcs, page 649-660. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)

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

Extension Complexity, MSO Logic, and Treewidth., , and . Discret. Math. Theor. Comput. Sci., (2020)On the hardness of minkowski addition and related operations.. SCG, page 306-309. ACM, (2007)Complexity of Approximating the Vertex Centroid of a Polyhedron., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 413-422. Springer, (2009)On Computing the Vertex Centroid of a Polyhedron, and . CoRR, (2008)Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach., , and . MFCS, volume 170 of LIPIcs, page 50:1-50:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On Permuting Some Coordinates of Polytopes.. ISCO, volume 13526 of Lecture Notes in Computer Science, page 102-114. Springer, (2022)Extension Complexity, MSO Logic, and Treewidth ., , and . SWAT, volume 53 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Extension Complexity of Combinatorial Polytopes., and . ICALP (1), volume 7965 of Lecture Notes in Computer Science, page 57-68. Springer, (2013)On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems., , and . STACS, volume 9 of LIPIcs, page 649-660. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Generalised probabilistic theories and conic extensions of polytopes., , , and . CoRR, (2013)