A field study of Computer Mediated Communication (CMC) as used in higher education asks the questions, "Will students take part in synchronous chat sessions if they are sched...
Despite all the encouraging reports on the benefit of Partially Overlapped Channels (POCs), the relative simple interference models and rather arbitrary network settings considered...
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...