Call Control with k Rejections
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Call control with k rejections
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Vertex disjoint paths on clique-width bounded graphs
Theoretical Computer Science
Disjoint paths in symmetric digraphs
Discrete Applied Mathematics
Complexity results for minimum sum edge coloring
Discrete Applied Mathematics
Reliable routings in networks with generalized link failure events
IEEE/ACM Transactions on Networking (TON)
Disjoint paths in sparse graphs
Discrete Applied Mathematics
List total colorings of series-parallel graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
A nature-inspired algorithm for the disjoint paths problem
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Multiflows in symmetric digraphs
Discrete Applied Mathematics
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |