Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Anna Nepomniaschaya
An Associative Version of the Ramalingam Decremental Algorithm for the Dynamic All-Pairs Shortest-Path Problem
Bulletin of the Novosibirsk Computing Center. Series:Computer Science
Related publications
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
Journal of Algorithms
An Improving Dynamic Programming Algorithm to Solve the Shortest Path Problem With Time Windows
Electronic Notes in Discrete Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
An Algorithm of Searching for the Shortest Path
All-Pairs Shortest Path Algorithm Based on MPI+CUDA Distributed Parallel Programming Model
Journal of Networks
A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem
Fast Implementation of Dijkstra's Algorithm for the Large-Scale Shortest Path Problem
Transactions of the Operations Research Society of Japan
All Pairs Shortest Paths
An Elementary Approach to Design and Analysis of Algorithms
