Nidhi Purohit

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs	2024	Tomohiro Koana Nidhi Purohit Kirill Simonov
+	On the Parameterized Complexity of Minus Domination	2024	Sriram Bhyravarapu Lawqueen Kanesh A. Mohanapriya Nidhi Purohit N. Sadagopan Saket Saurabh
+	How to find a good explanation for clustering?	2023	Sayan Bandyapadhyay Fedor V. Fomin Petr A. Golovach William Lochet Nidhi Purohit Kirill Simonov
+	Parameterized complexity of categorical clustering with size constraints	2023	Fedor V. Fomin Petr A. Golovach Nidhi Purohit
+	Fixed-Parameter Algorithms for Fair Hitting Set Problems	2023	Tanmay Inamdar Lawqueen Kanesh Madhumita Kundu Nidhi Purohit Saket Saurabh
+ PDF Chat	How to Find a Good Explanation for Clustering?	2022	Sayan Bandyapadhyay Fedor V. Fomin Petr A. Golovach William Lochet Nidhi Purohit Kirill Simonov
+ PDF Chat	Lossy Kernelization of Same-Size Clustering	2022	Sayan Bandyapadhyay Fedor V. Fomin Petr A. Golovach Nidhi Purohit Kirill Siminov
+	Exact Exponential Algorithms for Clustering Problems	2022	Fedor V. Fomin Petr A. Golovach Tanmay Inamdar Nidhi Purohit Saket Saurabh
+	FPT Approximation for Fair Minimum-Load Clustering.	2021	Sayan Bandyapadhyay Fedor V. Fomin Petr A. Golovach Nidhi Purohit Kirill Simonov
+ PDF Chat	Metric Dimension Parameterized By Treewidth	2021	Édouard Bonnet Nidhi Purohit
+ PDF Chat	Parameterized Complexity of Categorical Clustering with Size Constraints	2021	Fedor V. Fomin Petr A. Golovach Nidhi Purohit
+	How to Find a Good Explanation for Clustering?	2021	Sayan Bandyapadhyay Fedor V. Fomin Petr A. Golovach William Lochet Nidhi Purohit Kirill Simonov
+	FPT Approximation for Fair Minimum-Load Clustering	2021	Sayan Bandyapadhyay Fedor V. Fomin Petr A. Golovach Nidhi Purohit Kirill Simonov
+	Lossy Kernelization of Same-Size Clustering	2021	Sayan Bandyapadhyay Fedor V. Fomin Petr A. Golovach Nidhi Purohit Kirill Simonov
+	Parameterized Complexity of Categorical Clustering with Size Constraints	2021	Fedor V. Fomin Petr A. Golovach Nidhi Purohit
+ PDF Chat	Metric Dimension Parameterized by Treewidth	2019	Édouard Bonnet Nidhi Purohit
+ PDF Chat	Metric Dimension Parameterized by Treewidth	2019	Édouard Bonnet Nidhi Purohit
+	Metric Dimension Parameterized by Treewidth	2019	Édouard Bonnet Nidhi Purohit
+	Metric Dimension Parameterized by Treewidth	2019	Édouard Bonnet Nidhi Purohit
+	Dynamics of Sirs Model with Single Time Delay	2017	Sudipa Chauhan Sumit Kaur Bhatia Nidhi Purohit

Common Coauthors

