Probabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning. - Enrique Fita Sanmartin; Sebastian Damrich; Fred A. Hamprecht (NeurIPS, 2019)

Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice. - Erik Jenner; Enrique Fita Sanmartín; Fred A. Hamprecht (ICCV, 2021)

Directed Probabilistic Watershed. - Enrique Fita Sanmartin; Sebastian Damrich; Fred A. Hamprecht (NeurIPS, 2021)

The Algebraic Path Problem for Graph Metrics. - Enrique Fita Sanmartín; Sebastian Damrich; Fred A. Hamprecht (ICML, 2022)

Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources. - Peter Lippmann; Enrique Fita Sanmartín; Fred A. Hamprecht (NeurIPS, 2022)

The Central Spanning Tree Problem. - Enrique Fita Sanmartín; Christoph Schnörr; Fred A. Hamprecht (CoRR, 2024)

Expectation and Variance of the Degree of a Node in Random Spanning Trees. - Enrique Fita Sanmartín; Christoph Schnörr; Fred A. Hamprecht (CoRR, 2024)

Exploring Graph Structures: Learning and Analysis. - Enrique Fita Sanmartin (2024)