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 cs.DSShow all

3 papers · 1 filter

cs.DS2026

Min-Max Connected Multiway Cut

Hans Raj Tiwary, Petr Kolman

We introduce a variant of the multiway cut that we call the min-max connected multiway cut. Given a graph $G = (V, E)$ and a set $Γ \subseteq V$ of $t$ terminals, partition $V$ into $t…

cs.DS2019

On the extension complexity of scheduling

Hans Raj Tiwary, Victor Verdugo, Andreas Wiese

Linear programming is a powerful method in combinatorial optimization with many applications in theory and practice. For solving a linear program quickly it is desirable to have a…

cs.DS2015★ 8 cited

Extension Complexity, MSO Logic, and Treewidth

Petr Kolman, Martin Koutecký, Hans Raj Tiwary

We consider the convex hull $P_{φ} (G)$ of all satisfying assignments of a given MSO formula $φ$ on a given graph $G$ . We show that there exists an extended formulation of the polytop…