Folgen
Aniket Basu Roy
Aniket Basu Roy
Aarhus University
Bestätigte E-Mail-Adresse bei iisc.ac.in - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Packing and covering with non-piercing regions
S Govindarajan, R Raman, S Ray, A Basu Roy
24th Annual European Symposium on Algorithms (ESA 2016), 2016
212016
Packing and covering with non-piercing regions
A Basu Roy, S Govindarajan, R Raman, S Ray
Discrete & Computational Geometry 60, 471-492, 2018
192018
Local search strikes again: PTAS for variants of geometric covering and packing
P Ashok, A Basu Roy, S Govindarajan
Journal of Combinatorial Optimization 39 (2), 618-635, 2020
62020
Approximating robust bin packing with budgeted uncertainty
A Basu Roy, M Bougeret, N Goldberg, M Poss
Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019
62019
Effectiveness of local search for art gallery problems
S Bandyapadhyay, A Basu Roy
Workshop on Algorithms and Data Structures, 49-60, 2017
52017
Demand hitting and covering of intervals
D Krupa R, A Basu Roy, M De, S Govindarajan
Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017
52017
Approximate Covering with Lower and Upper Bounds via LP Rounding
S Bandyapadhyay, AB Roy
arXiv preprint arXiv:2007.11476, 2020
12020
The runaway rectangle escape problem
AB Roy, A Maheshwari, S Govindarajan, N Misra, SC Nandy, S Shetty
arXiv preprint arXiv:1603.04210, 2016
12016
Approximation Algorithms for Geometric Packing and Covering Problems
AB Roy
2019
Demand hitting and covering of intervals
AB Roy, M De, S Govindarajan
Conference on Algorithms and Discrete Applied Mathematics, 267-280, 2017
2017
The Runaway Rectangle Escape Problem
A Basu Roy, A Maheshwari, S Govindarajan, N Misra, SC Nandy, S Shetty
arXiv e-prints, arXiv: 1603.04210, 2016
2016
Some Improved Bounds on Small Strong∈-Nets
S Mukherjee, AB Roy
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–12