Hans Raj Tiwary

activity

20082026

most citedExtended formulations for polygons

81 citations · 142 across the 18 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

cs.DM2014

Polynomial size linear programs for problems in P

David Avis, David Bremner, Hans Raj Tiwary +1

A perfect matching in an undirected graph $G = (V, E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$ . The perfect matching problem is to decide if $G$ ha…

cs.CC2014

A generalization of extension complexity that captures $P$

David Avis, Hans Raj Tiwary

In this paper we propose a generalization of the extension complexity of a polyhedron $Q$ . On the one hand it is general enough so that all problems in $P$ can be formulated as lin…

Polynomial size linear programs for problems in P

A generalization of extension complexity that captures P

A generalization of extension complexity that captures $P$