Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
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 with Congestion
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Edge-disjoint paths in Planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Logarithmic hardness of the undirected edge-disjoint paths problem
Journal of the ACM (JACM)
Route Reservation in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Approximation algorithms for time-constrained scheduling on line networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Disjoint paths in sparse graphs
Discrete Applied Mathematics
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory Series B
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs
ACM Transactions on Algorithms (TALG)
Maximum edge-disjoint paths in k-sums of graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |