S. Mukherjee

most citedComplexity of Maximum Cut on Interval Graphs

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

cs.CC2020★ 2 cited

Complexity of Maximum Cut on Interval Graphs

Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee +1

We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete.

math.NT2014

Some Results on Zero Sum Sequences in $Z_{p}^{3}$

Satwik Mukherjee

Kemnitz Conjecture [9] states that if we take a sequence of elements in $Z_{p}^{2}$ of length $4 p - 3$ , $p$ is a prime number, then it has a subsequence of length $p$ , whose sum is $…

Complexity of Maximum Cut on Interval Graphs

Some Results on Zero Sum Sequences in Zp3​

Some Results on Zero Sum Sequences in $Z_{p}^{3}$