A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
A Chebyshev knot C(a, b, c, ) is a knot which has a parametrization of the form x(t) = Ta(t); y(t) = Tb(t); z(t) = Tc(t + ), where a, b, c are integers, Tn(t) is the Chebyshev pol...
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
The wide availability of GPS sensors is changing the landscape in the applications of structure from motion techniques for localization. In this paper, we study the problem of est...
Rodrigo L. Carceroni, Ankita Kumar, Kostas Daniili...