References in zbMATH (referenced in 254 articles )

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

1 2 3 ... 11 12 13 next

  1. 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)
  2. Louza, Felipe A.; Mhaskar, Neerja; Smyth, W. F.: A new approach to regular & indeterminate strings (2021)
  3. Arbex Valle, Cristiano; Beasley, John E.: Order batching using an approximation for the distance travelled by pickers (2020)
  4. Brown, Gerald G.; Carlyle, W. Matthew: Solving the nearly symmetric all-pairs shortest-path problem (2020)
  5. Ehrmann, Silvia; Gries, Sebastian; Schweitzer, Marc Alexander: Generalization of algebraic multiscale to algebraic multigrid (2020)
  6. Gorrieri, Roberto: Team equivalences for finite-state machines with silent moves (2020)
  7. Jukna, Stasys; Seiwert, Hannes: Approximation limitations of pure dynamic programming (2020)
  8. Jukna, Stasys; Seiwert, Hannes: Sorting can exponentially speed up pure dynamic programming (2020)
  9. Kobayashi, Kei; Wynn, Henry P.: Empirical geodesic graphs and CAT((k)) metrics for data analysis (2020)
  10. Mankowski, Michal; Moshkov, Mikhail: Dynamic programming bi-criteria combinatorial optimization (2020)
  11. Mankowski, Michal; Moshkov, Mikhail: Extensions of dynamic programming for multi-stage combinatorial optimization (2020)
  12. Sheng, Yuhong; Mei, Xuehui: Uncertain random shortest path problem (2020)
  13. Shvydun, Sergey: Computational complexity of SRIC and LRIC indices (2020)
  14. Tang, Fengqin; Wang, Chunning; Su, Jinxia; Wang, Yuanyuan: Spectral clustering-based community detection using graph distance and node attributes (2020)
  15. Thraves Caro, Christopher; Doncel, Josu; Brun, Olivier: Optimal path discovery problem with homogeneous knowledge (2020)
  16. Vilas, Fernando E.; Olinick, Eli V.; Matula, David W.: Bounds on maximum concurrent flow in random bipartite graphs (2020)
  17. Chawdhary, Aziem; Robbins, Ed; King, Andy: Incrementally closing octagons (2019)
  18. Chen, Lin; Peng, Jin; Ralescu, Dan A.: Uncertain vertex coloring problem (2019)
  19. Danda, Sravan; Challa, Aditya; Sagar, B. S. Daya; Najman, Laurent: Some theoretical links between shortest path filters and minimum spanning tree filters (2019)
  20. de Armas, Jesica; Keenan, Peter; Juan, Angel A.; McGarraghy, Seán: Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (2019)

1 2 3 ... 11 12 13 next