Proper edge coloring of BIBD(v, 4, λ)s. - John Asplund; Melissa S. Keranen (Australas. J Comb., 2010)

Mutually orthogonal equitable Latin rectangles. - John Asplund; Melissa S. Keranen (Discret. Math., 2011)

5-cycle systems of (λ+m)Kv+1 - λKv and λKv+u - λKv. - John Asplund (Discret. Math., 2015)

Enclosings of λ-fold 5-cycle systems for u=2. - John Asplund; C. A. Rodger; Melissa S. Keranen (Discret. Math., 2015)

On the Hamilton-Waterloo problem with triangle factors and C3x-factors. - John Asplund; David Kamin; Melissa S. Keranen; Adrián Pastine; Sibel Özkan (Australas. J Comb., 2016)

The sub-$k$-domination number of a graph with applications to $k$-domination. - David Amos; John Asplund; Boris Brimkov; Randy Davila (CoRR, 2016)

On a limit of the method of Tashkinov trees for edge-colouring. - John Asplund; Jessica McDonald (Discret. Math., 2016)

Decomposition of a Complete Bipartite Multigraph into Arbitrary Cycle Sizes. - John Asplund; Joe Chaffee; James M. Hammer (Graphs Comb., 2017)

k-planar crossing number of random graphs and random regular graphs. - John Asplund; Thao Do; Arran Hamm; László A. Székely; Libby Taylor; Zhiyu Wang (Discret. Appl. Math., 2018)

Reconfiguration graphs of shortest paths. - John Asplund; Kossi D. Edoh; Ruth Haas; Yulia Hristova; Beth Novick; Brett Werner (Discret. Math., 2018)

Enumerating cycles in the graph of overlapping permutations. - John Asplund; N. Bradley Fox (Discret. Math., 2018)

A Vizing-type result for semi-total domination. - John Asplund; Randy Davila; Elliot Krop (Discret. Appl. Math., 2019)

Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations. - John Asplund; Pierre Charbit; Carl Feghali (Discret. Math., 2019)

On the k-planar local crossing number. - John Asplund; Thao Do; Arran Hamm; Vishesh Jain (Discret. Math., 2019)

Minimum Coprime Labelings for Operations on Graphs. - John Asplund; N. Bradley Fox (Integers, 2019)

Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles. - John Asplund; Brett Werner (Discret. Math., 2020)

The Slater and sub-k-domination number of a graph with applications to domination and k-domination. - David Amos; John Asplund; Boris Brimkov; Randy Davila (Discuss. Math. Graph Theory, 2020)

${ mathrm{TS}}(v, lambda )$ with Cyclic 2-Intersecting Gray Codes: v=uiv 0 or 4±od 12. - John Asplund; Melissa S. Keranen (Graphs Comb., 2020)

Chaos engineering: stress-testing algorithms to facilitate resilient strategic military planning. - Samuel Migirditch; John Asplund; William Curran (GECCO Companion, 2022)