We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Abstract. Service-oriented computing has emerged as a new programming paradigm that aims at implementing software applications which can be used through a network via the exchange ...
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
d abstract), Nicola Ferraro, Luigi Palopoli, Simona Panni and Simona E. Rombo. Uncovering Hidden Phylogenetic Consensus d abstract), Nicholas Pattengale, Krister Swenson and Bernar...
Nicola Ferraro, Luigi Palopoli, Simona Panni, Simo...