Arindam Khan
I am an Assistant Professor in the CSA Department at IISc.
I obtained my PhD in Algorithms, Combinatorics, and Optimization (ACO) from School of Computer Science in Georgia Institute of Technology, Atlanta, USA.
Before that I got my B. Tech and M. Tech (Dual Degree) from the Department of Computer Science and Engineering, Indian Institute of Technology (IIT),
Kharagpur, India.
In the past years, I have spent some wonderful time doing research at TU Munich, IDSIA Switzerland, Microsoft Research Redmond, UC Berkeley, Microsoft Research Silicon Valley, TU Eindhoven and IBM Research.
You can find my CV here.
Research
Research:
I am broadly interested in the design and analysis of algorithms and theoretical computer science.
My current research focus is on
Approximation Algorithms, Online Algorithms, Computational Geometry, Online Learning, and Combinatorial Optimization. I am also interested in
Fairness, Algorithms for Big Data, and Machine Learning Theory.
Selected Recent Publications: (with co-authors)
- Approximation Algorithms for Geometric Knapsack for Packing Spheres and Fat Objects, Manuscript 2024.
(paper)
- Random-Order Online Independent Set of Intervals and Hyperrectangles, Manuscript 2024.
(paper)
- On Approximation Schemes for Stabbing Rectilinear Polygons, Manuscript 2024.
(paper)
- Bin Packing under Random-Order: Breaking the Barrier of 3/2, SODA 2024.
(paper)
- Guaranteeing Envy-Freeness under Generalized Assignment
Constraints, EC 2023.
(paper)
- Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits, IJCAI 2023.
(paper)
- Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set, SoCG 2023.
(paper)
- Finding Fair Allocations under Budget Constraints, AAAI 2023.
(paper)
- Fairness and Welfare Quantification for Regret in Multi-Armed Bandits, AAAI 2023.
(paper, slides, video)
- Fair Rank Aggregation, NeurIPS 2022.
(paper)
- Approximation Algorithms for ROUND-UFP and ROUND-SAP, ESA 2022.
(paper, slides, video)
- Near-optimal Algorithms for Stochastic Online Bin Packing, ICALP 2022.
(paper, slides)
- A PTAS for Packing Hypercubes into a Knapsack, ICALP 2022.
(paper, slides)
- Tight Approximation Algorithms for Two-dimensional Guillotine Strip Packing, ICALP 2022.
(paper, slides)
- Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing, FSTTCS 2022.
(paper)
- A PTAS for the Horizontal Rectangle Stabbing Problem, IPCO 2022.
(paper, slides)
- Universal and Tight Online Algorithms for Generalized-Mean Welfare, AAAI 2022.
(paper, video)
- A 3-Approximation Algorithm for Maximum Independent Set of Rectangles, SODA 2022.
(paper, 2-hour long talk at Recent Trends in Algorithms 2022: part 1, part 2)
- Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization, NeurIPS 2021.
(paper, video)
- Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items, APPROX 2021.
(paper, video)
- Peak Demand Minimization via Sliced Strip Packing, APPROX 2021.
(paper, video)
- On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem, International Symposium on Computational Geometry (SoCG) 2021.
(paper, video)
- Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. International Symposium on Computational Geometry (SoCG) 2021.
(paper, video)
- Group Fairness for Knapsack Problems, AAMAS 2021.
(paper)
- Best-Fit Bin Packing with Random Order Revisited.
Algorithmica 2021 (Preliminary version published in MFCS 2020).
( Journal version, conference version, video)
Recipient of Best Paper Award in MFCS 2020, sponsored by EATCS.
-
Approximating Geometric Knapsack via L-Packings, IEEE Symposium on Foundations of Computer Science (FOCS) 2017.
(paper, slides,
video)
ACM Transactions on Algorithms (TALG) 2021.
- Improved Online Algorithms for Knapsack and GAP in the Random Order Model,
Algorithmica 2021 (Preliminary version published in APPROX 2019).
(journal version, conference version)
- On Guillotine Separability of Squares and Rectangles, APPROX 2020.
(paper, video)
- A Tight (3/2 + epsilon) Approximation for Skewed Strip Packing, APPROX 2020.
(paper, video)
-
On the Matching Augmentation Problem, Mathematical Programming (MAPR), vol 182, pages 315–354, 2020.
(paper)
-
Improved Approximation for Vector Bin Packing, ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016.
(paper, slides)
-
Improved Approximation Algorithm for Two-Dimensional Bin Packing, ACM-SIAM Symposium on Discrete Algorithms (SODA) 2014.
(paper,
slides)
A full list of papers is available here.
Teaching
Interns, Students, and PostDocs
Postdoc:
D1. Mohit Garg, [PhD, TIFR] [2022 April - present]
PhD Students:
P2. Aditya Subramanian, [Recipient of KIAC (Kotak AI/ML Center) Fellowship]
P3. KVN Sreenivas, [Recipient of Google PhD Fellowship, Direct-entry PMRF Fellowship (declined)]
P4. Debajyoti Kar (co-advising with Siddharth Barman). [Recipient of Google PhD Fellowship, Direct-entry PMRF Fellowship (declined)]
MTech Coursework Students:
MT2. Rounak Das,
MT3. Sudhanshu More,
Graduated PhD Students: (submitted PhD thesis) P1. Vishakha Patil (Co-advised with Prof. Y. Narahari). Thesis: Exploring Fairness and Causality in Online Decision-Making (pdf).
[Recipient of Google PhD Fellowship, PMRF Fellowship (declined), CII-SERB Prime Minister’s
Fellowship for Doctoral Research]
Graduated M.Tech (Research) Students: MR1. Eklavya Sharma (-> PhD student at UIUC, USA). Thesis: Approximation Algorithms for Geometric Packing Problems (pdf).
[Recipient of Dr. MNS Swamy
Medal for Best MTech (Research)
Thesis 2022 .]
MR2. Swati Allabadi (-> Software Engineer at Siemens)(Co-advised with Dr. Anand Louis). Thesis: Algorithms for Fair Clustering (pdf).
MR3. KVN Sreenivas (-> PhD student at IISc). Thesis: Improved Algorithms for Variants of Bin Packing and Knapsack (pdf).
[Recipient of Dr. MNS Swamy
Medal for Best MTech (Research)
Thesis 2023 .]
MR4. Aditya Lonkar (-> PhD student at Georgia Tech, USA). Thesis: Algorithms for Geometric Packing and Covering Problems (pdf).
Graduated M.Tech (Coursework) Students: MT1. Arka Ray (-> RA at IISc). Thesis: Approximability of Packing and Covering Problems (pdf).
Graduated BS (IISc) Students: U1. Anish Hebbar (-> PhD student at Duke University, USA). Thesis: Online Bin Packing under Random Order Arrival (pdf).
Undergraduate Interns/Project Assistants:
Arnab Maiti (IIT Kharagpur -> U Washington) [See: How IISc changed my life],
Madhusudhan Reddy Pittu (IIT Kharagpur -> Carnegie Mellon University) [See: Exchange Diaries],
Amatya Sharma (IIT Kharagpur -> U Michigan), Siddharth Jayashankar (IIT Kanpur -> CMU), Kishen Gowda (IIT Gandhinagar -> University of Maryland), Debajyoti Kar
(IIT Kharagpur -> IISc), Siba Smarak Panigrahy (IIT Kharagpur -> McGill), Debarsho Sannyashi (IIT
Kanpur->Graviton Research), Shreyans Nagori (IIT Delhi-> NK Securities Research)), Nikhil Ayyadevara (IIT Delhi -> U Michigan), Soumita Hait (IIT Kharagpur -> University of Southern California), Divyanshi Rajput (IIIT Bangalore) [Through Google exploreCS Research Award], Aryan Agarwala (CMI -> MPII Germany), Prayas Routray (IISc -> NUS), Aaryan Gupta (IIT Bombay), Pritam Acharya (IISER Pune), Bratin Mondal (IIT Kharagpur), Pradyot Mohanty (CMI).
Project Associates:
Aditya Varre (IIT Bombay-> EPFL Switzerland), Karthik Murali (NIT Suratkal -> Univ. of Waterloo), KVN Sreenivas (IIT Bombay -> IISc), Santanu Rathod (IIT Bombay -> ELLIS PhD at Cambridge), Rajni Dabas (DU, through ACM India Anveshan Setu Fellowship), Dhawal Jethwani (IIT BHU), Sudharshan Shyam (UCSD->Aarhus), Neel Karia (IIT Kharagpur/MSR -> Columbia).
Available positions
-
Postdoc: One postdoc position is available. If you are interested in approximation algorithms/
online algorithms/ graph algorithms/ geometric algorithms or combinatorial optimization, and have published
in top-tier conferences such as STOC, FOCS, SODA, SOCG, EC, ICALP, ESA, APPROX, IPCO, ITCS, etc., please send me an email.
-
Project Assistant/Interns: I have short-term/intern positions available. If you already have some research experience in
design and analysis of algorithms and have done advanced theory courses (graph theory, linear algebra, probability, advanced algorithms etc.), please send me an email.
Research Centers, Seminars and Workshops
- PolyAlg Center: (with UC Berkeley, Georgia Tech, and TIFR)
I am a co-PI for the center on polynomials as an algorithmic paradigm, supported by Indo-US Science and Technology
Forum (IUSSTF). This is a joint Indo-US Virtual Network Center with Georgia
Tech, University of California Berkeley and TIFR Bombay. See the webpage for exciting talks and related research activities.
- IISc-MSR Theory Seminar Series 2021:
We organize IISc-MSR Theory seminar where eminent researchers talk about their recent breakthroughs. Visit the webpage for exciting talks.
- Bin Packing Seminar 2021:
Recently, We organized an international bin packing seminar. Visit the webpage for exciting talks.
Recent News (2020-22)
December 2023: Vishakha Patil submits her thesis: "Exploring Fairness and Causality in Online Decision-Making ".
November 2023: Debajyoti Kar receives prestigious Google PhD Fellowship. One of the seven recipients in the world in Algorithms and Theory.
October 2023: Aditya Subramanian receives KIAC Fellowship.
September 2023: New SODA paper, with Anish Hebbar and KVN Sreenivas, makes progress on Kenyon's classical conjecture from SODA'95 on Best-Fit Bin Packing. Anish was a BS student at IISc and now have joined Duke university for PhD. This is the first instance of a SODA paper by an UG from IISc. Congrats Anish!
August 2023: Aditya Lonkar defends his MTech (Research) thesis. He is joining Georgia Tech ACO PhD program. Congrats Aditya!
July 2023: Eklavya Sharma received Dr. MNS Swamy Medal for Best MTech (Research) Thesis 2022.
June 2023: Travel to USA -- PolyAlg visit at Berkeley, CA; SOCG at Dallas, TX; STOC at Orlando, FL; ARC Seminar at Georgia Tech, GA.
April 2023: Students Vishakha Patil and Prayas Rautray have been selected to participate in the prestigious Heidelberg Laureate Forum, 2023.
April 2023: Will serve in PC of APPROX, WAOA, LATIN, FCT.
March 2023: PhD student Aditya Subramanian received Kotak IISc AI-ML Centre (KIAC) PhD Fellowship.
March 2023: Received Prof. Priti Shankar Teaching Award for Assistant Professors.
January 2023: Gave an invited talk at Google Research Week 2023.
December 2022: Received SERB-Core grant for the project "Optimization under Intractability and Uncertainty".
November 2022: Debajyoti Kar and KVN Sreenivas were provisionally selected for prestigious PMRF fellowship (Direct-entry).
October 2022: KVN Sreenivas received prestigious Google PhD Fellowship. Among six students in India in all areas of CS, and five in the world in Algorithms, Optimization, and Markets.
October 2022: Our recent result on MISR was mentioned in Communications of the ACM (CACM) as one of the top results from India during 2019-2022.
July 2022: Will be a PC Member for SoCG 2023.
April 2022: Gave an invited talk at Capillary Technologies External Talk.
March 2022: Gave 2-hour long invited talk at Recent Trends in Algorithms 2022.
February 2022: Delighted to receive a Google India Research Award 2021.
January 2022: Our research got featured on IISc homepage: Breakthrough Result in Computational Geometry.
December 2021: Gave an invited talk at International Graph Theory Seminar (organized by Martin Golumbic).
December 2021: Delighted to receive Google ExploreCSR Award.
November 2021: PhD student Vishakha Patil wins prestigious CII-SERB Prime Minister’s Fellowship for Doctoral Research.
She was earlier a recipient of Google PhD fellowship and PMRF fellowship (declined).
October 2021: Elevated to the grade of IEEE Senior member.
October 2021: A paper is accepted in SODA'22. It makes progress on Maximum independent Set of Rectangles, a longstanding open problem in computational geometry and approximation algorithms.
August 2021: Delighted to receive Pratiksha Trust Young Investigator Award 2021.
July 2021: M.Tech research student Eklavya defended this thesis. His single-author paper got accepted in FSTTCS and another joint work was published in APPROX. He has joined UIUC for PhD. Congrats Eklavya!
July 2021: Gave an invited talk on Online Algorithms at IIITB Summer School on Theoretical Foundations of Computer Science . Video
March 2021: Gave a survey talk on multidimensional bin packing in bin packing seminar. See talk video and slides.
September 2020:
PhD Student Vishakha Patil wins prestigious Google PhD Fellowship.
She is one of 53 recipients in all areas of CS in the world.
One of the 4 students from India to win the fellowship this year.
Vishakha also received PMRF fellowship (declined).
August 2020:
Our paper receives the
Best Paper Award at MFCS 2020, out of 242 submissions.
This award is sponsored by EATCS (European Association for Theoretical Computer Science).
January 2020: Invited talk at research workshop at Santiago, Chile.
January 2020: Delighted to be a co-PI for the center on polynomials as an algorithmic paradigm, supported by Indo-US Science and Technology
Forum (IUSSTF). This is a joint Indo-US Virtual Network Center with Georgia
Tech, University of California Berkeley and TIFR Bombay. See the webpage for exciting talks and related research activities.
Other
|