On the Difficulty of Some Shortest Path Problems
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Optimal Interdiction of Unreactive Markovian Evaders
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Complexity of determining the most vital elements for the 1-median and 1-center location problems
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
An s-t connection problem with adaptability
Discrete Applied Mathematics
Complexity of most vital nodes for independent set in graphs related to tree structures
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
The most vital nodes with respect to independent set and vertex cover
Discrete Applied Mathematics
Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Evader interdiction and collateral damage
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Efficient determination of the k most vital edges for the minimum spanning tree problem
Computers and Operations Research
Improved algorithms for replacement paths problems in restricted graphs
Operations Research Letters
Complexity of determining the most vital elements for the p-median and p-center location problems
Journal of Combinatorial Optimization
Maximum dynamic network flow interdiction problem: New formulation and solution procedures
Computers and Industrial Engineering
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Journal of Combinatorial Optimization
| Hi-index | 0.00 |