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

Browsing by Author GAIKWAD, AJINKYA

Jump to a point in the index:
Showing results 1 to 20 of 21  next >
Issue DateTitleAuthor(s)
Dec-2020Parameterized Complexity of Satisfactory Partition ProblemGAIKWAD, 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-2021Parameterized Complexity of Defensive and Offensive Alliances in GraphsGAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT; Dept. of Mathematics
Dec-2021On Structural Parameterizations of the Offensive Alliance ProblemGAIKWAD, AJINKYA; MAITY, SOUMEN; Du, Ding-Zhu; Du, Donglei; Wu, Chenchen; Xu, Dachuan; 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
Mar-2022On the Harmless Set Problem Parameterized by TreewidthGAIKWAD, AJINKYA; MAITY, SOUMEN; Mutzel, Petra; Rahman, Md. Saidur; Slamin; Dept. of Mathematics
Aug-2022Globally minimal defensive alliancesGAIKWAD, AJINKYA; MAITY, SOUMEN; Dept. of Mathematics
Sep-2022Defensive alliances in graphsGAIKWAD, AJINKYA; MAITY, SOUMEN; Dept. of Mathematics
Oct-2022Further parameterized algorithms for the -free edge deletion problemGAIKWAD, AJINKYA; MAITY, SOUMEN; Dept. of Mathematics
Sep-2023Parameterized Complexity of the -Free Edge Deletion Problem Th+1GAIKWAD, AJINKYA; MAITY, SOUMEN; Dept. of Mathematics
Sep-2023Parameterized Complexity of the Th+1 -Free Edge Deletion ProblemGAIKWAD, AJINKYA; MAITY, SOUMEN; Dept. of Mathematics
Jan-2024On Structural Parameterizations of the Harmless Set ProblemGAIKWAD, AJINKYA; MAITY, SOUMEN; Dept. of Mathematics
Mar-2024Offensive alliances in graphsGAIKWAD, AJINKYA; MAITY, SOUMEN; Dept. of Mathematics
Feb-2025MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle TransversalGAIKWAD, AJINKYA; KUMAR, HITENDRA; MAITY, SOUMEN; Saurabh, Saket; Sharma, Roohani; Dept. of Mathematics
May-2025The Parameterized Complexity Landscape of Some Graph ProblemsMAITY, SOUMEN; GAIKWAD, AJINKYA; Dept. of Mathematics; 20193687
Sep-2025Parameterized Algorithms for Editing to Uniform Cluster GraphGAIKWAD, AJINKYA; KUMAR, HITENDRA; MAITY, SOUMEN; Jeż, Artur; Otop, Jan; Dept. of Mathematics
Sep-2025Parameterized complexity of locally minimal defensive alliancesGAIKWAD, AJINKYA; MAITY, SOUMEN; TRIPATHI, SHUVAM KANT; Dept. of Mathematics
Feb-2026Parameterized Algorithms for Locally Minimal Defensive AllianceGAIKWAD, AJINKYA; MAITY, SOUMEN; Saurabh, Saket; Dept. of Mathematics
Showing results 1 to 20 of 21  next >