Hans Raj Tiwary

collaborators

2 papers

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 $I^ \subseteq V$ of $t$ terminals, partition $V$ into $…

math.CO2026

Bond Polytope under Vertex- and Edge-sums

Petr Kolman, Hans Raj Tiwary

A cut in a graph $G$ is called a {\em bond} if both parts of the cut induce connected subgraphs in $G$ , and the {\em bond polytope} is the convex hull of all bonds. Computing the m…