- E-mailnidhi.purohit@uib.no
- Visitor AddressHIB - Thormøhlens gate 555006 Bergen
- Postal AddressPostboks 78035020 Bergen
Academic article
- (2022). On the complexity of singly connected vertex deletion. Theoretical Computer Science.
- (2022). How to Find a Good Explanation for Clustering? Proceedings of the AAAI Conference on Artificial Intelligence. 3904-3912.
- (2022). FPT Approximation for Fair Minimum-Load Clustering. Leibniz International Proceedings in Informatics. 1-14.
- (2022). Exact Exponential Algorithms for Clustering Problems. Leibniz International Proceedings in Informatics. 1-14.
- (2021). Parameterized Complexity of Categorical Clustering with Size Constraints. Lecture Notes in Computer Science (LNCS). 385-398.
- (2021). Metric Dimension Parameterized By Treewidth. Algorithmica. 2606-2633.
- (2020). On the Complexity of Singly Connected Vertex Deletion. Lecture Notes in Computer Science (LNCS). 237-250.
More information in national current research information system (CRIStin)