Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each ga...
With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in to...
The instabilities of the medial axis of a shape under deformations have long been recognized as a major obstacle to its use in recognition and other applications. These instabilit...
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...