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
Multicommodity flows over time: Efficient algorithms and complexity
Theoretical Computer Science
Proceedings of the 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids: Understanding the spectrum of distributed computing requirements, applications, tools, infrastructures, interoperability, and the incremental adoption of key capabilities
The Maximum Energy-Constrained Dynamic Flow Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Traffic Networks and Flows over Time
Algorithmics of Large and Complex Networks
Optimal routing and scheduling for deterministic delay tolerant networks
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Multicommodity flows over time: efficient algorithms and complexity
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A Stackelberg strategy for routing flow over time
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient continuous-time dynamic network flow algorithms
Operations Research Letters
Determining the Optimal Flows in Zero-Time Dynamic Networks
Journal of Mathematical Modelling and Algorithms
Maximum multicommodity flows over time without intermediate storage
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Approximating earliest arrival flows in arbitrary networks
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |