Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximations for the disjoint paths problem in high-diameter planar networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Worst-case performance of cellular channel assignment policies
Wireless Networks - Special issue on performance evaluation methods for wireless networks
Efficient routing and scheduling algorithms for optical networks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient Wavelength Routing on Directed Fiber Trees
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Call Scheduling in Trees, Rings and Meshes
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1
IEEE/ACM Transactions on Networking (TON)
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks
IEEE Transactions on Parallel and Distributed Systems
Journal of Experimental Algorithmics (JEA)
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science
Edge coloring of bipartite graphs with constraints
Theoretical Computer Science
An efficient algorithm for reducing the number of add-drop Multiplexers in SONET/WDM rings
Journal of High Speed Networks
Randomized path coloring on binary trees
Theoretical Computer Science
Wavelength assignment and generalized interval graph coloring
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Bandwidth allocation in WDM tree networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Edge Coloring of Bipartite Graphs with Constraints
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Maximizing the Number of Connections in Optical Tree Networks
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Randomized path coloring on binary trees
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Wide-Sense Nonblocking WDM Cross-Connects
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Multicasting in Optical Networks
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Recent Advances in Wavelength Routing
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
A 2-approximation algorithm for path coloring on a restricted class of trees of rings
Journal of Algorithms
Minimizing ADMs on WDM directed fiber trees
Journal of Computer Science and Technology
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Path decomposition under a new cost measure with applications to optical network design
ACM Transactions on Algorithms (TALG)
Complexity of wavelength assignment in optical network optimization
IEEE/ACM Transactions on Networking (TON)
Minimizing maximum fiber requirement in optical networks
Journal of Computer and System Sciences
Approximation algorithms for path coloring in trees
Efficient Approximation and Online Algorithms
| Hi-index | 0.00 |