Home
University of Bergen
Nidhi Purohit's picture

Nidhi Purohit

PhD Candidate
Department of Informatics
  • E-mailnidhi.purohit@uib.no
  • Visitor Address
    HIB - Thormøhlens gate 55
    5006 Bergen
  • Postal Address
    Postboks 7803
    5020 Bergen
Academic article
  • Show author(s) (2022). On the complexity of singly connected vertex deletion. Theoretical Computer Science.
  • Show author(s) (2022). How to Find a Good Explanation for Clustering? Proceedings of the AAAI Conference on Artificial Intelligence. 3904-3912.
  • Show author(s) (2022). FPT Approximation for Fair Minimum-Load Clustering. Leibniz International Proceedings in Informatics. 1-14.
  • Show author(s) (2022). Exact Exponential Algorithms for Clustering Problems. Leibniz International Proceedings in Informatics. 1-14.
  • Show author(s) (2021). Parameterized Complexity of Categorical Clustering with Size Constraints. Lecture Notes in Computer Science (LNCS). 385-398.
  • Show author(s) (2021). Metric Dimension Parameterized By Treewidth. Algorithmica. 2606-2633.
  • Show author(s) (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)