Nidhi Purohit

28 papers A* 1B 7C 1Misc 2Journal 15Unranked 2
YearRankTypeTitle / Venue / Authors
2026 J jnl
Maximizing Diversity in (near-)Median String Selection.
CoRR
Diptarka Chakraborty, Rudrayan Kundu, Nidhi Purohit, Aravinda Kanchana Ruwanpathirana
2025 J jnl
Fixed-parameter algorithms for Fair Hitting Set problems.
Inf. Comput.
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2025 — conf
Nonpartisan Feedback Vertex Set.
CIAC (2)
Nidhi Purohit, Souvik Saha, Saket Saurabh, Anannya Upasana
2025 — conf
Parameterized Complexity of Feedback Vertex Set with Connectivity Constraints.
SOFSEM (1)
Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh
2024 B conf
On the Parameterized Complexity of Minus Domination.
SOFSEM
Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh
2024 B conf
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs.
IPEC
Tomohiro Koana, Nidhi Purohit, Kirill Simonov
2024 J jnl
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs.
CoRR
Tomohiro Koana, Nidhi Purohit, Kirill Simonov
2023 B conf
Fixed-Parameter Algorithms for Fair Hitting Set Problems.
MFCS
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2023 J jnl
Fixed-Parameter Algorithms for Fair Hitting Set Problems.
CoRR
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh
2023 J jnl
How to find a good explanation for clustering?
Artif. Intell.
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2023 J jnl
Lossy Kernelization of Same-Size Clustering.
Theory Comput. Syst.
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2023 J jnl
Parameterized complexity of categorical clustering with size constraints.
J. Comput. Syst. Sci.
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
2022 B conf
Exact Exponential Algorithms for Clustering Problems.
IPEC
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
2022 J jnl
Exact Exponential Algorithms for Clustering Problems.
CoRR
Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh
2022 B conf
FPT Approximation for Fair Minimum-Load Clustering.
IPEC
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2022 A* conf
How to Find a Good Explanation for Clustering?
AAAI
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2022 Misc conf
Lossy Kernelization of Same-Size Clustering.
CSR
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2022 J jnl
On the complexity of singly connected vertex deletion.
Theor. Comput. Sci.
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
2021 J jnl
FPT Approximation for Fair Minimum-Load Clustering.
CoRR
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2021 J jnl
How to Find a Good Explanation for Clustering?
CoRR
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov
2021 J jnl
Lossy Kernelization of Same-Size Clustering.
CoRR
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov
2021 J jnl
Metric Dimension Parameterized By Treewidth.
Algorithmica
Édouard Bonnet, Nidhi Purohit
2021 B conf
Parameterized Complexity of Categorical Clustering with Size Constraints.
WADS
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
2021 J jnl
Parameterized Complexity of Categorical Clustering with Size Constraints.
CoRR
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
2020 C conf
On the Complexity of Singly Connected Vertex Deletion.
IWOCA
Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh
2019 B conf
Metric Dimension Parameterized by Treewidth.
IPEC
Édouard Bonnet, Nidhi Purohit
2019 J jnl
Metric Dimension Parameterized by Treewidth.
CoRR
Édouard Bonnet, Nidhi Purohit
2018 Misc conf
Efficient Algorithms for a Graph Partitioning Problem.
FAW
S. Vaishali, M. S. Atulya, Nidhi Purohit