References in zbMATH (referenced in 260 articles )

Showing results 1 to 20 of 260.
Sorted by year (citations)

1 2 3 ... 11 12 13 next

  1. Cipolla, Stefano; Durastante, Fabio; Tudisco, Francesco: Nonlocal pagerank (2021)
  2. Gawrychowski, Paweł; Kaplan, Haim; Mozes, Shay; Sharir, Micha; Weimann, Oren: Voronoi diagrams on planar graphs, and computing the diameter in deterministic (\tildeO(n^5/3)) time (2021)
  3. Jordan, Jeremy D.; Uryasev, Stan: Shortest path network problems with stochastic arc weights (2021)
  4. Louza, Felipe A.; Mhaskar, Neerja; Smyth, W. F.: A new approach to regular & indeterminate strings (2021)
  5. Ma, Zu-Jun; Yang, Fei; Dai, Ying; Shen, Zuo-Jun Max: The migratory beekeeping routing problem: model and an exact algorithm (2021)
  6. Steinerberger, Stefan: A spectral approach to the shortest path problem (2021)
  7. Williams, R. Ryan: From circuit complexity to faster all-pairs shortest paths (2021)
  8. Arbex Valle, Cristiano; Beasley, John E.: Order batching using an approximation for the distance travelled by pickers (2020)
  9. Brown, Gerald G.; Carlyle, W. Matthew: Solving the nearly symmetric all-pairs shortest-path problem (2020)
  10. Ehrmann, Silvia; Gries, Sebastian; Schweitzer, Marc Alexander: Generalization of algebraic multiscale to algebraic multigrid (2020)
  11. Fransen, K. J. C.; van Eekelen, J. A. W. M.; Pogromsky, A.; Boon, M. A. A.; Adan, I. J. B. F.: A dynamic path planning approach for dense, large, grid-based automated guided vehicle systems (2020)
  12. Gorrieri, Roberto: Team equivalences for finite-state machines with silent moves (2020)
  13. Jukna, Stasys; Seiwert, Hannes: Approximation limitations of pure dynamic programming (2020)
  14. Jukna, Stasys; Seiwert, Hannes: Sorting can exponentially speed up pure dynamic programming (2020)
  15. Kobayashi, Kei; Wynn, Henry P.: Empirical geodesic graphs and CAT((k)) metrics for data analysis (2020)
  16. Mankowski, Michal; Moshkov, Mikhail: Dynamic programming bi-criteria combinatorial optimization (2020)
  17. Mankowski, Michal; Moshkov, Mikhail: Extensions of dynamic programming for multi-stage combinatorial optimization (2020)
  18. Sheng, Yuhong; Mei, Xuehui: Uncertain random shortest path problem (2020)
  19. Shvydun, Sergey: Computational complexity of SRIC and LRIC indices (2020)
  20. Tang, Fengqin; Wang, Chunning; Su, Jinxia; Wang, Yuanyuan: Spectral clustering-based community detection using graph distance and node attributes (2020)

1 2 3 ... 11 12 13 next