#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2008

2017

- This year (1)
- Last five years (14)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn 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 = (V H , E H) that exactly preserves all the minimum cuts between the terminals. Specifically, the vertex set of the sparsifier V H contains the set of terminals K and for every bipartition U, K − U of the terminals K, the size of the… (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 square bins. We consider the orthogonal packing case where the edges of the items must be aligned parallel to the edges of the bin. Our main result is 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 two-dimensional plane and the goal is to pack them in a vertical strip of fixed width such that the height of the obtained packing is minimized. The packing must be… (More)

The problem of ordering a set of entities which contain inherent ties among them arises in many applications. Notion of " bucket order " has emerged as a popular mechanism of ranking in such settings. A bucket order is an ordered partition of the set of entities into " buckets ". There is a total order on the buckets, but the entities within a bucket are… (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 minimum number of bins so that no bin holds numbers summing to more than 1. The problem is extremely important in practice and finds numerous applications in… (More)

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

<i>Attribute-Based Messaging</i> (ABM) enables messages to be addressed using attributes of recipients rather than an explicit list of recipients. Such messaging offers benefits of efficiency, exclusiveness, and intensionality, but faces challenges in access control and confidentiality. In this article we explore an approach to intraenterprise ABM based on… (More)

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

- 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 vectors v1,. .. , vn in [0, 1] d , and the goal is to pack them into the least number of bins so that for each bin B, the sum of the vectors in it is at most 1 in… (More)

- Arindam Khan, Sudebkumar Prasant Pal, Mridul Aanjaneya, Arijit Bishnu, Subhas C. Nandy
- Discrete Applied Mathematics
- 2013

- Arshad Khana, Talat Sultanab, A. Khan, T. Sultana
- 2012

In this paper, parametric quintic spline method is presented to solve a linear special case sixth order two point boundary value problems with two different cases of boundary conditions. The method presented in this paper has been shown to be second and fourth order accurate. Boundary equations are derived for both the cases of boundary conditions.… (More)