Abstract: In this talk we study the problem of partitioning a plane set into minimum number of parts with smaller diameters.

Let s be a point source of light inside an n-sided polygon P. A polygonal path from s to some point t inside P is called a diffuse reflection path if the turning points of the path lie on edges of P.

Abstract: Extensionality axioms are common when reasoning about data collections, such as arrays and functions in program analysis, or sets in mathematics.

Abstract: We tackle one of the most fascinating problems in reaction network theory: the Global Attractor Conjecture, which has been an open question for four decades now. In this paper, we do not quite prove the conjecture, but we prove a signifi

Abstract: An additive spanner of an undirected graph is a subgraph in which the shortest distance between any pair of vertices is larger than the corresponding distance in the original graph by at most an additive term.