Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Satwik Mukherjee

dblp:266/8059 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0003-1518-6664ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational complexity · 33% Graph algorithms and graph theory · 33% Computational geometry · 33%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph classes		 0.512021
Complexity of Maximum Cut on Interval Graphs · SoCG 2021
Computational geometry › intersection graphs
interval graphs		 0.512021
Complexity of Maximum Cut on Interval Graphs · SoCG 2021

Methods — techniques the papers use, named apart from their topics

complexity theory · 0.5
YearPublicationVenuePosition
2023 Complexity of Maximum Cut on Interval Graphs
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy
 Discret. Comput. Geom.3
2021 Complexity of Maximum Cut on Interval Graphs
abstract
We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete.
Ranendu Adhikary, Kaustav Bose, Satwik Mukherjee, Bodhayan Roy
 SoCG3