Data structures and network algorithms
Data structures and network algorithms
Scaling algorithms for network problems
Journal of Computer and System Sciences
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Fast algorithms for shortest paths in planar graphs, with applications
SIAM Journal on Computing
Faster scaling algorithms for network problems
SIAM Journal on Computing
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Introduction to algorithms
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
On the computational behavior of a polynomial-time network flow algorithm
Mathematical Programming: Series A and B
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
EFFICIENT GRAPH ALGORITHMS FOR SEQUENTIAL AND PARALLEL COMPUTERS
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Shortest paths algorithms: theory and experimental evaluation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Path problems in skew-symmetric graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Single source shortest paths in H-minor free graphs
Theoretical Computer Science
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Weighted bipartite matching in matrix multiplication time
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 0.00 |