Hans Raj Tiwary

Publication Activity (10 Years)

Years Active: 2007-2022
Publications (10 Years): 19

Top Topics

Monadic Datalog

Communication Protocols

Graph Isomorphism

Top Venues

Inf. Process. Lett.

Discret. Appl. Math.

Publications

Hans Raj Tiwary
On Permuting Some Coordinates of Polytopes. ISCO (2022)
Ankush Acharyya, Ramesh K. Jallu, Maarten Löffler, Gert G. T. Meijer, Maria Saumell, Rodrigo I. Silveira, Frank Staals, Hans Raj Tiwary
Terrain prickliness: theoretical grounds for low complexity viewsheds. CoRR (2021)
Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. CoRR (2020)
Lars Jaffke, Mateus de Oliveira Oliveira, Hans Raj Tiwary
Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach. MFCS (2020)
Hans Raj Tiwary
Extension Complexity of Formal Languages. Theory Comput. Syst. 64 (5) (2020)
Pawan Aurora, Hans Raj Tiwary
On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope. COCOA (2020)
Hans Raj Tiwary, Victor Verdugo, Andreas Wiese
On the extension complexity of scheduling polytopes. Oper. Res. Lett. 48 (4) (2020)
Pawan Aurora, Hans Raj Tiwary
On the Complexity of Some Facet-Defining Inequalities of the QAP-polytope. CoRR (2020)
Petr Kolman, Martin Koutecký, Hans Raj Tiwary
Extension Complexity, MSO Logic, and Treewidth. Discret. Math. Theor. Comput. Sci. 22 (4) (2020)
Hans Raj Tiwary, Victor Verdugo, Andreas Wiese
On the extension complexity of scheduling. CoRR (2019)
David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe
Polynomial size linear programs for problems in P. Discret. Appl. Math. 265 (2019)
David Avis, Hans Raj Tiwary
Compact linear programs for 2SAT. Eur. J. Comb. 80 (2019)
Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary
Parameterized extension complexity of independent set and related problems. Discret. Appl. Math. 248 (2018)
Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen
Extension complexities of Cartesian products involving a pyramid. Inf. Process. Lett. 128 (2017)
David Avis, Hans Raj Tiwary
Compact linear programs for 2SAT. CoRR (2017)
David Avis, Hans Raj Tiwary
On the ℋ-free extension complexity of the TSP. Optim. Lett. 11 (3) (2017)
Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen
Extension complexities of Cartesian products involving a pyramid. CoRR (2017)
Petr Kolman, Martin Koutecký, Hans Raj Tiwary
Extension Complexity, MSO Logic, and Treewidth . SWAT (2016)
Hans Raj Tiwary
Extension Complexity and Formal Languages. CoRR (2016)
Jakub Gajarský, Petr Hlinený, Hans Raj Tiwary
Parameterized Extension Complexity of Independent Set and Related Problems. CoRR (2015)
Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary
Extended formulations, nonnegative factorizations, and randomized communication protocols. Math. Program. 153 (1) (2015)
Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf
Exponential Lower Bounds for Polytopes in Combinatorial Optimization. J. ACM 62 (2) (2015)
Petr Kolman, Martin Koutecký, Hans Raj Tiwary
Extension Complexity, MSO Logic, and Treewidth. CoRR (2015)
David Avis, Hans Raj Tiwary
On the H-Free Extension Complexity of the TSP. CoRR (2015)
David Avis, Hans Raj Tiwary
On the extension complexity of combinatorial polytopes. Math. Program. 153 (1) (2015)
David Avis, Hans Raj Tiwary
A generalization of extension complexity that captures P. Inf. Process. Lett. 115 (6-8) (2015)
David Avis, Hans Raj Tiwary
A generalization of extension complexity that captures $P$. CoRR (2014)
Hans Raj Tiwary, Khaled M. Elbassioni
Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism. Graphs Comb. 30 (3) (2014)
David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe
Polynomial size linear programs for non-bipartite matching problems and other problems in P. CoRR (2014)
Hans Raj Tiwary
On the largest convex subsets in Minkowski sums. Inf. Process. Lett. 114 (8) (2014)
Nabil H. Mustafa, Hans Raj Tiwary, Daniel Werner
A proof of the Oja depth conjecture in the plane. Comput. Geom. 47 (6) (2014)
David Avis, Hans Raj Tiwary
On the extension complexity of combinatorial polytopes CoRR (2013)
David Avis, Hans Raj Tiwary
On the Extension Complexity of Combinatorial Polytopes. ICALP (1) (2013)
Samuel Fiorini, Serge Massar, Manas K. Patra, Hans Raj Tiwary
Generalised probabilistic theories and conic extensions of polytopes. CoRR (2013)
Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols. ISCO (2012)
Samuel Fiorini, Thomas Rothvoß, Hans Raj Tiwary
Extended Formulations for Polygons. Discret. Comput. Geom. 48 (3) (2012)
Khaled M. Elbassioni, Hans Raj Tiwary
Complexity of approximating the vertex centroid of a polyhedron. Theor. Comput. Sci. 421 (2012)
Christian Knauer, Lena Schlipf, Jens M. Schmidt, Hans Raj Tiwary
Largest inscribed rectangles in convex polygons. J. Discrete Algorithms 13 (2012)
Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. STOC (2012)
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary
The negative cycles polyhedron and hardness of checking some polyhedral properties. Ann. Oper. Res. 188 (1) (2011)
Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf
Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds CoRR (2011)
Samuel Fiorini, Thomas Rothvoß, Hans Raj Tiwary
Extended formulations for polygons CoRR (2011)
Christian Knauer, Hans Raj Tiwary, Daniel Werner
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. STACS (2011)
Khaled M. Elbassioni, Hans Raj Tiwary
On a cone covering problem. Comput. Geom. 44 (3) (2011)
Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary
Extended formulations, non-negative factorizations and randomized communication protocols CoRR (2011)
Khaled M. Elbassioni, Hans Raj Tiwary
Complexity of Approximating the Vertex Centroid of a Polyhedron. ISAAC (2009)
Khaled M. Elbassioni, Hans Raj Tiwary
On a Cone Covering Problem. CCCG (2008)
Hans Raj Tiwary, Khaled M. Elbassioni
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism. SCG (2008)
Hans Raj Tiwary
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes. Discret. Comput. Geom. 40 (3) (2008)
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 (2008)
Khaled M. Elbassioni, Hans Raj Tiwary
On Computing the Vertex Centroid of a Polyhedron CoRR (2008)
Hans Raj Tiwary
On Computing the Shadows and Slices of Polytopes CoRR (2008)
Hans Raj Tiwary
On the hardness of minkowski addition and related operations. SCG (2007)
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary
On Computing the Centroid of the Vertices of an Arrangement and Related Problems. WADS (2007)