Connectivity and inference problems for temporal networks
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Length-bounded disjoint paths in planar graphs
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Connectivity and inference problems for temporal networks
Journal of Computer and System Sciences - Special issue on STOC 2000
On the complexity of and algorithms for finding the shortest path with a disjoint counterpart
IEEE/ACM Transactions on Networking (TON)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Algorithms for k-Disjoint Paths Problems on DAGs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Finding multiple routing paths in wide-area WDM networks
Computer Communications
On Shortest Disjoint Paths in Planar Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On provisioning in all-optical networks: an impairment-aware approach
IEEE/ACM Transactions on Networking (TON)
Journal of Computer and System Sciences
Designing Connection Oriented Networks for Multi-Domain Path Resilience
Journal of Network and Systems Management
Subgraphs generating algorithm for obtaining set of node-disjoint paths in terrain-based mesh graphs
MIG'10 Proceedings of the Third international conference on Motion in games
How reliable can two-path protection be?
IEEE/ACM Transactions on Networking (TON)
Minimum-cost multiple paths subject to minimum link and node sharing in a network
IEEE/ACM Transactions on Networking (TON)
Color-Coding Algorithms to the Balanced Path Problem: Computational Issues
INFORMS Journal on Computing
Hardness of finding two edge-disjoint min-min paths in digraphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
A note on approximating the min-max vertex disjoint paths on directed acyclic graphs
Journal of Computer and System Sciences
Proceedings of the Second Symposium on Information and Communication Technology
Finding two disjoint paths in a network with normalized α+-MIN-SUM objective function
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Wavelength rerouting in survivable WDM networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
On the complexity of the edge-disjoint min-min problem in planar digraphs
Theoretical Computer Science
Paths of bounded length and their cuts: Parameterized complexity and algorithms
Discrete Optimization
On shortest disjoint paths in planar graphs
Discrete Optimization
Scheduling of vehicles in transportation networks
Nets4Cars/Nets4Trains'12 Proceedings of the 4th international conference on Communication Technologies for Vehicles
On the complexity and approximation of the min-sum and min-max disjoint paths problems
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
An efficient critical protection scheme for intra-domain routing using link characteristics
Computer Networks: The International Journal of Computer and Telecommunications Networking
An overview of algorithms for network survivability
ISRN Communications and Networking
An optimal algorithm for two robots path planning problem on the grid
Robotics and Autonomous Systems
Finding paths with minimum shared edges
Journal of Combinatorial Optimization
| Hi-index | 0.05 |