Predicting relevant documents for enterprise communication contexts. - Shashwat Garg; Krishna Kishore Dhara; Venkatesh Krishnaswamy (ICUIMC, 2014)

Improved Local Search for Geometric Hitting Set. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (STACS, 2015)

Tighter Estimates for epsilon-nets for Disks. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (CoRR, 2015)

Tighter estimates for ϵ-nets for disks. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (Comput. Geom., 2016)

Improved Algorithmic Bounds for Discrepancy of Sparse Set Systems. - Nikhil Bansal 001; Shashwat Garg (CoRR, 2016)

Algorithmic discrepancy beyond partial coloring. - Nikhil Bansal 001; Shashwat Garg (STOC, 2017)

Faster space-efficient algorithms for subset sum and k-sum. - Nikhil Bansal 001; Shashwat Garg; Jesper Nederlof; Nikhil Vyas 001 (STOC, 2017)

Limits of Local Search: Quality and Efficiency. - Norbert Bus; Shashwat Garg; Nabil H. Mustafa; Saurabh Ray (Discret. Comput. Geom., 2017)

Quasi-PTAS for Scheduling with Precedences using LP Hierarchies. - Shashwat Garg (ICALP, 2018)

Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems. - Nikhil Bansal 001; Shashwat Garg; Jesper Nederlof; Nikhil Vyas 001 (SIAM J. Comput., 2018)

Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time. - Shashwat Garg; Janardhan Kulkarni; Shi Li 001 (SODA, 2019)

An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound. - Nikhil Bansal 001; Daniel Dadush; Shashwat Garg (SIAM J. Comput., 2019)

The Gram-Schmidt Walk: A Cure for the Banaszczyk Blues. - Nikhil Bansal 001; Daniel Dadush; Shashwat Garg; Shachar Lovett (Theory Comput., 2019)

Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. - Daniel Dadush; Shashwat Garg; Shachar Lovett; Aleksandar Nikolov (Theory Comput., 2019)

RD-FCA: A resilient distributed framework for formal concept analysis. - Abhigyan Khaund; Abhishek Mukesh Sharma; Abhishek Tiwari; Shashwat Garg; Sriram Kailasam (J. Parallel Distributed Comput., 2023)

Verification under TSO with an infinite Data Domain. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Florian Furbach; Shashwat Garg (TACAS (3), 2024)