Introduction to the ONDM 2023 special issueJOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKINGIF4.32024-04-120PRE
Two Algorithms for the k-Widest Path ProblemJOURNAL OF NETWORK AND SYSTEMS MANAGEMENTIF3.92023-06-260PRE
Introduction to the ONDM 2022 special issueJOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKINGIF4.32023-04-270PRE
Determining the Minimum Cost Steiner Tree for Delay Constrained ProblemsIEEE ACCESSIF3.62021-01-014OA
Regeneration and grooming in MPLS over WDM networksJOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKINGIF4.32019-07-301OAAI
Reliable Communication Networks for Smart Grid Transmission SystemsJOURNAL OF NETWORK AND SYSTEMS MANAGEMENTIF3.92016-04-0614OAAI
Two Heuristics for Calculating a Shared Risk Link Group Disjoint Set of Paths of Min-Sum CostJOURNAL OF NETWORK AND SYSTEMS MANAGEMENTIF3.92014-10-025PREAI
An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costsCOMPUTERS & OPERATIONS RESEARCHIF4.32009-05-0121OAAI
Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networksEUROPEAN JOURNAL OF OPERATIONAL RESEARCHIF62007-09-019OAAI
On a bi-dimensional dynamic alternative routing methodEUROPEAN JOURNAL OF OPERATIONAL RESEARCHIF62005-11-019OAAI
An efficient algorithm for sequential generation of failure states in a network with multi-mode componentsRELIABILITY ENGINEERING & SYSTEM SAFETYIF112002-08-0111OAAI