The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
We consider the path length in decision diagrams for multiple-valued functions. This is an important measure of a decision diagram, since this models the time needed to evaluate t...