Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Tetsuo Asano
Constant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons
Journal of Graph Algorithms and Applications
Geometry
Computer Science Applications
Computer Science
Mathematics
Computational Theory
Theoretical Computer Science
Topology
Related publications
Implementing Parallel Shortest-Paths Algorithms
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
On Finding and Updating Spanning Trees and Shortest Paths
SIAM Journal on Computing
Mathematics
Computer Science
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms
Finding Non-Dominated Bicriteria Shortest Pairs of Disjoint Simple Paths
Computers and Operations Research
Management Science
Simulation
Computer Science
Operations Research
Modeling
All Pairs Shortest Paths
An Elementary Approach to Design and Analysis of Algorithms
Shortest Gently Descending Paths
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds
Competition for Shortest Paths on Sparse Graphs
Physical Review Letters
Astronomy
Physics
