1. Digital Repository at Indian Institute of Science Education and Research Pune

Browsing by Author TRIPATHI, SHUVAM KANT

Jump to a point in the index:
Showing results 1 to 8 of 8
Issue DateTitleAuthor(s)
Dec-2020Parameterized Complexity of Satisfactory Partition ProblemGAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT; Dept. of Mathematics
Jan-2021Parameterized Complexity of Defensive and Offensive Alliances in GraphsGAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT; Dept. of Mathematics
Jan-2021The Balanced Satisfactory Partition ProblemGAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT; Dept. of Mathematics
Jan-2021Parameterized Complexity of Locally Minimal Defensive AlliancesGAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT; Dept. of Mathematics
Jan-2022Parameterized Intractability of Defensive Alliance ProblemGAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT; Balachandran, Niranjan; Inkulu, R.; Dept. of Mathematics
Mar-2022Parameterized complexity of satisfactory partition problemGAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT; Dept. of Mathematics
Sep-2022Alliances in Graphs: A Parameterized PerspectiveMAITY, SOUMEN; TRIPATHI, SHUVAM KANT; Dept. of Mathematics; 20162031
Sep-2025Parameterized complexity of locally minimal defensive alliancesGAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT; Dept. of Mathematics
Showing results 1 to 8 of 8