Multiway Cut is a classic graph partitioning problem in which the goal is to disconnect a
given set of special vertices called terminals. This problem admits a rich sequence of works …

We investigate the approximability of the linear 3-cut problem in directed graphs, which is
the simplest unsolved case of the linear k-cut problem. The input here is a directed graph …

We investigate the approximability of the linear 3-cut problem in directed graphs. The input
here is a directed graph D=(V, E) with node weights and three specified terminal nodes s, r …

In this thesis, we consider cut and connectivity problems on graphs, digraphs, hypergraphs
and hedgegraphs. The main results are the following:-We introduce a faster algorithm for …

In the fixed-terminal bicut problem, the input is a directed graph with two specified nodes s
and t and the goal is to find a smallest subset of edges whose removal ensures that s cannot …

Graph cut algorithms are an important tool for solving optimization problems in a variety of
areas in computer science. Of particular importance is the min $ s $-$ t $ cut problem and an …

My earlier work is in the field of computational geometry. In collaboration with Chang and
Erickson, I showed a fast algorithm for recognizing a generalization of simple polygons [7]. I …

We investigate the approximability of the linear 3-cut problem in directed graphs. The input
here is a directed graph D=(V, E) D=(V, E) with node weights and three specified terminal …