1. Biasotti, S., Cerri, A., Frosini, P., Giorgi, D., Landi, C.: Multidimensional size functions for shape comparison. J. Math. Imaging Vis. 32(2), 161–179 (2008)
2. Biasotti, S., Cerri, A., Frosini, P., Giorgi, D.: A new algorithm for computing the 2-dimensional matching distance between size functions. Pattern Recogn. Lett. 32(14), 1735–1746 (2011)
3. Bjerkevik, H.B.: Stability of higher-dimensional interval decomposable persistence modules. ArXiv e-prints (2016).
arXiv:1609.02086
4. Bjerkevik, H.B., Botnan, M.B.: Computational complexity of the interleaving distance. In: Speckmann, B., Tóth, C.D.(eds.) 34th International Symposium on Computational Geometry (SoCG 2018), Leibniz International Proceedings in Informatics (LIPIcs), pp. 13:1–13:15. Dagstuhl, Germany (2018). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
5. Bjerkevik, H.B., Botnan, M.B., Kerber, M.: Computing the interleaving distance is NP-hard. CoRR (2018).
arXiv:1811.09165