 | 2009 |
|---|
| 9 |       | Khaled M. Elbassioni,
Hans Raj Tiwary:
Complexity of Approximating the Vertex Centroid of a Polyhedron.
ISAAC 2009: 413-422 |
| 2008 |
|---|
| 8 |  | Khaled M. Elbassioni,
Hans Raj Tiwary:
On a Cone Covering Problem.
CCCG 2008 |
| 7 | | Hans Raj Tiwary,
Khaled M. Elbassioni:
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism.
Symposium on Computational Geometry 2008: 192-198 |
| 6 | | Endre Boros,
Khaled M. Elbassioni,
Vladimir Gurvich,
Hans Raj Tiwary:
Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra
CoRR abs/0801.3790: (2008) |
| 5 | | Hans Raj Tiwary:
On Computing the Shadows and Slices of Polytopes
CoRR abs/0804.4150: (2008) |
| 4 | | Khaled M. Elbassioni,
Hans Raj Tiwary:
On Computing the Vertex Centroid of a Polyhedron
CoRR abs/0806.3456: (2008) |
| 3 | | Hans Raj Tiwary:
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes.
Discrete & Computational Geometry 40(3): 469-479 (2008) |
| 2007 |
|---|
| 2 | | Hans Raj Tiwary:
On the hardness of minkowski addition and related operations.
Symposium on Computational Geometry 2007: 306-309 |
| 1 | | Deepak Ajwani,
Saurabh Ray,
Raimund Seidel,
Hans Raj Tiwary:
On Computing the Centroid of the Vertices of an Arrangement and Related Problems.
WADS 2007: 519-528 |
