default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBen Cameron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j15]Ben Cameron, Aysu Gündogan, Joe Sawada
:
Cut-down de Bruijn sequences. Discret. Math. 348(1): 114204 (2025)- 2024
- [j14]Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada:
Vertex-critical (P3+ℓP1)-free and vertex-critical (gem, co-gem)-free graphs. Discret. Appl. Math. 344: 179-187 (2024) - [j13]Ben Cameron, Chính T. Hoàng:
Infinite Families of k-Vertex-Critical (P5, C5)-Free Graphs. Graphs Comb. 40(2): 30 (2024) - [j12]Ben Cameron, Aaron Grubb, Joe Sawada:
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan. Graphs Comb. 40(4): 78 (2024) - [c3]Melvin Adekanye, Christopher Bury, Ben Cameron, Thaler Knodel:
On the Finiteness of k-Vertex-Critical 2P2-Free Graphs with Forbidden Induced Squids or Bulls. IWOCA 2024: 301-313 - [i11]Melvin Adekanye, Christopher Bury, Ben Cameron, Thaler Knodel:
On the finiteness of k-vertex-critical 2P2-free graphs with forbidden induced squids or bulls. CoRR abs/2402.15908 (2024) - [i10]Iain Beaton, Ben Cameron:
Vertex-critical graphs in co-gem-free graphs. CoRR abs/2408.05027 (2024) - 2023
- [j11]Ben Cameron, Joe Sawada, Wei Therese, Aaron Williams:
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality. Algorithmica 85(3): 717-744 (2023) - [j10]Ben Cameron, Chính T. Hoàng:
A refinement on the structure of vertex-critical (P5, gem)-free graphs. Theor. Comput. Sci. 961: 113936 (2023) - [i9]Ben Cameron, Chính T. Hoàng:
Infinite families of k-vertex-critical (P5, C5)-free graphs. CoRR abs/2306.03376 (2023) - 2022
- [j9]Ben Cameron, Chính T. Hoàng, Joe Sawada:
Dichotomizing k-vertex-critical H-free graphs for H of order four. Discret. Appl. Math. 312: 106-115 (2022) - [j8]Maimoonah Ahmed, Ben Cameron:
The node cop-win reliability of unicyclic and bicyclic graphs. Networks 79(2): 189-201 (2022) - [i8]Ben Cameron, Aaron Grubb, Joe Sawada:
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan. CoRR abs/2202.01746 (2022) - [i7]Ben Cameron, Aysu Gündogan, Joe Sawada:
Cut-Down de Bruijn Sequences. CoRR abs/2205.02815 (2022) - [i6]Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada:
Vertex-critical (P3+𝓁P1)-free and vertex-critical (gem, co-gem)-free graphs. CoRR abs/2206.03422 (2022) - [i5]Iain Beaton, Ben Cameron:
A Tight Upper Bound on the Average Order of Dominating Sets of a Graph. CoRR abs/2208.10475 (2022) - [i4]Ben Cameron, Chính T. Hoàng:
A refinement on the structure of vertex-critical (P5, gem)-free graphs. CoRR abs/2212.04659 (2022) - 2021
- [j7]Ben Cameron, Lucas Mol:
On the mean subtree order of graphs under edge addition. J. Graph Theory 96(3): 403-413 (2021) - [c2]Ben Cameron, Aaron Grubb, Joe Sawada:
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. COCOON 2021: 49-60 - [c1]Ben Cameron, Joe Sawada, Aaron Williams:
A Hamilton Cycle in the k-Sided Pancake Network. IWOCA 2021: 137-151 - [i3]Ben Cameron, Joe Sawada, Aaron Williams:
A Hamilton Cycle in the k-Sided Pancake Network. CoRR abs/2103.09256 (2021) - [i2]Ben Cameron, Aaron Grubb, Joe Sawada:
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph. CoRR abs/2108.09363 (2021) - 2020
- [j6]Jason I. Brown, Ben Cameron:
A note on purely imaginary independence roots. Discret. Math. 343(12): 112113 (2020) - [j5]Jason I. Brown, Ben Cameron:
Maximum Modulus of Independence Roots of Graphs and Trees. Graphs Comb. 36(3): 877-894 (2020) - [i1]Ben Cameron, Chính T. Hoàng, Joe Sawada:
Dichotomizing k-vertex-critical H-free graphs for H of order four. CoRR abs/2007.00057 (2020)
2010 – 2019
- 2019
- [j4]Iain Beaton, Jason I. Brown, Ben Cameron:
Independence equivalence classes of paths and cycles. Australas. J Comb. 75: 127-145 (2019) - 2018
- [j3]Jason I. Brown, Ben Cameron:
On the Stability of Independence Polynomials. Electron. J. Comb. 25(1): 1 (2018) - [j2]Jason I. Brown, Ben Cameron:
On the unimodality of independence polynomials of very well-covered graphs. Discret. Math. 341(4): 1138-1143 (2018) - 2015
- [j1]Ben Cameron, Shannon L. Fitzpatrick:
Edge contraction and cop-win critical graphs. Australas. J Comb. 63: 70-87 (2015)
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-09 13:24 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:
