Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
We analyze the class of surfaces which are equipped with rational support functions. Any rational support function can be decomposed into a symmetric (even) and an antisymmetric (...
In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for re...
In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks - Assur graphs - which arise in the analysis of mechanical linkages. In this p...
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...