-
Improving Approximation Guarantees for Maximin Share
with
Hannaneh Akrami,
Jugal Garg,
Setareh Taki
arXiv:2307.12916
-
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision
with
Aniket Murhekar,
in FSTTCS 2023
arXiv:2309.15870,
doi:10.4230/LIPIcs.FSTTCS.2023.18
-
Existence and Computation of Epistemic EFX Allocations
with
Ioannis Caragiannis,
Jugal Garg,
Nidhi Rathi,
Giovanna Varricchio,
in IJCAI 2023
arXiv:2206.01710,
doi:10.24963/ijcai.2023/284,
YouTube (1:10:00)
These results were independently discovered by two research groups: UIUC and Aarhus.
When we found out about each other, we merged our results into a single paper.
-
Simplification and Improvement of MMS Approximation
with
Hannaneh Akrami,
Jugal Garg,
Setareh Taki,
in IJCAI 2023
arXiv:2303.16788,
doi:10.24963/ijcai.2023/276
-
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing
with Arindam Khan
and K. V. N. Sreenivas,
in FSTTCS 2022
arXiv:2106.13951,
doi:10.4230/LIPIcs.FSTTCS.2022.23,
YouTube (20:00)
-
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
with Arindam Khan,
in APPROX 2021
and Algorithmica
Journal version,
conference version,
arXiv:2105.02827,
YouTube (20:00)
-
Harmonic Algorithms for Packing d-dimensional Cuboids Into Bins
in FSTTCS 2021
doi:10.4230/LIPIcs.FSTTCS.2021.32,
arXiv:2011.10963,
YouTube (25:00)
-
An Approximation Algorithm for Covering Linear Programs
and its Application to Bin-Packing
arXiv:2011.11268
-
Approximation Algorithms for Generalized Multidimensional Knapsack
with Arindam Khan
and K. V. N. Sreenivas
arXiv:2102.05854
-
Analysis of the Harmonic Function Used in Bin-Packing
arXiv:2011.11618
-
Approximation Algorithms for Geometric Packing Problems
M.Tech. (Research) thesis
at CSA, IISc
(advised by Prof. Arindam Khan)
pdf,
etd@iisc
-
Mitigating DNS Amplification Attacks Using a Set of
Geographically Distributed SDN Routers
with Vishal Gupta,
in ICACCI 2018
doi:10.1109/ICACCI.2018.8554459