All-to-all routing and coloring in weighted trees of rings
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Improved access to optical bandwidth in trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
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
Randomized path coloring on binary trees
Theoretical Computer Science
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
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
| Hi-index | 0.00 |