Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Minimum Restricted Diameter Spanning Trees
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Minimum restricted diameter spanning trees
Discrete Applied Mathematics
(Almost) tight bounds and existence theorems for confluent flows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM (JACM)
Characterizing graphs of small carving-width
Discrete Applied Mathematics
| Hi-index | 0.89 |