On the d-Runaway Rectangle Escape Problem. - Aniket Basu Roy; Sathish Govindarajan; Neeldhara Misra; Shreyas Shetty (CCCG, 2014)

The Runaway Rectangle Escape Problem. - Aniket Basu Roy; Anil Maheshwari; Sathish Govindarajan; Neeldhara Misra; Subhas C. Nandy; Shreyas Shetty (CoRR, 2016)

Demand Hitting and Covering of Intervals. - Datta Krupa R.; Aniket Basu Roy; Minati De; Sathish Govindarajan (CALDAM, 2017)

Effectiveness of Local Search for Art Gallery Problems. - Sayan Bandyapadhyay; Aniket Basu Roy (WADS, 2017)

Packing and Covering with Non-Piercing Regions. - Aniket Basu Roy; Sathish Govindarajan; Rajiv Raman 001; Saurabh Ray (Discret. Comput. Geom., 2018)

Approximating Robust Bin Packing with Budgeted Uncertainty. - Aniket Basu Roy; Marin Bougeret; Noam Goldberg; Michael Poss (WADS, 2019)

Local search strikes again: PTAS for variants of geometric covering and packing. - Pradeesha Ashok; Aniket Basu Roy; Sathish Govindarajan (J. Comb. Optim., 2020)

On Range Summary Queries. - Peyman Afshani; Pingan Cheng; Aniket Basu Roy; Zhewei Wei (ICALP, 2023)

Covering Simple Orthogonal Polygons with Rectangles. - Aniket Basu Roy (CoRR, 2024)