Concentrated regular data streams on grids: sorting and routing near to the bisection bound
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Rooted routing in linear lightwave networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
Architectures for linear lightwave networks
Architectures for linear lightwave networks
A linear lightwave Benes network
IEEE/ACM Transactions on Networking (TON)
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient routing and scheduling algorithms for optical networks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Paths, Flows, and VLSI-Layout
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Complexity of Disjoint Paths Problems in Planar Graphs
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
On-line admission control and circuit routing for high performance computing and communication
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
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
All-to-all routing and coloring in weighted trees of rings
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
IEEE/ACM Transactions on Networking (TON)
Proceedings of the tenth 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
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science
An efficient algorithm for reducing the number of add-drop Multiplexers in SONET/WDM rings
Journal of High Speed Networks
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Bandwidth allocation in WDM tree networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Approximating Call-Scheduling Makespan in All-Optical Networks
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
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
The permutation-path coloring problem on trees
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
Journal of Computer and System Sciences
Journal of Parallel and Distributed Computing
Journal of Scheduling - Special issue: On-line algorithm part I
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of the undirected edge-disjoint paths problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Logarithmic hardness of the undirected edge-disjoint paths problem
Journal of the ACM (JACM)
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
Inapproximability and approximability of minimal tree routing and coloring
Journal of Discrete Algorithms
K-Tree: A multiple tree video multicast protocol for Ad hoc wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A nature-inspired algorithm for the disjoint paths problem
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Edge Disjoint Paths in Moderately Connected Graphs
SIAM Journal on Computing
Edge disjoint paths in moderately connected graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Approximation algorithms for path coloring in trees
Efficient Approximation and Online Algorithms
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
| Hi-index | 0.00 |