Hans Raj Tiwary

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