An achievable rate region for line networks with edge and node capacity constraints and broadcasting is derived. The region is the capacity region if the broadcast channels are ort...
Gerhard Kramer, S. M. Sadegh Tabatabaei Yazdi, Ser...
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propo...
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectu...
In this paper, we discuss the view that planning software development -- and particularly software reuse -- should be based not on standardized criteria, but on those criteria tha...