Determining the chromatic number of a graph is known to be NP-hard. We will consider the problem of coloring a $k$-colorable graph on n vertices with $n^{\alpha}$ colors (where $\alpha < 1$).

Considering the large volume of sequence data that many computational biology applications must deal with, proper organization of the data to facilitate fast access is important to achieve desirable run-times.

The 'bisection width' of a graph is defined as the minumum number of edges that need to be removed to partition the graph into two equal halves. If the graph is 'sparse', then we don't expect this quantity to be large.

Insurance transfers losses associated with risks to the insurer for a price, the premium. We adopt the collective risk approach. Namely, we abstract the problem to include just two agents: the insured and the insurer.

I want to present a portion of Shapley's paper introducing stochastic games. We'll see what the notion of value is, for such types of games.