The following pages link to Lyudmil Aleksandrov (Q603864):
Displaying 28 items.
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
- (Q2721969) (← links)
- Approximation algorithms for geometric shortest path problems (Q3191995) (← links)
- (Q3484374) (← links)
- (Q3485406) (← links)
- (Q3488655) (← links)
- Partitioning planar graphs with costs and weights (Q3507765) (← links)
- Determining approximate shortest paths on weighted polyhedral surfaces (Q3546286) (← links)
- (Q3688855) (← links)
- (Q3712906) (← links)
- (Q3721740) (← links)
- Approximate solution of eigenvalue problems for high-order linear differential equations (Q3911979) (← links)
- (Q3959368) (← links)
- The Newton-Kantorovich regularized computing processes (Q4042622) (← links)
- (Q4178412) (← links)
- (Q4195865) (← links)
- An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT (Q4682194) (← links)
- (Q4707791) (← links)
- Application of rod splines for solving the radial Schrödinger equation for coupled states (Q4747471) (← links)
- Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus (Q4875441) (← links)
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces (Q5054837) (← links)
- (Q5622554) (← links)
- (Q5624532) (← links)
- A regularized computing process for the analysis of exponential relations (Q5672053) (← links)
- (Q5751369) (← links)
- Approximate Shortest Path Queries on Weighted Polyhedral Surfaces (Q5756700) (← links)
- Fundamentals of Computation Theory (Q5900801) (← links)
