Biedl, T., Eppstein, D. and Ueckerdt, T. (2025) “On the Complexity of Embedding in Graph Products”, Computing in Geometry and Topology, 4(2), pp. 5:1–5:18. doi: 10.57717/cgt.v4i2.56.