#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2010

2017

- This year (0)
- Last 5 years (12)
- Last 10 years (14)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nikhil Bansal, Arindam Khan
- SODA
- 2014

We study the two-dimensional bin packing problem with and without rotations. Here we are given a set of two-dimensional rectangular items I and the goal is to pack these into a minimum number of unitâ€¦ (More)

- Rakesh Bobba, Omid Fatemieh, +4 authors Manoj Prabhakaran
- ACM Trans. Inf. Syst. Secur.
- 2010

Attribute-Based Messaging (ABM) enables messages to be addressed using attributes of recipients rather than an explicit list of recipients. Such messaging offers benefits of efficiency,â€¦ (More)

- Arindam Khan, Prasad Raghavendra, Prasad Tetali, LÃ¡szlÃ³ A. VÃ©gh
- Inf. Process. Lett.
- 2014

Given a capacitated undirected graph G = (V,E) with a set of terminals K âŠ‚ V , a mimicking network is a smaller graph H = (VH , EH) that exactly preserves all the minimum cuts between the terminals.â€¦ (More)

- Nikhil Bansal, Marek EliÃ¡s, Arindam Khan
- SODA
- 2016

We study the d-dimensional vector bin packing problem, a well-studied generalization of bin packing arising in resource allocation and scheduling problems. Here we are given a set of d-dimensionalâ€¦ (More)

The bin packing problem is a well-studied problem in combinatorial optimization. In the classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to place them in aâ€¦ (More)

- Waldo GÃ¡lvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan
- FSTTCS
- 2016

We study the strip packing problem, a classical packing problem which generalizes both bin packing and makespan minimization. Here we are given a set of axis-parallel rectangles in theâ€¦ (More)

- Henrik I. Christensen, Arindam Khan, Sebastian Pokutta, Prasad Tetali
- Computer Science Review
- 2017

The bin packing problem is a well-studied problem in combinatorial optimization. In the classical bin packing problem, we are given a list of real numbers in (0, 1] and the goal is to place them in aâ€¦ (More)

Social networks serve as important platforms for users to express, exchange and form opinions on various topics. Several opinion dynamics models have been proposed to characterize how a userâ€¦ (More)

- Arindam Khan, Mohit Singh
- FSTTCS
- 2015

We study weighted bipartite edge coloring problem, which is a generalization of two classical problems: bin packing and edge coloring. This problem has been inspired from the study of Clos networksâ€¦ (More)

- Vinayaka Pandit, Sreyash Kenkre, Arindam Khan
- SDM
- 2011