The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
Adrian Dumitrescu, Micha Sharir, Csaba D. Tó...
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...