Paths of Length Three are $K_{r+1}$-Turán-Good. - Kyle Murphy; JD Nir (Electron. J. Comb., 2021)

Supersaturation for Subgraph Counts. - Jonathan Cutler; J. D. Nir; A. J. Radcliffe (Graphs Comb., 2022)

Every graph is eventually Turán-good. - Natasha Morrison; JD Nir; Sergey Norin; Pawel Rzazewski; Alexandra Wesolek (J. Comb. Theory B, 2023)

The one-visibility localization game. - Anthony Bonato; Trent G. Marbach; Michael Molnar; JD Nir (Theor. Comput. Sci., 2023)

Adversarial graph burning densities. - Karen Gunderson; William Kellough; J. D. Nir; Hritik Punj (Discret. Math., 2025)