5 citations · 9 across the 9 of their papers we have counts for
1 paper · 1 filter
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.