default search action
Nidhi Purohit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Tomohiro Koana, Nidhi Purohit, Kirill Simonov:
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs. IPEC 2024: 10:1-10:17 - [c10]Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh:
On the Parameterized Complexity of Minus Domination. SOFSEM 2024: 96-110 - [i8]Tomohiro Koana, Nidhi Purohit, Kirill Simonov:
Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs. CoRR abs/2410.03609 (2024) - 2023
- [j5]Sayan Bandyapadhyay, Fedor V. Fomin
, Petr A. Golovach
How to find a good explanation for clustering? Artif. Intell. 322: 103948 (2023) - [j4]Fedor V. Fomin
Parameterized complexity of categorical clustering with size constraints. J. Comput. Syst. Sci. 136: 171-194 (2023) - [j3]Sayan Bandyapadhyay, Fedor V. Fomin
Lossy Kernelization of Same-Size Clustering. Theory Comput. Syst. 67(4): 785-824 (2023) - [c9]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh:
Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS 2023: 55:1-55:14 - [i7]Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh:
Fixed-Parameter Algorithms for Fair Hitting Set Problems. CoRR abs/2307.08854 (2023) - 2022
- [j2]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk
On the complexity of singly connected vertex deletion. Theor. Comput. Sci. 934: 47-64 (2022) - [c8]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet, Nidhi Purohit, Kirill Simonov:
How to Find a Good Explanation for Clustering? AAAI 2022: 3904-3912 - [c7]Sayan Bandyapadhyay, Fedor V. Fomin
Lossy Kernelization of Same-Size Clustering. CSR 2022: 96-114 - [c6]Sayan Bandyapadhyay, Fedor V. Fomin
FPT Approximation for Fair Minimum-Load Clustering. IPEC 2022: 4:1-4:14 - [c5]Fedor V. Fomin
Exact Exponential Algorithms for Clustering Problems. IPEC 2022: 13:1-13:14 - [i6]Fedor V. Fomin
Exact Exponential Algorithms for Clustering Problems. CoRR abs/2208.06847 (2022) - 2021
- [j1]Édouard Bonnet, Nidhi Purohit
Metric Dimension Parameterized By Treewidth. Algorithmica 83(8): 2606-2633 (2021) - [c4]Fedor V. Fomin
Parameterized Complexity of Categorical Clustering with Size Constraints. WADS 2021: 385-398 - [i5]Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit:
Parameterized Complexity of Categorical Clustering with Size Constraints. CoRR abs/2104.07974 (2021) - [i4]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
Lossy Kernelization of Same-Size Clustering. CoRR abs/2107.07383 (2021) - [i3]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
FPT Approximation for Fair Minimum-Load Clustering. CoRR abs/2107.09481 (2021) - [i2]Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, William Lochet
How to Find a Good Explanation for Clustering? CoRR abs/2112.06580 (2021) - 2020
- [c3]Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Komal Muluk, Nidhi Purohit, Saket Saurabh:
On the Complexity of Singly Connected Vertex Deletion. IWOCA 2020: 237-250
2010 – 2019
- 2019
- [c2]Édouard Bonnet
Metric Dimension Parameterized by Treewidth. IPEC 2019: 5:1-5:15 - [i1]Édouard Bonnet, Nidhi Purohit:
Metric Dimension Parameterized by Treewidth. CoRR abs/1907.08093 (2019) - 2018
- [c1]S. Vaishali
Efficient Algorithms for a Graph Partitioning Problem. FAW 2018: 29-42
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 01:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: