Tuza's Conjecture is Asymptotically Tight for Dense Graphs. - Jacob D. Baron; Jeff Kahn 001 (Comb. Probab. Comput., 2016)

On the cycle space of a random graph. - Jacob D. Baron; Jeff Kahn 001 (Random Struct. Algorithms, 2019)

Partitioned K-nearest neighbor local depth for scalable comparison-based learning. - Jacob D. Baron; R. W. R. Darling; J. Laylon Davis; R. Pettit (CoRR, 2021)

Empirical complexity of comparator-based nearest neighbor descent. - Jacob D. Baron; R. W. R. Darling (CoRR, 2022)