Abstract
Motivated by the COVID-19 pandemic, we consider the scheduling of seating arrangement for an event that is divided into sessions, aiming at reducing the number of close contacts of participants, while the physical and temporal distancing rules are taken into consideration simultaneously. In this paper, we formalize the requirements as a resolvable graph decomposition or packing problem, and focus on the grid graphs defined over vertices that are arranged into arrays embedded in the Euclidean space. We provide explicit constructions of such arrangement, and particularly for those that reach or asymptotically reach the largest possible number of sessions.