Copying Configurations in Algebraic Extensions of Prime Fields. - V. J. Baston; F. A. Bostock (J. Comb. Theory A, 1977)

Generalizations of a Combinatorial Lemma of Kelly. - V. J. Baston; F. A. Bostock (J. Comb. Theory A, 1977)

A Gallai-Type Problem. - V. J. Baston; F. A. Bostock (J. Comb. Theory A, 1978)

A non-zero-zum War of Attrition. - Victor J. Baston; Andrej Yu. Garnaev (Math. Methods Oper. Res., 1997)

On a game in manufacturing. - Victor J. Baston; Andrej Yu. Garnaev (Math. Methods Oper. Res., 2000)

An Ambush Game with an Unknown Number of Infiltrators. - Vic Baston; Kensaku Kikuta (Oper. Res., 2004)

Rendezvous on a Planar Lattice. - Steve Alpern; Vic Baston (Oper. Res., 2005)

A common notion of clockwise can help in planar rendezvous. - Steve Alpern; Vic Baston (Eur. J. Oper. Res., 2006)

Rendezvous in Higher Dimensions. - Steve Alpern; Vic Baston (SIAM J. Control. Optim., 2006)

Network search games with immobile hider, without a designated searcher starting point. - Steve Alpern; Vic Baston; Shmuel Gal (Int. J. Game Theory, 2008)

Technical Note - An Ambush Game with a Fat Infiltrator. - Vic Baston; Kensaku Kikuta (Oper. Res., 2009)

Searching symmetric networks with Utilitarian-Postman paths. - Steve Alpern; Vic Baston; Shmuel Gal (Networks, 2009)

Search games on networks with travelling and search costs and with arbitrary searcher starting points. - Vic Baston; Kensaku Kikuta (Networks, 2013)

Search games on a network with travelling and search costs. - Vic Baston; Kensaku Kikuta (Int. J. Game Theory, 2015)

The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries? - Steve Alpern; Vic Baston (Manag. Sci., 2017)

A search problem on a bipartite network. - Vic Baston; Kensaku Kikuta (Eur. J. Oper. Res., 2019)