5 citations · 12 across the 8 of their papers we have counts for
1 paper · 2 filters
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.