Coauthor	Papers Together
Petr A. Golovach	11
Fedor V. Fomin	11
Sayan Bandyapadhyay	7
Kirill Simonov	7
Édouard Bonnet	5
William Lochet	3
Saket Saurabh	3
Tanmay Inamdar	2
Lawqueen Kanesh	2
N. Sadagopan	1
Tomohiro Koana	1
Kirill Siminov	1
Madhumita Kundu	1
Sriram Bhyravarapu	1
Sumit Kaur Bhatia	1
A. Mohanapriya	1
Sudipa Chauhan	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	On the Fixed-Parameter Tractability of Capacitated Clustering	2022	Vincent Cohen-Addad Jason Li	4
+ PDF Chat	Parameterized low-rank binary matrix approximation	2020	Fedor V. Fomin Petr A. Golovach Fahad Panolan	3
+	On Uniform Capacitated <i>k</i> -Median Beyond the Natural LP Relaxation	2017	Shi Li	3
+ PDF Chat	An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation	2016	Jarosław Byrka Bartosz Rybicki Sumedha Uniyal	3
+ PDF Chat	Approximating $k$-Median via Pseudo-Approximation	2016	Shi Li Ola Svensson	2
+	Metric Dimension Parameterized by Max Leaf Number	2015	David Eppstein	2
+ PDF Chat	The Complexity of the Single Individual SNP Haplotyping Problem	2007	Rudi Cilibrasi Leo van Iersel Steven Kelk John Tromp	2
+ PDF Chat	Interpretable clustering using unsupervised binary trees	2013	Ricardo Fraiman Badih Ghattas Marcela Svarc	2
+ PDF Chat	Metric Dimension for Gabriel Unit Disk Graphs Is NP-Complete	2013	Stefan Hoffmann Egon Wanke	2
+ PDF Chat	A Unified Framework for Clustering Constrained Data Without Locality Property	2019	Hu Ding Jinhui Xu	2
+	Complexity of metric dimension on planar graphs	2016	Josep Dı́az Olli Pottonen Marı́a Serna Erik Jan van Leeuwen	2
+ PDF Chat	Metric Dimension of Bounded Tree-length Graphs	2017	Rémy Belmonte Fedor V. Fomin Petr A. Golovach M. S. Ramanujan	2
+	Parameterized complexity of categorical clustering with size constraints	2023	Fedor V. Fomin Petr A. Golovach Nidhi Purohit	2
+ PDF Chat	Approximation Schemes for Low-rank Binary Matrix Approximation Problems	2019	Fedor V. Fomin Petr A. Golovach Daniel Lokshtanov Fahad Panolan Saket Saurabh	2
+	Near-optimal Algorithms for Explainable k-Medians and k-Means	2021	Konstantin Makarychev Liren Shan	2
+ PDF Chat	Matroid and Knapsack Center Problems	2015	Danny Z. Chen Jian Li Hongyu Liang Haitao Wang	2
+ PDF Chat	Faster Algorithms for the Constrained k-means Problem	2017	Anup Bhattacharya Ragesh Jaiswal Amit Kumar	2
+ PDF Chat	A Lottery Model for Center-Type Problems With Outliers	2019	David G. Harris Thomas Pensyl Aravind Srinivasan Khoa Trinh	2
+	Explainable $k$-Means and $k$-Medians Clustering	2020	Michal Moshkovitz Sanjoy Dasgupta Cyrus Rashtchian Nave Frost	2
+ PDF Chat	Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems	2014	Jarosław Byrka Krzysztof Fleszar Bartosz Rybicki Joachim Spoerhase	2
+	A Unified Approach to Interpreting Model Predictions	2017	Scott Lundberg Su‐In Lee	2
+	NP-hardness of hypercube 2-segmentation	2014	Uriel Feige	2
+	On coresets for fair clustering in metric and Euclidean spaces and their applications	2024	Sayan Bandyapadhyay Fedor V. Fomin Kirill Simonov	2
+ PDF Chat	Interpretable clustering: an optimization approach	2020	Dimitris Bertsimas Agni Orfanoudaki Holly Wiberg	2
+ PDF Chat	On the Parameterized and Approximation Hardness of Metric Dimension	2013	Sepp Hartung André Nichterlein	2
+	On the Parameterized Complexity of Contraction to Generalization of Trees.	2018	Akanksha Agrawal Saket Saurabh Prafullkumar Tale	1
+ PDF Chat	Local Search Yields a PTAS for $k$-Means in Doubling Metrics	2019	Zachary Friggstad Mohsen Rezapour Mohammad R. Salavatipour	1
+ PDF Chat	Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics	2019	Vincent Cohen-Addad Philip N. Klein Claire Mathieu	1
+	Clustering without Over-Representation	2019	Sara Ahmadian Alessandro Epasto Ravi Kumar Mohammad Mahdian	1
+	Guarantees for Spectral Clustering with Fairness Constraints	2019	Matthäus Kleindeßner Samira Samadi Pranjal Awasthi Jamie Morgenstern	1
+	Lossy Kernels for Connected Dominating Set on Sparse Graphs	2018	Eduard Eiben Mithilesh Kumar Amer E. Mouawad Fahad Panolan Sebastian Siebertz	1
+ PDF Chat	Approximation Schemes for Clustering with Outliers	2019	Zachary Friggstad Kamyar Khodamoradi Mohsen Rezapour Mohammad R. Salavatipour	1
+	Privacy Preserving Clustering with Constraints	2018	Clemens Rösner Melanie Schmidt	1
+	The Bane of Low-Dimensionality Clustering	2018	Vincent Cohen-Addad Arnaud de Mesmay Eva Rotenberg Alan Roytman	1
+ PDF Chat	On the parameterized complexity of approximating dominating set	2018	C. S. Karthik Bundit Laekhanukit Pasin Manurangsi	1
+	Fair Clustering Through Fairlets	2017	Flavio Chierichetti Ravi Kumar Silvio Lattanzi Sergei Vassilvitskii	1
+ PDF Chat	Tight FPT Approximations for k-Median and k-Means	2019	Vincent Cohen-Addad Anupam Gupta Amit Kumar Euiwoong Lee Jason Li	1
+ PDF Chat	Approximation Schemes for Capacitated Clustering in Doubling Metrics	2019	Vincent Cohen-Addad	1
+ PDF Chat	On complexities of minus domination	2016	Luérbio Faria Wing-Kai Hon Ton Kloks Hsiang-Hsuan Liu Tao-Ming Wang Yue-Li Wang	1
+ PDF Chat	A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms	2020	Andreas Emil Feldmann C. S. Karthik Euiwoong Lee Pasin Manurangsi	1
+ PDF Chat	Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering	2020	Dan Feldman Melanie Schmidt Christian Sohler	1
+	Kernelization of Packing Problems	2012	Holger Dell Dániel Marx	1
+ PDF Chat	Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity	2016	Florent Foucaud George B. Mertzios Reza Naserasr Aline Parreau Petru Valicov	1
+	FPT Approximation for Constrained Metric k-Median/Means	2020	Dishant Goyal Ragesh Jaiswal Amit Kumar	1
+ PDF Chat	Fair Clustering via Equitable Group Representations	2021	Mohsen Abbasi Aditya Bhaskara Suresh Venkatasubramanian	1
+	Approximation Algorithms for Socially Fair Clustering.	2021	Yury Makarychev Ali Vakilian	1
+ PDF Chat	Socially Fair k-Means Clustering	2021	Mehrdad Ghadiri Samira Samadi Santosh Vempala	1
+ PDF Chat	The Mythos of Model Interpretability	2018	Zachary C. Lipton	1
+ PDF Chat	Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices	2021	Pavel Dvořák Andreas Emil Feldmann Dušan Knop Tomáš Masařík Tomáš Toufar Pavel Veselý	1
+ PDF Chat	An Improved Approximation for <i>k</i> -Median and Positive Correlation in Budgeted Optimization	2017	Jarosław Byrka Thomas Pensyl Bartosz Rybicki Aravind Srinivasan Khoa Trinh	1