Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., &; Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611977554.ch173 

Anastos, M. (2023). Fast algorithms for solving the Hamilton cycle problem with high probability. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2023, pp. 2286–2323). Florence, Italy: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611977554.ch88