Journal Publications

• An Information-theoretic approach to dimensionality reduction in data science.
  Sambriddhi Mainali and Max H. Garzon and Deepak Venugopal and Kalidas Jana and Ching-Chi Yang and Nirman Kumar and Dale Bowman and Lih-Yuan Deng
  Int. Journal of Data Sc. and Analytics 12(3): 185-203 2021.


• Range-Max Queries on Uncertain Data
  Pankaj K. Agarwal and Nirman Kumar and Stavros Sintos and Subhash Suri
  Journal of Computer and System Sciences ( Invited ). Also in PODS, 2016.


• Hyperplane Separability and Convexity of Probabilistic Points
  Martin Fink and John Hershberger and Nirman Kumar and Subhash Suri
  JOCG 8(2), 32-57 2017 ( Invited ). Also in SOCG 2016 .
  


• Robust Proximity Search for Balls Using Sublinear Space
  Sariel Har-Peled and Nirman Kumar
  Algorithmica 80(1), 279-299, 2018. Also in FSTTCS 2014.


• Space Exploration via Proximity Search
  Sariel Har-Peled and Nirman Kumar and David M. Mount and Benjamin A. Raichel
  DCG 56(2), 357-376, 2016. Also in SOCG 2015.


• Approximating Minimization Diagrams and Generalized Proximity Search
  Sariel Har-Peled and Nirman Kumar
  SICOMP 44(4), 944-974, 2015. Also in FOCS 2013.


• Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space
  Sariel Har-Peled and Nirman Kumar
  SICOMP 43(4), 1486-1511, 2014. Also in FOCS 2012.


• Approximate Nearest Neighbor Search for Low Dimensional Queries
  Sariel Har-Peled and Nirman Kumar
  SICOMP 42(1), 138-159, 2013. Also in SODA 2011.

• Separated Red Blue Center Clustering
  Marzieh Eskandari and Bhavika Khare and Nirman Kumar
  Accepted to ISAAC 2021.


• CIDMP: Completely Interpretable Detection of Malaria Parasite in Red Blood Cells using Lower-dimensional feature space
  Anik Khan and Kishor Dutta Gupta and Deepak Venugopal and Nirman Kumar
  Accepted to IJCNN 2020.


• Approximating Distance Measures for the Skyline
  Nirman Kumar and Benjamin Raichel and Stavros Sintos and Gregory Van Buskirk
  Accepted to ICDT 2019.


• Faster Approximation Algorithms for the k-Regret Minimizing Set and Related Problems
  Nirman Kumar and Stavros Sintos
  Accepted to the Algorithm Engineering and Experiments (ALENEX) , 2018.


• On the minimum edge size for 2-colorability and realizability of hypergraphs by axis-parallel rectangles
  Accepted to the 29th Canadian Conference on Computational Geometry (CCCG) , 2017.


• Efficient Algorithms for k-regret Minimizing Sets
  Pankaj K. Agarwal and Nirman Kumar and Stavros Sintos and Subhash Suri
  Accepted to the 16th International Symposium on Experimental Algorithms (SEA) , 2017


• Joint Sensing Duty Cycle Scheduling for Heterogeneous Coverage Guarantee
  Kin Sum Liu and Tyler Mayer and Hao Tsung Yang and Esther Arkin and Jie Gao and Mayank Goswami and Matthew P. Johnson and Nirman Kumar and Shan Lin
  Accepted to the 36th IEEE Annual Conference on Computer Communications (INFOCOM), 2017


• Most Likely Voronoi Diagrams in Higher Dimensions
  Nirman Kumar and Benjamin Raichel and Subhash Suri and Kevin Verbeek
  Accepted to the 36th Foundations of Software Technology and Theoretical Computer Science , 2016.


• Range-Max Queries on Uncertain Data
  Pankaj K. Agarwal and Nirman Kumar and Stavros Sintos and Subhash Suri
  Accepted to the 35th ACM Conference on Principles of Database Systems (PODS) , 2016.


