References in zbMATH (referenced in 95 articles , 1 standard article )

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

1 2 3 4 5 next

  1. Cacchiani, Valentina; Iori, Manuel; Locatelli, Alberto; Martello, Silvano: Knapsack problems -- an overview of recent advances. I: Single knapsack problems (2022)
  2. Cairo, Massimo; Khan, Shahbaz; Rizzi, Romeo; Schmidt, Sebastian; Tomescu, Alexandru I.: Safety in (s)-(t) paths, trails and walks (2022)
  3. Taghizadeh, Ehsan; Byrne, Helen M.; Wood, Brian D.: Explicit physics-informed neural networks for nonlinear closure: the case of transport in tissues (2022)
  4. Bakoev, Valentin: Some problems and algorithms related to the weight order relation on the (n)-dimensional Boolean cube (2021)
  5. Campbell, Graham; Plump, Detlef: Confluence up to garbage in graph transformation (2021)
  6. Carroll, T. L.: Low dimensional manifolds in reservoir computers (2021)
  7. Hanguir, Oussama; Stein, Clifford: Distributed algorithms for matching in hypergraphs (2021)
  8. Iams, Alexas; Johnston, Hannah; Muth, Robert: Searching for quicksand ideals in partially ordered sets (2021)
  9. Ma, Qingyin; Stachurski, John: Dynamic programming deconstructed: transformations of the Bellman equation and computational efficiency (2021)
  10. Azaïs, Romain; Ingels, Florian: The weight function in the subtree kernel is decisive (2020)
  11. Carroll, T. L.: Path length statistics in reservoir computers (2020)
  12. Courtehoute, Brian; Plump, Detlef: A fast graph program for computing minimum spanning trees (2020)
  13. Jensen, Hector A.; Mayorga, F.; Valdebenito, M. A.: On the reliability of structures equipped with a class of friction-based devices under stochastic excitation (2020)
  14. Kanj, Iyad; Komusiewicz, Christian; Sorge, Manuel; van Leeuwen, Erik Jan: Solving partition problems almost always requires pushing many vertices around (2020)
  15. Mertzios, George B.; Nichterlein, André; Niedermeier, Rolf: The power of linear-time data reduction for maximum matching (2020)
  16. Mütze, Torsten; Nummenpalo, Jerri: A constant-time algorithm for middle levels Gray codes (2020)
  17. Swartz, Eric; Werner, Nicholas J.: On the number of reachable pairs in a digraph (2020)
  18. Boutin, Debra; Goliber, Victoria Horan; Pelto, Mikko: Identifying codes on directed de Bruijn graphs (2019)
  19. Chen, C. S.; Karageorghis, Andreas: Local RBF algorithms for elliptic boundary value problems in annular domains (2019)
  20. Dangerfield, Ciara E.; Vyska, Martin; Gilligan, Christopher A.: Resource allocation for epidemic control across multiple sub-populations (2019)

1 2 3 4 5 next