Nidhi Purohit

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 22

Top Topics

Singly Connected

Data Clustering

Parameterized Complexity

Computational Problems

Top Venues

J. Comput. Syst. Sci.

Publications

Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh
On the Parameterized Complexity of Minus Domination. SOFSEM (2024)
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
Parameterized complexity of categorical clustering with size constraints. J. Comput. Syst. Sci. 136 (2023)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
Fixed-Parameter Algorithms for Fair Hitting Set Problems. CoRR (2023)
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to find a good explanation for clustering? Artif. Intell. 322 (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. 67 (4) (2023)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering. IPEC (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to Find a Good Explanation for Clustering? AAAI (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
Exact Exponential Algorithms for Clustering Problems. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
Exact Exponential Algorithms for Clustering Problems. IPEC (2022)
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
On the complexity of singly connected vertex deletion. Theor. Comput. Sci. 934 (2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Siminov
Lossy Kernelization of Same-Size Clustering. CSR (2022)
Édouard Bonnet, Nidhi Purohit
Metric Dimension Parameterized By Treewidth. Algorithmica 83 (8) (2021)
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
Parameterized Complexity of Categorical Clustering with Size Constraints. CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
FPT Approximation for Fair Minimum-Load Clustering. CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
How to Find a Good Explanation for Clustering? CoRR (2021)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
Lossy Kernelization of Same-Size Clustering. CoRR (2021)
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
Parameterized Complexity of Categorical Clustering with Size Constraints. WADS (2021)
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
On the Complexity of Singly Connected Vertex Deletion. IWOCA (2020)
Édouard Bonnet, Nidhi Purohit
Metric Dimension Parameterized by Treewidth. IPEC (2019)
Édouard Bonnet, Nidhi Purohit
Metric Dimension Parameterized by Treewidth. CoRR (2019)
S. Vaishali, M. S. Atulya, Nidhi Purohit
Efficient Algorithms for a Graph Partitioning Problem. FAW (2018)