Arindam is visiting the D1 group from June 15-18.

Arindam is an Assistant Professor in the Department of Computer Science and Automation at IISc. He obtained his PhD in Algorithms, Combinatorics, and Optimization (ACO) from School of Computer Science in Georgia Institute of Technology, Atlanta, USA. Before that he got his 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, he has 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.

He is a recipient of Google India Research Award, MFCS'20 Best Paper Award, Prof. Priti Shankar Teaching Award, and Pratiksha Trust Young Investigator Award.
You can find his homepage here: https://www.csa.iisc.ac.in/~arindamkhan/

AG 1   Info

AG Audience

English

60 Minutes

Saarbrücken

Rectangle packing and covering problems are of paramount importance in many industrial applications, from cutting stock to VLSI design to logistics. These problems are also a natural generalization of classical NP-hard problems such as bin packing and knapsack problems. Thus rectangle packing and covering has also been studied extensively from a theoretical viewpoint and is one of the central areas of research in approximation algorithms, online algorithms, dynamic algorithms, and computational geometry.

This talk will be a survey on the recent trends in approximation algorithms for rectangle packing and covering, especially our work on problems such as maximum independent set of rectangles [SODA’22, APPROX’20], geometric knapsack [FOCS’17, SOCG’21, ICALP’22], geometric bin packing [SODA’14, APPROX’21, FSTTCS’22], two-dimensional strip packing [APPROX’21, ICALP’22, APPROX’20], unsplittable flow on a path [ESA’22], rectangle set cover [SoCG’23], rectangle stabbing [IPCO’22], etc.

Nidhi Rathi

+49 681 9325 1134

--email hidden

Zoom

897 027 2575

passcode not visible

logged in users only