Constrained counting and sampling are two fundamental problems in Computer Science with numerous applications, including network reliability, decision making under certainty, probabilistic reasoning, and constrained-random verification.

An atomic splittable routing game (ASRG) is a network congestion problem where each player has some finite amount of flow he wants to send in the network, while minimizing his cost due to congestion.

The general Art Gallery Problem (AGP) consists in finding the minimum number of guards sufficient to ensure the visibility coverage of an art gallery represented by a polygon.

We are in the midst of a major data revolution. The total data generated by humans from the dawn of civilization until the turn of the new millennium is now being generated every two days.