Sen, Sandeep

1. Fully dynamic maximal matching in O(log n) update time
   2011/03/06 by Baswana, Surender, Gupta, Manoj, Sen, Sandeep · 3 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. The update complexity of selection and related problems
   2011/08/29 by Manoj Kumar Gupta, Gupta, Manoj, Yogish Sabharwal +3 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms #Optimization and Search Problems
3. The covert set-cover problem with application to Network Discovery
   2012/02/06 by Sandeep Sen, Sen, Sandeep, V. N. Muralidhara +1 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
4. A simple D²-sampling based PTAS for k-means and other Clustering Problems
   2012/01/20 by Jaiswal, Ragesh, Kumar, Amit, Sen, Sandeep · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #I.5.3