On the hardness of minkowski addition and related operations. - Hans Raj Tiwary (SCG, 2007)

On Computing the Centroid of the Vertices of an Arrangement and Related Problems. - Deepak Ajwani; Saurabh Ray; Raimund Seidel; Hans Raj Tiwary (WADS, 2007)

On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. - Hans Raj Tiwary; Khaled M. Elbassioni (SCG, 2008)

Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Hans Raj Tiwary (CoRR, 2008)

On Computing the Shadows and Slices of Polytopes - Hans Raj Tiwary (CoRR, 2008)

On Computing the Vertex Centroid of a Polyhedron - Khaled M. Elbassioni; Hans Raj Tiwary (CoRR, 2008)

On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes. - Hans Raj Tiwary (Discret. Comput. Geom., 2008)

Complexity of some polyhedral enumeration problems. - Hans Raj Tiwary (2008)

On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. - Christian Knauer; Hans Raj Tiwary; Daniel Werner (STACS, 2011)

The negative cycles polyhedron and hardness of checking some polyhedral properties. - Endre Boros; Khaled M. Elbassioni; Vladimir Gurvich; Hans Raj Tiwary (Ann. Oper. Res., 2011)

On a cone covering problem. - Khaled M. Elbassioni; Hans Raj Tiwary (Comput. Geom., 2011)

Extended formulations, non-negative factorizations and randomized communication protocols - Yuri Faenza; Samuel Fiorini; Roland Grappe; Hans Raj Tiwary (CoRR, 2011)

Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. - Samuel Fiorini; Serge Massar; Sebastian Pokutta; Hans Raj Tiwary; Ronald de Wolf (STOC, 2012)

Extended Formulations for Polygons. - Samuel Fiorini; Thomas Rothvoß; Hans Raj Tiwary (Discret. Comput. Geom., 2012)

Largest inscribed rectangles in convex polygons. - Christian Knauer; Lena Schlipf; Jens M. Schmidt; Hans Raj Tiwary (J. Discrete Algorithms, 2012)

Complexity of approximating the vertex centroid of a polyhedron. - Khaled M. Elbassioni; Hans Raj Tiwary (Theor. Comput. Sci., 2012)

Generalised probabilistic theories and conic extensions of polytopes. - Samuel Fiorini; Serge Massar; Manas K. Patra; Hans Raj Tiwary (CoRR, 2013)

A proof of the Oja depth conjecture in the plane. - Nabil H. Mustafa; Hans Raj Tiwary; Daniel Werner (Comput. Geom., 2014)

Polynomial size linear programs for non-bipartite matching problems and other problems in P. - David Avis; David Bremner; Hans Raj Tiwary; Osamu Watanabe 001 (CoRR, 2014)

Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism. - Hans Raj Tiwary; Khaled M. Elbassioni (Graphs Comb., 2014)

On the largest convex subsets in Minkowski sums. - Hans Raj Tiwary (Inf. Process. Lett., 2014)

A generalization of extension complexity that captures P. - David Avis; Hans Raj Tiwary (Inf. Process. Lett., 2015)

Exponential Lower Bounds for Polytopes in Combinatorial Optimization. - Samuel Fiorini; Serge Massar; Sebastian Pokutta; Hans Raj Tiwary; Ronald de Wolf (J. ACM, 2015)

On the extension complexity of combinatorial polytopes. - David Avis; Hans Raj Tiwary (Math. Program., 2015)

Extended formulations, nonnegative factorizations, and randomized communication protocols. - Yuri Faenza; Samuel Fiorini; Roland Grappe; Hans Raj Tiwary (Math. Program., 2015)

Extension Complexity and Formal Languages. - Hans Raj Tiwary (CoRR, 2016)

Extension complexities of Cartesian products involving a pyramid. - Hans Raj Tiwary; Stefan Weltge; Rico Zenklusen (Inf. Process. Lett., 2017)

On the ℋ-free extension complexity of the TSP. - David Avis; Hans Raj Tiwary (Optim. Lett., 2017)

Parameterized extension complexity of independent set and related problems. - Jakub Gajarský; Petr Hlinený; Hans Raj Tiwary (Discret. Appl. Math., 2018)

On the extension complexity of scheduling. - Hans Raj Tiwary; Victor Verdugo; Andreas Wiese (CoRR, 2019)

Polynomial size linear programs for problems in P. - David Avis; David Bremner; Hans Raj Tiwary; Osamu Watanabe 001 (Discret. Appl. Math., 2019)

Compact linear programs for 2SAT. - David Avis; Hans Raj Tiwary (Eur. J. Comb., 2019)

On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope. - Pawan Aurora; Hans Raj Tiwary (COCOA, 2020)

Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. - Lars Jaffke; Mateus de Oliveira Oliveira; Hans Raj Tiwary (MFCS, 2020)

Extension Complexity, MSO Logic, and Treewidth. - Petr Kolman; Martin Koutecký; Hans Raj Tiwary (Discret. Math. Theor. Comput. Sci., 2020)

Extension Complexity of Formal Languages. - Hans Raj Tiwary (Theory Comput. Syst., 2020)

On the extension complexity of scheduling polytopes. - Hans Raj Tiwary; Victor Verdugo; Andreas Wiese (Oper. Res. Lett., 2020)

Terrain prickliness: theoretical grounds for low complexity viewsheds. - Ankush Acharyya; Ramesh K. Jallu; Maarten Löffler; Gert G. T. Meijer; Maria Saumell; Rodrigo I. Silveira; Frank Staals; Hans Raj Tiwary (CoRR, 2021)

On Permuting Some Coordinates of Polytopes. - Hans Raj Tiwary (ISCO, 2022)