default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen Finbow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j23]Nancy E. Clarke, Stephen Finbow, Margaret-Ellen Messinger
, Amanda Porter:
A note on hyperopic cops and robber. Discret. Math. Algorithms Appl. 15(5): 2250127:1-2250127:14 (2023)- 2021
- [i5]Nancy E. Clarke, Stephen Finbow, Margaret-Ellen Messinger, Amanda Porter:
A note on hyperopic cops and robber. CoRR abs/2107.07368 (2021) - 2020
- [j22]Stephen Finbow, Martin F. van Bommel:
The eternal domination number for 3×n grid graphs. Australas. J Comb. 76: 1-23 (2020) - [j21]Yang Wang, Danjun Huang, Stephen Finbow:
On the vertex partition of planar graphs into forests with bounded degree. Appl. Math. Comput. 374: 125032 (2020) - [j20]Stephen Finbow, Rory MacIssac, Christopher M. van Bommel:
A short note on the existence of infinite sequences of γ-graphs of graphs. Discret. Appl. Math. 285: 182-187 (2020) - [j19]Andrea C. Burgess, Rosalind A. Cameron, Nancy E. Clarke, Peter Danziger, Stephen Finbow, Caleb W. Jones, David A. Pike:
Cops that surround a robber. Discret. Appl. Math. 285: 552-566 (2020) - [j18]Danjun Huang, Xiaoxiu Zhang, Weifan Wang, Stephen Finbow:
Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles. Discret. Math. Algorithms Appl. 12(4): 2050035:1-2050035:16 (2020)
2010 – 2019
- 2019
- [j17]Stephen Finbow, Christopher M. van Bommel:
γ-Graphs of Trees. Algorithms 12(8): 153 (2019) - [j16]Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger:
Hyperopic Cops and Robbers. Theor. Comput. Sci. 794: 59-68 (2019) - [i4]Andrea C. Burgess, Rosalind A. Cameron, Nancy E. Clarke, Peter Danziger, Stephen Finbow, Caleb W. Jones, David A. Pike:
Cops that surround a robber. CoRR abs/1910.14200 (2019) - 2018
- [j15]Stephen Finbow, Serge Gaspers, Margaret-Ellen Messinger, Paul Ottaway:
A note on the eternal dominating set problem. Int. J. Game Theory 47(2): 543-555 (2018) - 2017
- [i3]Anthony Bonato, Nancy E. Clarke, Danielle Cox, Stephen Finbow, Fionn Mc Inerney, Margaret-Ellen Messinger:
Hyperopic Cops and Robbers. CoRR abs/1710.10112 (2017) - 2016
- [j14]Nancy E. Clarke, Stephen Finbow, Shannon L. Fitzpatrick, Margaret-Ellen Messinger, Rebecca Milley, Richard J. Nowakowski:
A note on the Grundy number and graph products. Discret. Appl. Math. 202: 1-7 (2016) - 2015
- [j13]Stephen Finbow, Margaret-Ellen Messinger, Martin F. van Bommel:
Eternal domination on 3 × n grid graphs. Australas. J Comb. 61: 156-174 (2015) - [j12]Stephen Finbow, Christopher M. van Bommel:
Triangulations and equality in the domination chain. Discret. Appl. Math. 194: 81-92 (2015) - 2014
- [j11]Nancy E. Clarke, Stephen Finbow, Gary MacGillivray:
A simple method of computing the catch time. Ars Math. Contemp. 7(2): 353-359 (2014) - [j10]Anthony Bonato, Nancy E. Clarke, Stephen Finbow, Shannon L. Fitzpatrick, Margaret-Ellen Messinger:
A note on bounds for the cop number using tree decompositions. Contributions Discret. Math. 9(2) (2014) - [j9]Yuehua Bu, Stephen Finbow, Daphne Der-Fen Liu, Xuding Zhu:
List backbone colouring of graphs. Discret. Appl. Math. 167: 45-51 (2014) - [j8]Weifan Wang, Stephen Finbow, Ping Wang:
A lower bound of the surviving rate of a planar graph with girth at least seven. J. Comb. Optim. 27(4): 621-642 (2014) - [j7]Weifan Wang, Stephen Finbow, Jiangxu Kong:
The 2-surviving rate of planar graphs without 6-cycles. Theor. Comput. Sci. 518: 22-31 (2014) - 2013
- [j6]Iain Beaton, Rory Begin, Stephen Finbow, Christopher M. van Bommel:
Even time constraints on the watchman's walk. Australas. J Comb. 56: 113-122 (2013) - [i2]Anthony Bonato, Nancy E. Clarke, Stephen Finbow, Shannon L. Fitzpatrick, Margaret-Ellen Messinger:
A note on bounds for the cop number using tree decompositions. CoRR abs/1308.2839 (2013) - [i1]Anthony Bonato, Stephen Finbow, Przemyslaw Gordinowicz, Ali Haidar, William B. Kinnersley, Dieter Mitsche, Pawel Pralat, Ladislav Stacho:
The robber strikes back. CoRR abs/1308.2843 (2013) - 2012
- [j5]Weifan Wang, Stephen Finbow, Ping Wang:
An improved bound on parity vertex colourings of outerplane graphs. Discret. Math. 312(18): 2782-2787 (2012) - 2010
- [j4]Weifan Wang, Stephen Finbow, Ping Wang:
The surviving rate of an infected network. Theor. Comput. Sci. 411(40-42): 3651-3660 (2010)
2000 – 2009
- 2009
- [j3]Stephen Finbow, Gary MacGillivray:
The Firefighter Problem: a survey of results, directions and questions. Australas. J Comb. 43: 57-78 (2009) - [j2]Nancy E. Clarke, Stephen Finbow, Shannon L. Fitzpatrick, Margaret-Ellen Messinger, Richard J. Nowakowski:
Seepage in directed acyclic graphs. Australas. J Comb. 43: 91-102 (2009) - 2007
- [j1]Stephen Finbow, Andrew D. King, Gary MacGillivray, Romeo Rizzi:
The firefighter problem for graphs of maximum degree three. Discret. Math. 307(16): 2094-2105 (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-04-24 23:01 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:
