Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A faster strongly polynomial minimum cost flow algorithm
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A survey of dynamic network flows
Annals of Operations Research
“The quickest transshipment problem”
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximately optimal control of fluid networks
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum cost flows over time without intermediate storage
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Universally Maximum Flow with Piecewise-Constant Capacities
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Quickest Multicommodity Flow Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximating earliest arrival flows with flow-dependent transit times
Discrete Applied Mathematics
An O(n log2 n) algorithm for the optimal sink location problem in dynamic tree networks
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Mathematics of Operations Research
Leveraging e-transportation in real-time traffic evacuation management
Electronic Commerce Research and Applications
Evacuation route planning: scalable heuristics
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Earliest Arrival Flows with Multiple Sources
Mathematics of Operations Research
Evacuation Route Planning Algorithm: Longer Route Preferential
ISNN '09 Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks
Traffic Networks and Flows over Time
Algorithmics of Large and Complex Networks
Demonstrating an evacuation algorithm with mobile devices using an e-scavenger hunt game
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Data Collection with Multiple Sinks in Wireless Sensor Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Evacuation planning: a capacity constrained routing approach
ISI'03 Proceedings of the 1st NSF/NIJ conference on Intelligence and security informatics
A Stackelberg strategy for routing flow over time
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Capacity constrained routing algorithms for evacuation planning: a summary of results
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Generalized maximum flows over time
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Efficient continuous-time dynamic network flow algorithms
Operations Research Letters
Approximating earliest arrival flows in arbitrary networks
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Computers and Industrial Engineering
Scheduling arc maintenance jobs in a network to maximize total flow over time
Discrete Applied Mathematics
Earliest arrival flows in networks with multiple sinks
Discrete Applied Mathematics
| Hi-index | 0.00 |