Bounds and Heuristics for the Shortest Capacitated Paths Problem
Journal of Heuristics
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Eulerian disjoint paths problem in grid graphs is NP-complete
Discrete Applied Mathematics
Precoloring extension on unit interval graphs
Discrete Applied Mathematics
Necessary Condition for Path Partitioning Constraints
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Disjoint paths in symmetric digraphs
Discrete Applied Mathematics
Precoloring extension on unit interval graphs
Discrete Applied Mathematics
A unified approach for multiple multicast tree construction and max-min fair rate allocation
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
A nature-inspired algorithm for the disjoint paths problem
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
SIAM Journal on Discrete Mathematics
Tight bounds for linkages in planar graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Overlay protection against link failures using network coding
IEEE/ACM Transactions on Networking (TON)
Network protection codes: Providing self-healing in autonomic networks using network coding
Computer Networks: The International Journal of Computer and Telecommunications Networking
Models for the single-vehicle preemptive pickup and delivery problem
Journal of Combinatorial Optimization
Multiflows in symmetric digraphs
Discrete Applied Mathematics
| Hi-index | 0.04 |