default search action
V. J. Baston
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j16]Vic Baston, Kensaku Kikuta:
A search problem on a bipartite network. Eur. J. Oper. Res. 277(1): 227-237 (2019) - 2017
- [j15]Steve Alpern, Vic Baston:
The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries? Manag. Sci. 63(4): 1184-1197 (2017) - 2015
- [j14]Vic Baston, Kensaku Kikuta:
Search games on a network with travelling and search costs. Int. J. Game Theory 44(2): 347-365 (2015) - 2013
- [j13]Vic Baston, Kensaku Kikuta:
Search games on networks with travelling and search costs and with arbitrary searcher starting points. Networks 62(1): 72-79 (2013)
2000 – 2009
- 2009
- [j12]Vic Baston, Kensaku Kikuta:
Technical Note - An Ambush Game with a Fat Infiltrator. Oper. Res. 57(2): 514-519 (2009) - [j11]Steve Alpern, Vic Baston, Shmuel Gal:
Searching symmetric networks with Utilitarian-Postman paths. Networks 53(4): 392-402 (2009) - 2008
- [j10]Steve Alpern, Vic Baston, Shmuel Gal:
Network search games with immobile hider, without a designated searcher starting point. Int. J. Game Theory 37(2): 281-302 (2008) - 2006
- [j9]Steve Alpern, Vic Baston:
A common notion of clockwise can help in planar rendezvous. Eur. J. Oper. Res. 175(2): 688-706 (2006) - [j8]Steve Alpern, Vic Baston:
Rendezvous in Higher Dimensions. SIAM J. Control. Optim. 44(6): 2233-2252 (2006) - 2005
- [j7]Steve Alpern, Vic Baston:
Rendezvous on a Planar Lattice. Oper. Res. 53(6): 996-1006 (2005) - 2004
- [j6]Vic Baston, Kensaku Kikuta:
An Ambush Game with an Unknown Number of Infiltrators. Oper. Res. 52(4): 597-605 (2004) - 2000
- [j5]Victor J. Baston, Andrej Yu. Garnaev
:
On a game in manufacturing. Math. Methods Oper. Res. 52(2): 237-249 (2000)
1990 – 1999
- 1997
- [j4]Victor J. Baston, Andrej Yu. Garnaev
A non-zero-zum War of Attrition. Math. Methods Oper. Res. 45(2): 197-211 (1997)
1970 – 1979
- 1978
- [j3]V. J. Baston, F. A. Bostock:
A Gallai-Type Problem. J. Comb. Theory A 24(1): 122-125 (1978) - 1977
- [j2]V. J. Baston, F. A. Bostock:
Copying Configurations in Algebraic Extensions of Prime Fields. J. Comb. Theory A 22(1): 115-117 (1977) - [j1]V. J. Baston, F. A. Bostock:
Generalizations of a Combinatorial Lemma of Kelly. J. Comb. Theory A 22(2): 241-245 (1977)
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-06-10 20:28 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: