In this paper we investigate the computational complexity of a combinatorial problem that arises in the reverse engineering of protein and gene networks. Our contributions are as ...
In this paper, we provide a semi-analytical method for predicting the upper and lower bound of the end-to-end mutual information for a relay network with practical codes and diffe...
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
Speed and availability of information, delivered in past years by Internet technologies, made it easier for any company to outsource primary activities, which resulted in unbundli...
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...