Research
Covering Simple Orthogonal Polygons with Rectangles
Packing Fréchet Balls
- with Peyman Afshani
- Workshop version
On Range Summary Queries
- with Peyman Afshani, Pingan Cheng, and Zhewei Wei
- DOI: https://doi.org/10.4230/LIPIcs.ICALP.2023.7
Approximating Robust Bin Packing with Budgeted Uncertainty
- with Marin Bougeret, Noam Goldberg, and Michael Poss
- DOI: https://doi.org/10.1007/978-3-030-24766-9_6
Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing.
- with Pradeesha Ashok and Sathish Govindarajan
- DOI: https://doi.org/10.1007/s10878-019-00432-y
- Preliminary version
Packing and Covering with Non-Piercing Regions
- with Sathish Govindarajan, Rajiv Raman, and Saurabh Ray
- DOI: https://doi.org/10.1007/s00454-018-9983-2
- Preliminary version
Effectiveness of Local Search for Art Gallery Problems
- with Sayan Bandyapadhyay
- DOI: https://doi.org/10.1007/978-3-319-62127-2_5
Demand Hitting and Covering of Intervals
- with Datta Krupa R., Minati De, and Sathish Govindarajan
- DOI: https://doi.org/10.1007/978-3-319-53007-9_24
On the d-Runaway Rectangle Escape Problem
- with Sathish Govindarajan, Neeldhara Misra, and Shreyas Shetty
- Conference version
- Expanded version, also with Anil Maheshwari and Subhas C Nandy