Polymake: an approach to modular software design in computational geometry
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Generating all vertices of a polyhedron is hard
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the hardness of minkowski addition and related operations
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Counting solutions of integer programs using unrestricted subtree detection
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Enumerating trichromatic triangles containing the origin in linear time
Journal of Discrete Algorithms
| Hi-index | 0.00 |