1.
Biedl T, Eppstein D, Ueckerdt T. On the Complexity of Embedding in Graph Products. CompGeomTop [Internet]. 2025 May 21 [cited 2025 Jun. 5];4(2):5:1-5:18. Available from: https://cgt-journal.org/index.php/cgt/article/view/56