Georg Grasegger,Christoph Koutschan,Elias Tsigaridas Georg Grasegger

Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Toward this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the fastes...

Andreas C Aristotelous,Richard Durrett Andreas C Aristotelous

Motivated by the widespread use of hybrid-discrete cellular automata in modeling cancer, two simple growth models are studied on the two dimensional lattice that incorporate a nutrient, assumed to be oxygen. In the first model the oxygen co...