Algebraic optimization degree. - Marc Härkönen; Benjamin Hollering; Fatemeh Tarashi Kashani; Jose Israel Rodriguez (ACM Commun. Comput. Algebra, 2020)

Markov equivalence of max-linear Bayesian networks. - Carlos Améndola; Benjamin Hollering; Seth Sullivant; Ngoc Tran (UAI, 2021)

Identifiability in phylogenetics using algebraic matroids. - Benjamin Hollering; Seth Sullivant (J. Symb. Comput., 2021)

Exchangeable and sampling-consistent distributions on rooted binary trees. - Benjamin Hollering; Seth Sullivant (J. Appl. Probab., 2022)

Toric Fiber Products in Geometric Modeling. - Eliana Duarte; Benjamin Hollering; Maximilian Wiesmann (GSI (1), 2023)

Invariants for level-1 phylogenetic networks under the Cavendar-Farris-Neyman model. - Joseph Cummings; Benjamin Hollering; Christopher Manon (Adv. Appl. Math., 2024)

Identifiability of homoscedastic linear structural equation models using algebraic matroids. - Mathias Drton; Benjamin Hollering; Jun Wu (Adv. Appl. Math., 2025)

Combinatorics of Correlated Equilibria. - Marie-Charlotte Brandenburg; Benjamin Hollering; Irem Portakal (Exp. Math., 2025)

Computing implicitizations of multi-graded polynomial maps. - Joseph Cummings; Benjamin Hollering (J. Symb. Comput., 2026)