Hans Raj Tiwary On the hardness of minkowski addition and related operations. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2007, pp:306-309 [Conf]
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. [Citation Graph (, )][DBLP]
Complexity of Approximating the Vertex Centroid of a Polyhedron. [Citation Graph (, )][DBLP]
Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra [Citation Graph (, )][DBLP]
On Computing the Shadows and Slices of Polytopes [Citation Graph (, )][DBLP]
On Computing the Vertex Centroid of a Polyhedron [Citation Graph (, )][DBLP]
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP