Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlo...
Broadcasting is an efficient and scalable way of transmitting data over wireless channels to an unlimited number of clients. In this paper the problem of allocating data to multip...
Paolo Barsocchi, Alan A. Bertossi, Maria Cristina ...