Aniket BASU ROY
About
Currently, I am a postdoc at the Aarhus University.
Before this, I was a postdoc at the Laboratoire Informatique, Bio-informatique et Systèmes Complexes (IBISC), University of Evry, University of Paris-Saclay supervised by Nguyễn Kim Thắng. Even before that, I was a postdoc at the Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM), where I was advised by Marin Bougeret and Michael Poss.
I had completed my Ph.D. from the Department of Computer Science and Automation at the Indian Institute of Science located in Bangalore, India where I was lucky to have Prof. Sathish Govindarajan as my thesis advisor. Before that I did my Masters from the Indian Statistical Institute, Kolkata. My interests lie broadly in the areas of theoretical computer science that have some combinatorial flavor to it. So far, I have explored a few computationally hard geometric optimization problems and tried to design approximation algorithms for them.
Publications
Journal Papers
Local Search strikes again: PTAS for variants of Geometric Covering and Packing. With Pradeesha Ashok and Sathish Govindarajan. J Comb Optim 39, 618–635 (2020).
Packing and Covering with Non-Piercing Regions. With Sathish Govindarajan, Rajiv Raman, and Saurabh Ray. Discrete & Computational Geometry 60(2): 471-492 (2018).
Conference Papers
On Range Summary Queries. With Peyman Afshani, Pingan Cheng, and Zhewei Wei. In the proceedings of the EATCS International Colloquium on Automata, Languages and Programming (ICALP) 2023.
Approximating Robust Bin Packing with Budgeted Uncertainty. With Marin Bougeret, Noam Goldberg, and Michael Poss. In the Proceedings of the Algorithms and Data Structures Symposium (WADS), 2019.
Local Search strikes again: PTAS for variants of Geometric Covering and Packing. With Pradeesha Ashok and Sathish Govindarajan. In the Proceedings of the Annual International Computing and Combinatorics Conference (COCOON), 2017.
Effectiveness of Local Search for Art Gallery Problems. With Sayan Bandyapadhyay. In the Proceedings of the Algorithms and Data Structures Symposium (WADS), 2017.
Demand Hitting and Covering of Intervals. With Datta Krupa R, Minati De, and Sathish Govindarajan. In the Proceedings of the Conference on Algorithms and Discrete Applied Mathematics (CALDAM), 2017.
Packing and Covering with Non-Piercing Regions. With Sathish Govindarajan, Rajiv Raman, and Saurabh Ray. In the Proceedings of the European Symposium on Algorithms (ESA), 2016.
The Runaway Rectangle Escape Problem. With Sathish Govindarajan, Anil Maheshwari, Neeldhara Misra, Subhas C Nandy, and Shreyas Shetty. A preliminary version appeared in the Proceedings of the Canadian Conference on Computational Geometry (CCCG), 2014. [arXiv]
Talks
2017-07-08 Guarding Art Galleries, The 5th CSA Undergraduate Summer School, CSA, IISc
2017-04-08 Packing and Covering with Geometric Objects, EECS Research Students Symposium - 2017, IISc
2016-08-22 Packing and Covering with Non-Piercing Regions, The 24th European Symposium on Algorithms (ESA) 2016
2016-07-08 Complete Chaos is Impossible, The 4th CSA Undergraduate Summer School, CSA, IISc
2015-06-03 Maximum Independent Set of Rectangles — A Survey, Theory Coffee, Microsoft Research, Bangalore
2014-08-13 On the d-Runaway Rectangle Escape Problem, The 26th Canadian Conference on Computational Geometry (CCCG) 2014
Contact
aniket DOT basu DOT roy AT gmail DOT com