The group is actively involved in research on various aspects of algorithm design and complexity theory including algorithmic computational social choice, graph theory, computational geometry, randomized algorithms, approximation algorithms, complexity theory, and online algorithms.
Publications
Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques Proceedings Article
In: Vijaya Ramachandran (Ed.): Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, USA, pp. 103–111, ACM/SIAM, 1993.
Approximate max-flow min-(multi)cut theorems and their applications Proceedings Article
In: S. Rao Kosaraju, David S. Johnson, Alok Aggarwal (Ed.): Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pp. 698–707, ACM, 1993.
An architecture for heterogeneous computer integrated manufacturing system Proceedings Article
In: Arthur M. Riehl (Ed.): Computer Trends in the 1990s - Proceedings of the 1989 ACM 17th Annual Computer Science Conference, Louisville, Kentucky, USA, February 21-23, 1989, pp. 471, ACM, 1989.
Members
Projects
- Towards Securing Network Infrastructure with Post-Quantum CryptographyRajendra Kumar (PI), Vireshwar Kumar (co-PI) Sponsored by: Centre for Railway Information Systems (CRIS) India.