Hans Raj Tiwary

From MaRDI portal
Person:450532

Available identifiers

zbMath Open tiwary.hans-rajWikidataQ102407872 ScholiaQ102407872MaRDI QIDQ450532

List of research outcomes





PublicationDate of PublicationType
On permuting some coordinates of polytopes2023-08-03Paper
On the complexity of some facet-defining inequalities of the QAP-polytope2023-03-21Paper
https://portal.mardi4nfdi.de/entity/Q50892182022-07-18Paper
On the extension complexity of scheduling polytopes2021-04-07Paper
https://portal.mardi4nfdi.de/entity/Q33866302021-01-05Paper
Extension complexity of formal languages2020-07-02Paper
Polynomial size linear programs for problems in \textsc{P}2019-07-17Paper
Compact linear programs for 2SAT2019-07-10Paper
Parameterized extension complexity of independent set and related problems2018-09-17Paper
Extension Complexity, MSO Logic, and Treewidth2017-10-17Paper
Extension complexities of Cartesian products involving a pyramid2017-09-19Paper
On the \({\mathcal {H}}\)-free extension complexity of the TSP2017-04-05Paper
Exponential lower bounds for polytopes in combinatorial optimization2016-03-24Paper
Extended formulations, nonnegative factorizations, and randomized communication protocols2015-10-14Paper
On the extension complexity of combinatorial polytopes2015-10-14Paper
A generalization of extension complexity that captures P2015-05-21Paper
Generalized probabilistic theories and conic extensions of polytopes2015-02-06Paper
Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism2014-06-16Paper
A proof of the Oja depth conjecture in the plane2014-05-19Paper
Linear vs. semidefinite extended formulations2014-05-13Paper
On the largest convex subsets in Minkowski sums2014-04-30Paper
On the extension complexity of combinatorial polytopes2013-08-06Paper
Extended formulations, nonnegative factorizations, and randomized communication protocols2012-11-02Paper
Extended formulations for polygons2012-10-15Paper
Largest inscribed rectangles in convex polygons2012-09-13Paper
Complexity of approximating the vertex centroid of a polyhedron2012-03-13Paper
https://portal.mardi4nfdi.de/entity/Q31137272012-01-23Paper
The negative cycles polyhedron and hardness of checking some polyhedral properties2011-11-17Paper
On a cone covering problem2011-01-21Paper
Complexity of Approximating the Vertex Centroid of a Polyhedron2009-12-17Paper
On Computing the Centroid of the Vertices of an Arrangement and Related Problems2009-02-17Paper
On the hardness of minkowski addition and related operations2009-02-12Paper
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism2009-02-12Paper
On the hardness of computing intersection, union and Minkowski sum of polytopes2008-12-02Paper

Research outcomes over time

This page was built for person: Hans Raj Tiwary