1. The computational complexity of knot genus and spanning area
2. A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
3. Bell, M. C. (2016). Simplifying triangulations, ArXiv e-prints.
4. Bell, M. C. curver (computer software). Available at: pypi.python.org/pypi/curver, 2017–2019, Version 0.3.5.
5. Delecroix, V., Goujard, E., Zograf, P., Zorich, A. (2019). Masur-Veech volumes, frequencies of simple closed geodesics and intersection numbers of moduli spaces of curves, arXiv e-prints. arXiv:1908.08611.