Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks
IEEE Transactions on Parallel and Distributed Systems
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
Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Approximate Constrained Bipartite Edge Coloring
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Wide-Sense Nonblocking WDM Cross-Connects
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Decidable Properties of Graphs of All-Optical Networks
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
Approximate constrained bipartite edge coloring
Discrete Applied Mathematics
On routing of wavebands for all-to-all communications in all-optical paths and cycles
Theoretical Computer Science - Foundations of software science and computation structures
Paths coloring algorithms in mesh networks
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
Hi-index | 0.00 |