John Asplund

According to our database, John Asplund authored at least 19 papers between 2010 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Chaos engineering: stress-testing algorithms to facilitate resilient strategic military planning.

Samuel Migirditch, John Asplund, William Curran

Proceedings of the GECCO '22: Genetic and Evolutionary Computation Conference, Companion Volume, Boston, Massachusetts, USA, July 9, 2022

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

The Slater and sub-<i>k</i>-domination number of a graph with applications to domination and <i>k</i>-domination.

David Amos, John Asplund, Boris Brimkov, Randy Davila

Discuss. Math. Graph Theory, 2020

Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles.

John Asplund, Brett Werner

Discret. Math., 2020

2019

Minimum Coprime Labelings for Operations on Graphs.

John Asplund, N. Bradley Fox

Integers, 2019

On the k-planar local crossing number.

John Asplund, Thao Do, Arran Hamm, Vishesh Jain

Discret. Math., 2019

Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations.

John Asplund, Pierre Charbit, Carl Feghali

Discret. Math., 2019

A Vizing-type result for semi-total domination.

John Asplund, Randy Davila, Elliot Krop

Discret. Appl. Math., 2019

2018

Enumerating cycles in the graph of overlapping permutations.

John Asplund, N. Bradley Fox

Discret. Math., 2018

Reconfiguration graphs of shortest paths.

John Asplund, Kossi D. Edoh, Ruth Haas, Yulia Hristova, Beth Novick, Brett Werner

Discret. Math., 2018

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

2017

Decomposition of a Complete Bipartite Multigraph into Arbitrary Cycle Sizes.

John Asplund, Joe Chaffee, James M. Hammer

Graphs Comb., 2017

2016

On a limit of the method of Tashkinov trees for edge-colouring.

John Asplund, Jessica McDonald

Discret. Math., 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 the Hamilton-Waterloo problem with triangle factors and C_3x-factors.

John Asplund, David Kamin, Melissa S. Keranen, Adrián Pastine, Sibel Özkan

Australas. J Comb., 2016

2015

Enclosings of λ-fold 5-cycle systems for u=2.

John Asplund, C. A. Rodger, Melissa S. Keranen

Discret. Math., 2015

5-cycle systems of (λ+m)_Kv+1 - λ_Kv and λ_Kv+u - λ_Kv.

John Asplund

Discret. Math., 2015

2011

Mutually orthogonal equitable Latin rectangles.

John Asplund, Melissa S. Keranen

Discret. Math., 2011

2010

Proper edge coloring of BIBD(v, 4, λ)s.

John Asplund, Melissa S. Keranen

Australas. J Comb., 2010