Hans Raj Tiwary

Available identifiers

zbMath Open tiwary.hans-rajWikidataQ102407872 ScholiaQ102407872MaRDI QIDQ450532

List of research outcomes

Publication	Date of Publication	Type
On permuting some coordinates of polytopes	2023-08-03	Paper
On the complexity of some facet-defining inequalities of the QAP-polytope	2023-03-21	Paper
https://portal.mardi4nfdi.de/entity/Q5089218	2022-07-18	Paper
On the extension complexity of scheduling polytopes	2021-04-07	Paper
https://portal.mardi4nfdi.de/entity/Q3386630	2021-01-05	Paper
Extension complexity of formal languages	2020-07-02	Paper
Polynomial size linear programs for problems in \textsc{P}	2019-07-17	Paper
Compact linear programs for 2SAT	2019-07-10	Paper
Parameterized extension complexity of independent set and related problems	2018-09-17	Paper
Extension Complexity, MSO Logic, and Treewidth	2017-10-17	Paper
Extension complexities of Cartesian products involving a pyramid	2017-09-19	Paper
On the \({\mathcal {H}}\)-free extension complexity of the TSP	2017-04-05	Paper
Exponential lower bounds for polytopes in combinatorial optimization	2016-03-24	Paper
Extended formulations, nonnegative factorizations, and randomized communication protocols	2015-10-14	Paper
On the extension complexity of combinatorial polytopes	2015-10-14	Paper
A generalization of extension complexity that captures P	2015-05-21	Paper
Generalized probabilistic theories and conic extensions of polytopes	2015-02-06	Paper
Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism	2014-06-16	Paper
A proof of the Oja depth conjecture in the plane	2014-05-19	Paper
Linear vs. semidefinite extended formulations	2014-05-13	Paper
On the largest convex subsets in Minkowski sums	2014-04-30	Paper
On the extension complexity of combinatorial polytopes	2013-08-06	Paper
Extended formulations, nonnegative factorizations, and randomized communication protocols	2012-11-02	Paper
Extended formulations for polygons	2012-10-15	Paper
Largest inscribed rectangles in convex polygons	2012-09-13	Paper
Complexity of approximating the vertex centroid of a polyhedron	2012-03-13	Paper
https://portal.mardi4nfdi.de/entity/Q3113727	2012-01-23	Paper
The negative cycles polyhedron and hardness of checking some polyhedral properties	2011-11-17	Paper
On a cone covering problem	2011-01-21	Paper
Complexity of Approximating the Vertex Centroid of a Polyhedron	2009-12-17	Paper
On Computing the Centroid of the Vertices of an Arrangement and Related Problems	2009-02-17	Paper
On the hardness of minkowski addition and related operations	2009-02-12	Paper
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism	2009-02-12	Paper
On the hardness of computing intersection, union and Minkowski sum of polytopes	2008-12-02	Paper

Research outcomes over time

This page was built for person: Hans Raj Tiwary