Efficient Algorithms for a Graph Partitioning Problem. - S. Vaishali 001; M. S. Atulya; Nidhi Purohit (FAW, 2018)

Metric Dimension Parameterized By Treewidth. - Édouard Bonnet; Nidhi Purohit (Algorithmica, 2021)

FPT Approximation for Fair Minimum-Load Clustering. - Sayan Bandyapadhyay; Fedor V. Fomin; Petr A. Golovach; Nidhi Purohit; Kirill Simonov (IPEC, 2022)

Exact Exponential Algorithms for Clustering Problems. - Fedor V. Fomin; Petr A. Golovach; Tanmay Inamdar 002; Nidhi Purohit; Saket Saurabh 001 (IPEC, 2022)

On the complexity of singly connected vertex deletion. - Avinandan Das; Lawqueen Kanesh; Jayakrishnan Madathil; Komal Muluk; Nidhi Purohit; Saket Saurabh 001 (Theor. Comput. Sci., 2022)

Parameterized complexity of categorical clustering with size constraints. - Fedor V. Fomin; Petr A. Golovach; Nidhi Purohit (J. Comput. Syst. Sci., 2023)

Lossy Kernelization of Same-Size Clustering. - Sayan Bandyapadhyay; Fedor V. Fomin; Petr A. Golovach; Nidhi Purohit; Kirill Simonov (Theory Comput. Syst., 2023)

How to find a good explanation for clustering? - Sayan Bandyapadhyay; Fedor V. Fomin; Petr A. Golovach; William Lochet; Nidhi Purohit; Kirill Simonov (Artif. Intell., 2023)

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs. - Tomohiro Koana; Nidhi Purohit; Kirill Simonov (IPEC, 2024)

On the Parameterized Complexity of Minus Domination. - Sriram Bhyravarapu; Lawqueen Kanesh; A. Mohanapriya; Nidhi Purohit; N. Sadagopan; Saket Saurabh 001 (SOFSEM, 2024)

Nonpartisan Feedback Vertex Set. - Nidhi Purohit; Souvik Saha 002; Saket Saurabh 001; Anannya Upasana (CIAC (2), 2025)

Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints. - Ankit Abhinav; Satyabrata Jana; Nidhi Purohit; Abhishek Sahu; Saket Saurabh 001 (SOFSEM (1), 2025)

Fixed-parameter algorithms for Fair Hitting Set problems. - Tanmay Inamdar 002; Lawqueen Kanesh; Madhumita Kundu; Nidhi Purohit; Saket Saurabh 001 (Inf. Comput., 2025)