Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Christian Wulff-Nilsn
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds
Related publications
All Pairs Shortest Paths
An Elementary Approach to Design and Analysis of Algorithms
An Almost 2-Approximation for All-Pairs of Shortest Paths in Subquadratic Time
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
Finding Non-Dominated Bicriteria Shortest Pairs of Disjoint Simple Paths
Computers and Operations Research
Management Science
Simulation
Computer Science
Operations Research
Modeling
Bicriterion Shortest Paths in Stochastic Time-Dependent Networks
Lecture Notes in Economics and Mathematical Systems
Mathematics
Economics
Econometrics
Finance
On Domain-Partitioning Induction Criteria: Worst-Case Bounds for the Worst-Case Based
Theoretical Computer Science
Computer Science
Theoretical Computer Science
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
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
Tight Worst-Case Bounds for Polynomial Loop Programs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
