Improved bounds for all optical routing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Journal of Heuristics
Disjoint Paths in Expander Graphs via Random Walks: A Short Survey
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
SIAM Journal on Discrete Mathematics
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
Fundamenta Informaticae
A graph-based approach to optimal scan chain stitching using RTL design descriptions
VLSI Design - Special issue on New Algorithmic Techniques for Complex EDA Problems
| Hi-index | 0.00 |