• Hyperplane Separability and Convexity of Probabilistic Points
  Martin Fink and John Hershberger and Nirman Kumar and Subhash Suri
  Accepted to the 32nd International Symposium on Computational Geometry , 2016


• Containment and Evasion in Stochastic Point Data
  Nirman Kumar and Subhash Suri
  Accepted to the 12th Latin American Theoretical Informatics Symposium , 2016.


• Fast Compaction Algorithms for NoSQL Databases
  Mainak Ghosh and Indranil Gupta and Shalmoli Gupta and Nirman Kumar
  Accepted to the 35th IEEE International Conference on Distributed Computing Systems , 2015


• Space Exploration via Proximity Search
  Sariel Har-Peled and David Mount and Nirman Kumar and Benjamin Raichel
  Accepted to the 31st International Symposium on Computational Geometry , 2015.


• Robust Proximity Search for Balls using Sublinear Space
  Sariel Har-Peled and Nirman Kumar
  34th Foundations of Software Technology and Theoretical Computer Science, 2014.


• Approximating Minimization Diagrams and Generalized Proximity Search
  Sariel Har-Peled and Nirman Kumar
  54th Annual IEEE Foundations of Computer Science, 2013


• Fault Tolerant Clustering Revisited
  Nirman Kumar and Benjamin Raichel
  25th Canadian Conference on Computational Geometry, 2013


• Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space
  Sariel Har-Peled and Nirman Kumar
  53rd Annual IEEE Foundations of Computer Science, 2012


• Approximate Nearest Neighbor Search for Low Dimensional Queries
  Sariel Har-Peled and Nirman Kumar
  22nd ACM Symposium on Discrete Algorithms, 2011


• On the Complexity of Error Explanation
  Nirman Kumar and Viraj Kumar and Mahesh Viswanathan
  6th International Conference on Verification, Model Checking and Abstract Interpretation, 2005


• A Rewriting Based Model for Probabilistic Distributed Object Systems
  Gul Agha, Nirman Kumar , Jose Meseguer and Koushik Sen
  6th IFIP International Conference on Formal Methods for Open, Object-based Distributed Systems, 2003.

Notes (not intended for publication)

• On Covering Points by Rectangles
  Sariel Har-Peled and Nirman Kumar


• A Generalization of the Assouad Embedding
  Sariel Har-Peled and Nirman Kumar

• Dimensionality Reduction
  At Univ of Memphis Data Science Seminar, Spring 2019
• Approximating Distance Measures for the Skyline
  At ICDT 2019
• Faster Approximation algorithms for the k-Regret Minimizing Set and Related Problems
  At ALENEX 2018
• On the minimum edge size for 2-colorability and the realizability of hypergraphs by axis-parallel rectangles
  At CCCG 2017
• Efficient Algorithms for k-Regret Minimizing Sets
  At Univ of Memphis CS Colloqium, Spring 2017
• Most Likely Voronoi Diagrams in Higher Dimensions
  At FSTTCS 2016
• Hyperplane Separability and Convexity of Probabilistic Points
  At SOCG 2016
• Containment and Evasion in Stochastic Point Data
  At LATIN 2016
• Fast Compaction Algorithms for NoSQL Databases
  At ICDCS 2015
• Robust Proximity Search for Balls Using Sublinear Space
  At FSTTCS 2014.
• Approximating Minimization Diagrams and Generalized Proximity Search
  At FOCS 2013. Also at IBM ARC, July 2013.
• Fault-Tolerant Clustering Revisited
  At the Young researchers forum, SoCG 2013
• Down The Rabbit Hole: Robust Proximity Search in Sublinear Space
  Also FOCS 2012. Also at IISC. Bangalore, Feb 2012.
• Approximate Nearest Neighbor Search for Low Dimensional Queries
  At SODA 2011