The following pages link to Hans Raj Tiwary (Q450532):
Displaying 31 items.
- Largest inscribed rectangles in convex polygons (Q450533) (← links)
- On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
- On a cone covering problem (Q617540) (← links)
- The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701) (← links)
- Extended formulations for polygons (Q714985) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- Complexity of approximating the vertex centroid of a polyhedron (Q764376) (← links)
- Extension complexity of formal languages (Q778518) (← links)
- On the hardness of computing intersection, union and Minkowski sum of polytopes (Q958243) (← links)
- Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q2014726) (← links)
- Compact linear programs for 2SAT (Q2311345) (← links)
- Polynomial size linear programs for problems in \textsc{P} (Q2312647) (← links)
- A generalization of extension complexity that captures P (Q2345857) (← links)
- Extension complexities of Cartesian products involving a pyramid (Q2404613) (← links)
- Parameterized extension complexity of independent set and related problems (Q2413967) (← links)
- On the largest convex subsets in Minkowski sums (Q2448109) (← links)
- A proof of the Oja depth conjecture in the plane (Q2450202) (← links)
- On the extension complexity of scheduling polytopes (Q2661503) (← links)
- On the complexity of some facet-defining inequalities of the QAP-polytope (Q2692224) (← links)
- Exponential lower bounds for polytopes in combinatorial optimization (Q2796404) (← links)
- (Q3113727) (← links)
- (Q3386630) (← links)
- On the hardness of minkowski addition and related operations (Q3602888) (← links)
- On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q3602912) (← links)
- On Computing the Centroid of the Vertices of an Arrangement and Related Problems (Q3603554) (← links)
- Complexity of Approximating the Vertex Centroid of a Polyhedron (Q3652229) (← links)
- (Q5089218) (← links)
- Generalized probabilistic theories and conic extensions of polytopes (Q5173106) (← links)
- Extension Complexity, MSO Logic, and Treewidth (Q5369520) (← links)
- Linear vs. semidefinite extended formulations (Q5415468) (← links)
