Multidimensional packing problems find numerous applications in robotics, cloud computing, smart-grids and many other scheduling and resource allocation problems.

Many real-world networks such as the ones arising out of facebook and twitter, webpages and hyperlinks etc. evolve with the passage of  time.

In Shannon's classical rate distortion problem, an encoder compresses  data from a source into a message and sends it losslessly to the decoder.

A binary m x n array is said to satisfy the two-dimensional (2-D) hard square constraint if no row or column of the array contains ones in consecutive positions. Let N(m,n) denote the number of such arrays.

To understand the power of randomization is one of the fundamental questions in theoretical computer science.