research
∙
11/30/2022
Approximate minimum cuts and their enumeration
We show that every α-approximate minimum cut in a connected graph is the...
share
research
∙
04/20/2022
Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k
We consider the problem of enumerating optimal solutions for two hypergr...
research
∙
10/27/2021
Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
We consider the problem of deterministically enumerating all minimum k-c...
research
∙
11/16/2020
Faster connectivity in low-rank hypergraphs via expander decomposition
We design an algorithm for computing connectivity in hypergraphs which r...
research
∙
06/20/2020
