Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest— by perimeter or area—axis-parallel rectangle and...
Manuel Abellanas, Ferran Hurtado, Christian Icking...
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Given a nominal plant, together with a fixed neighborhood of this plant, the problem of robust stabilization is to find a controller that stabilizes all plants in that neighborh...
This paper presents a watermarking algorithm that is suitable for the data represented in floating- or fixed-point numbers. By keeping the modulation information, every value in th...