ISTA Research Explorer

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

Additive partial matchings induced by persistence maps
R. Gonzalez-Diaz, M. Soriano Trigueros, A. Torras-Casas, Journal of Symbolic Computation 138 (2026).

[Published Version] View | DOI | Download Published Version (ext.) | arXiv

2013 | Published | Journal Article | IST-REx-ID: 5920 |

Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
C.J. Hillar, A. Martin del Campo Sanchez, Journal of Symbolic Computation 50 (2013) 314–334.

[Published Version] View | Files available | DOI | Download Published Version (ext.)

1990 | Published | Journal Article | IST-REx-ID: 4060 |

Tetrahedrizing point sets in three dimensions
H. Edelsbrunner, F. Preparata, D. West, Journal of Symbolic Computation 10 (1990) 335–347.

[Published Version] View | DOI | Download Published Version (ext.)

1986 | Published | Journal Article | IST-REx-ID: 4106

Computing a ham-sandwich cut in two dimensions
H. Edelsbrunner, R. Waupotitsch, Journal of Symbolic Computation 2 (1986) 171–178.

View | DOI

1985 | Published | Journal Article | IST-REx-ID: 4120 |

Optimal solutions for a class of point retrieval problems
B. Chazelle, H. Edelsbrunner, Journal of Symbolic Computation 1 (1985) 47–56.

[Published Version] View | DOI | Download Published Version (ext.)