We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
Tracking articulated structures like a hand or body within a reasonable time is challenging because of the high dimensionality of the state space. Recently, a new optimization met...
Matthieu Bray, Esther Koller-Meier, Luc J. Van Goo...
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses or...
We prove that the translation plane and the shift plane defined by a planar partition function form an oval pair of projective planes in the sense that the planes share a line pe...