default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Asplund
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c1]Samuel Migirditch, John Asplund, William Curran:
Chaos engineering: stress-testing algorithms to facilitate resilient strategic military planning. GECCO Companion 2022: 2160-2167- 2020
- [j17]John Asplund, Brett Werner:
Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles. Discret. Math. 343(1): 111640 (2020) - [j16]David Amos, John Asplund, Boris Brimkov, Randy Davila:
The Slater and sub-k-domination number of a graph with applications to domination and k-domination. Discuss. Math. Graph Theory 40(1): 209-225 (2020) - [j15]John Asplund
, Melissa S. Keranen:
${\mathrm{TS}}(v, \lambda )$ with Cyclic 2-Intersecting Gray Codes: v=uiv 0 or 4±od 12. Graphs Comb. 36(3): 415-436 (2020)
2010 – 2019
- 2019
- [j14]John Asplund, Randy Davila, Elliot Krop:
A Vizing-type result for semi-total domination. Discret. Appl. Math. 258: 8-12 (2019) - [j13]John Asplund, Thao Do, Arran Hamm, Vishesh Jain:
On the k-planar local crossing number. Discret. Math. 342(4): 927-933 (2019) - [j12]John Asplund, Pierre Charbit, Carl Feghali:
Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations. Discret. Math. 342(8): 2195-2203 (2019) - [j11]John Asplund, N. Bradley Fox:
Minimum Coprime Labelings for Operations on Graphs. Integers 19: A24 (2019) - 2018
- [j10]John Asplund, Thao Do, Arran Hamm, László A. Székely, Libby Taylor, Zhiyu Wang:
k-planar crossing number of random graphs and random regular graphs. Discret. Appl. Math. 247: 419-422 (2018) - [j9]John Asplund, N. Bradley Fox:
Enumerating cycles in the graph of overlapping permutations. Discret. Math. 341(2): 427-438 (2018) - [j8]John Asplund, Kossi D. Edoh, Ruth Haas, Yulia Hristova, Beth Novick, Brett Werner:
Reconfiguration graphs of shortest paths. Discret. Math. 341(10): 2938-2948 (2018) - 2017
- [j7]John Asplund, Joe Chaffee, James M. Hammer:
Decomposition of a Complete Bipartite Multigraph into Arbitrary Cycle Sizes. Graphs Comb. 33(4): 715-728 (2017) - 2016
- [j6]John Asplund, David Kamin, Melissa S. Keranen, Adrián Pastine, Sibel Özkan:
On the Hamilton-Waterloo problem with triangle factors and C3x-factors. Australas. J Comb. 64: 458-474 (2016) - [j5]John Asplund, Jessica McDonald:
On a limit of the method of Tashkinov trees for edge-colouring. Discret. Math. 339(9): 2231-2238 (2016) - [i1]David Amos, John Asplund, Boris Brimkov, Randy Davila:
The sub-$k$-domination number of a graph with applications to $k$-domination. CoRR abs/1611.02379 (2016) - 2015
- [j4]John Asplund, C. A. Rodger, Melissa S. Keranen:
Enclosings of λ-fold 5-cycle systems for u=2. Discret. Math. 338(5): 743-765 (2015) - [j3]John Asplund:
5-cycle systems of (λ+m)Kv+1 - λKv and λKv+u - λKv. Discret. Math. 338(5): 766-783 (2015) - 2011
- [j2]John Asplund, Melissa S. Keranen:
Mutually orthogonal equitable Latin rectangles. Discret. Math. 311(12): 1015-1033 (2011) - 2010
- [j1]John Asplund, Melissa S. Keranen:
Proper edge coloring of BIBD(v, 4, λ)s. Australas. J Comb. 47: 59-76 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
