A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
Michael Ferrara, Michael S. Jacobson, Angela Harri...
We consider a dense n-user Gaussian interference network formed by paired transmitters and receivers placed independently at random in Euclidean space. Under natural conditions on ...
Matthew Aldridge, Oliver Johnson, Robert J. Piecho...
In this paper we study the nonzero-sum Dynkin game in continuous time, which is a two-player noncooperative game on stopping times. We show that it has a Nash equilibrium point for...
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
Paul Hunter, Patricia Bouyer, Nicolas Markey, Jo&e...
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...