Enrique Fita Sanmartin

According to our database, Enrique Fita Sanmartin authored at least 8 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Exploring Graph Structures: Learning and Analysis.

Enrique Fita Sanmartin

PhD thesis, 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

The Central Spanning Tree Problem.

Enrique Fita Sanmartín, Christoph Schnörr, Fred A. Hamprecht

CoRR, 2024

2022

Theory and Approximate Solvers for Branched Optimal Transport with Multiple Sources.

Peter Lippmann, Enrique Fita Sanmartín, Fred A. Hamprecht

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

The Algebraic Path Problem for Graph Metrics.

Enrique Fita Sanmartín, Sebastian Damrich, Fred A. Hamprecht

Proceedings of the International Conference on Machine Learning, 2022

2021

Directed Probabilistic Watershed.

Enrique Fita Sanmartin, Sebastian Damrich, Fred A. Hamprecht

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

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

Proceedings of the 2021 IEEE/CVF International Conference on Computer Vision, 2021

2019

Probabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning.

Enrique Fita Sanmartin, Sebastian Damrich, Fred A. Hamprecht

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019