On the complexity of and algorithms for finding the shortest path with a disjoint counterpart
IEEE/ACM Transactions on Networking (TON)
k-penalty: a novel approach to find k-disjoint paths with differentiated path costs
IEEE Communications Letters
Wavelength rerouting in survivable WDM networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
| Hi-index | 0.00 |