In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...