The r-Matching Sequencibility of Complete Graphs. - Adam Mammoliti (Electron. J. Comb., 2018)

Balanced diagonals in frequency squares. - Nicholas J. Cavenagh; Adam Mammoliti (Discret. Math., 2018)

On Mubayi's Conjecture and Conditionally Intersecting Sets. - Adam Mammoliti; Thomas Britz (SIAM J. Discret. Math., 2018)

The r-matching sequencibility of complete multi-k-partite k-graphs. - Adam Mammoliti (Australas. J Comb., 2019)

On the matching sequencibility, the Erdős-Ko-Rado Theorem and other unrelated stuff. - Adam Mammoliti (2019)

Permutations in which pairs of numbers are not simultaneously close in position and close in size. - Adam Mammoliti; Jamie Simpson (Australas. J Comb., 2020)

Mutually Orthogonal Binary Frequency Squares. - Thomas Britz; Nicholas J. Cavenagh; Adam Mammoliti; Ian M. Wanless (Electron. J. Comb., 2020)

Wei-type duality theorems for rank metric codes. - Thomas Britz; Adam Mammoliti; Keisuke Shiromoto (Des. Codes Cryptogr., 2020)

Maximal sets of mutually orthogonal frequency squares. - Nicholas J. Cavenagh; Adam Mammoliti; Ian M. Wanless (Des. Codes Cryptogr., 2021)

Latin squares with maximal partial transversals of many lengths. - Anthony B. Evans; Adam Mammoliti; Ian M. Wanless (J. Comb. Theory A, 2021)

The cyclic matching sequenceability of regular graphs. - Daniel Horsley; Adam Mammoliti (J. Graph Theory, 2021)

Minimising the total number of subsets and supersets. - Adam Gowty; Daniel Horsley; Adam Mammoliti (Eur. J. Comb., 2024)

Exact values for some unbalanced Zarankiewicz numbers. - Guangzhou Chen; Daniel Horsley; Adam Mammoliti (J. Graph Theory, 2024)

Canonical Labeling of Latin Squares in Average-Case Polynomial Time. - Michael J. Gill; Adam Mammoliti; Ian M. Wanless (Random Struct. Algorithms, 2025)