T. Biedl, D. Eppstein, and T. Ueckerdt, “On the Complexity of Embedding in Graph Products”, CompGeomTop, vol. 4, no. 2, pp. 5:1–5:18, May 2025.