Arindam Khan

Learn More
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)
<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)
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)
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 in multirate switching environment in communication networks. In weighted bipartite edge coloring problem, we are given an edge-weighted bipartite multi-graph G(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 iteratively updates her expressed opinion based on her innate opinion and the opinion of her neighbors. The extent to how much a user is influenced by her neighboring(More)
  • 1