k-penalty: a novel approach to find k-disjoint paths with differentiated path costs

Survivable Networks: Algorithms for Diverse Routing

Survivable Networks: Algorithms for Diverse Routing

Survivability of lightwave networks — path lengths in WDM protection scheme

Journal of High Speed Networks - Special issue on survivable optical networks - part II

Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks

Survivability and Traffic Grooming in WDM Optical Networks

Survivability and Traffic Grooming in WDM Optical Networks

On the complexity of and algorithms for finding the shortest path with a disjoint counterpart

IEEE/ACM Transactions on Networking (TON)