default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBen Seamone
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Devvrit, Aaron Krim-Yee, Nithish Kumar, Gary MacGillivray
, Ben Seamone, Virgélot Virgile, Anqi Xu:
Fractional eternal domination: securely distributing resources across a network. Discuss. Math. Graph Theory 44(4): 1395-1428 (2024)- 2023
- [j14]Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The speed and threshold of the biased perfect matching and Hamilton cycle games. Discret. Appl. Math. 332: 23-40 (2023) - [i11]Devvrit, Aaron Krim-Yee, Nithish Kumar, Gary MacGillivray, Ben Seamone, Virgélot Virgile, Anqi Xu:
Fractional eternal domination: securely distributing resources across a network. CoRR abs/2304.11795 (2023) - 2022
- [j13]Manuel Lafond, Ben Seamone, Rezvan Sherkati:
Further results on Hendry's Conjecture. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [i10]Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo, Ben Seamone, Carol T. Zamfirescu:
Few hamiltonian cycles in graphs with one or two vertex degrees. CoRR abs/2211.08105 (2022) - 2021
- [j12]Pierre Charbit, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati:
Edge clique covers in graphs with independence number two. J. Graph Theory 97(2): 324-339 (2021) - [c3]Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The Speed and Threshold of the Biased Perfect Matching Game. LAGOS 2021: 190-199 - [c2]Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The Speed and Threshold of the Biased Hamilton Cycle Game. LAGOS 2021: 200-211 - 2020
- [j11]Ilya Gromovikov, William B. Kinnersley, Ben Seamone:
Fully active cops and robbers. Australas. J Comb. 76: 248-265 (2020) - [j10]Aaron Krim-Yee, Ben Seamone, Virgélot Virgile:
Eternal domination on prisms of graphs. Discret. Appl. Math. 283: 734-736 (2020) - [j9]Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone, Virgélot Virgile:
A method for eternally dominating strong grids. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [i9]Alizée Gagnon, Alexander Hassler, Jerry Huang, Aaron Krim-Yee, Fionn Mc Inerney, Andrés Zacarías, Ben Seamone, Virgélot Virgile:
A method for eternally dominating strong grids. CoRR abs/2003.01495 (2020) - [i8]Manuel Lafond, Ben Seamone, Rezvan Sherkati:
Further results on Hendry's Conjecture. CoRR abs/2007.07464 (2020)
2010 – 2019
- 2019
- [i7]Aaron Krim-Yee, Ben Seamone, Virgélot Virgile:
Eternal domination on prisms of graphs. CoRR abs/1902.00799 (2019) - 2018
- [i6]Ilya Gromovikov, William B. Kinnersley, Ben Seamone:
Fully Active Cops and Robbers. CoRR abs/1808.06734 (2018) - [i5]Devvrit Khatri, Natasha Komarov, Aaron Krim-Yee, Nithish Kumar, Ben Seamone, Virgélot Virgile, Anqi Xu:
Cops and robbers on oriented graphs. CoRR abs/1811.06155 (2018) - 2015
- [j8]Manuel Lafond, Ben Seamone:
Hamiltonian Chordal Graphs are not Cycle Extendable. SIAM J. Discret. Math. 29(2): 877-887 (2015) - 2014
- [j7]Ben Seamone:
Bounding the monomial index and (1, l)-weight choosability of a graph. Discret. Math. Theor. Comput. Sci. 16(3): 173-188 (2014) - 2013
- [j6]Ben Seamone, Brett Stevens:
Sequence variations of the 1-2-3 Conjecture and irregularity strength. Discret. Math. Theor. Comput. Sci. 15(1): 15-28 (2013) - [i4]Manuel Lafond, Ben Seamone:
Hamiltonian chordal graphs are not cycle extendible. CoRR abs/1311.5863 (2013) - 2012
- [j5]Ben Seamone, Brett Stevens:
Spanning trees with specified differences in Cayley graphs. Discret. Math. 312(17): 2561-2565 (2012) - [j4]Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens:
Vertex-colouring edge-weightings with two edge weights. Discret. Math. Theor. Comput. Sci. 14(1): 1-20 (2012) - [j3]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
π/2-Angle Yao Graphs are Spanners. Int. J. Comput. Geom. Appl. 22(1): 61-82 (2012) - [i3]Ben Seamone, Brett Stevens:
Sequence variations of the 1-2-3 Conjecture and irregularity strength. CoRR abs/1211.0463 (2012) - [i2]Ben Seamone:
The 1-2-3 Conjecture and related problems: a survey. CoRR abs/1211.5122 (2012) - 2011
- [j2]Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens:
Digraphs are 2-Weight Choosable. Electron. J. Comb. 18(1) (2011) - 2010
- [c1]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
pi/2-Angle Yao Graphs Are Spanners. ISAAC (2) 2010: 446-457 - [i1]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
Pi/2-Angle Yao Graphs are Spanners. CoRR abs/1001.2913 (2010)
2000 – 2009
- 2007
- [j1]Penny E. Haxell, Ben Seamone, Jacques Verstraëte:
Independent dominating sets and hamiltonian cycles. J. Graph Theory 54(3): 233-244 (2007)
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 2024-09-10 02:05 CEST 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:
