All-to-all routing and coloring in weighted trees of rings
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
All-to-all optical routing in optimal chordal rings of degree four
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
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science
Fractional Path Coloring with Applications to WDM Networks
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Randomized path coloring on binary trees
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Multicasting in Optical Networks
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The permutation-path coloring problem on trees
Theoretical Computer Science - Latin American theoretical informatics
Uniform multi-hop all-to-all optical routings in rings
Theoretical Computer Science - Latin American theoretical informatics
A 2-approximation algorithm for path coloring on a restricted class of trees of rings
Journal of Algorithms
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
A general approach for all-to-all routing in multihop WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Forwarding and optical indices of a graph
Discrete Applied Mathematics
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
Packet routing: complexity and algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Approximation algorithms for path coloring in trees
Efficient Approximation and Online Algorithms
| Hi-index | 0.00 |