We explore a few selected multiuser communication problems where the possibility of interference alignment, and consequently the total number of degrees of freedom (DoF) with chann...
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
As the information systems discipline grows, so do the number of programs offering graduate research degrees (GRD). In Australasia these include one year post-graduate (honors) pr...
A considerable number of serious games have been developed over the last ten years, with varying degrees of success. Due to a lack of clear standards and guidelines for game devel...
Amri Yusoff, Richard M. Crowder, Lester Gilbert, G...
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...