Nidhi Purohit

According to our database, Nidhi Purohit authored at least 13 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints.

Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh

Proceedings of the SOFSEM 2025: Theory and Practice of Computer Science, 2025

Nonpartisan Feedback Vertex Set.

Nidhi Purohit, Souvik Saha, Saket Saurabh, Anannya Upasana

Proceedings of the Algorithms and Complexity - 14th International Conference, 2025

2024

On the Parameterized Complexity of Minus Domination.

Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs.

Tomohiro Koana, Nidhi Purohit, Kirill Simonov

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2023

Fixed-Parameter Algorithms for Fair Hitting Set Problems.

Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Exact Exponential Algorithms for Clustering Problems.

Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

FPT Approximation for Fair Minimum-Load Clustering.

Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Lossy Kernelization of Same-Size Clustering.

Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov

Proceedings of the Computer Science - Theory and Applications, 2022

How to Find a Good Explanation for Clustering?

Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Parameterized Complexity of Categorical Clustering with Size Constraints.

Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2020

On the Complexity of Singly Connected Vertex Deletion.

Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019

Metric Dimension Parameterized by Treewidth.

Édouard Bonnet, Nidhi Purohit

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Efficient Algorithms for a Graph Partitioning Problem.

S. Vaishali, M. S. Atulya, Nidhi Purohit

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018