[1]
K. Rose, E. Burns, and W. Ruml, “Best-First Search for Bounded-Depth Trees”, SOCS, vol. 2, no. 1, pp. 134–141, Aug. 2021.