Nidhi Purohit

According to our database, Nidhi Purohit authored at least 11 papers between 2018 and 2024.

Collaborative distances:

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

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

How to find a good explanation for clustering?

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

Artif. Intell., September, 2023

Lossy Kernelization of Same-Size Clustering.

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

Theory Comput. Syst., August, 2023

Parameterized complexity of categorical clustering with size constraints.

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

J. Comput. Syst. Sci., 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

On the complexity of singly connected vertex deletion.

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

Theor. Comput. Sci., 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

2021

Metric Dimension Parameterized By Treewidth.

Édouard Bonnet, Nidhi Purohit

Algorithmica, 2021

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