Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Using Multi-level Graphs for Timetable Information in Railway Systems
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Fully dynamic shortest paths in digraphs with arbitrary arc weights
Journal of Algorithms
Δ-stepping: a parallelizable shortest path algorithm
Journal of Algorithms
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Minimax Regret Single-Facility Ordered Median Location Problems on Networks
INFORMS Journal on Computing
Query efficient implementation of graphs of bounded clique-width
Discrete Applied Mathematics
Logspace algorithms for computing shortest and longest paths in series-parallel graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
SIAM Journal on Discrete Mathematics
Dynamic graph query primitives for SDN-based cloudnetwork management
Proceedings of the first workshop on Hot topics in software defined networks
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |