Your search returned the following 10 documents:

10. Complexity of Approximating the Vertex Centroid of a Polyhedron
    Khaled Elbassioni and Hans Raj Tiwary
    Theoretical Computer Science 421: 56-61, 2012
    
9. Largest Inscribed Rectangles in Convex Polygons
   Christian Knauer, Lena Schlipf, Jens M. Schmidt, and Hans Raj Tiwary
   Journal of Discrete Algorithms 13: 78-85, 2012
   
8. On a cone covering problem
   Khaled Elbassioni and Hans Raj Tiwary
   Computational Geometry 44 (3): 129-134, 2011
   
7. The negative cycles polyhedron and hardness of checking some polyhedral properties
   Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Hans Raj Tiwary
   Annals of Operations Research 188 (1): 63-76, 2011
   
6. Complexity of Approximating the Vertex Centroid of a Polyhedron
   Khaled Elbassioni and Hans Raj Tiwary
   In: Algorithms and Computation, 20th International Symposium (ISAAC), Honolulu, Hawaii, USA, 2009, 413-422
   
5. On Computing the Centroid of the Vertices of an Arrangement and Related Problems
   Deepak Ajwani, Saurabh Ray, Raimund Seidel, and Hans Raj Tiwary
   In: 10th Workshop on Algorithms and Data Structures (WADS), Halifax, Canada, 2007, 519-528
   
4. Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
   Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Hans Raj Tiwary
   CoRR abs/0801.3790, 2008
   
3. On a Cone Covering Problem
   Khaled Elbassioni and Hans Raj Tiwary
   In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, Montreal, Canada, 2008, 171-174
   
2. On Computing the Vertex Centroid of a Polyhedron
   Khaled Elbassioni and Hans Raj Tiwary
   CoRR abs/0806.3456, 2008
   
1. On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
   Hans Raj Tiwary and Khaled Elbassioni
   In: Symposium on Computational Geometry 2008, College Park, MD, USA,, 2008, 192-198