V. J. Baston

According to our database1, V. J. Baston authored at least 16 papers between 1977 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A search problem on a bipartite network.
Eur. J. Oper. Res., 2019

2017
The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries?
Manag. Sci., 2017

2015
Search games on a network with travelling and search costs.
Int. J. Game Theory, 2015

2013
Search games on networks with travelling and search costs and with arbitrary searcher starting points.
Networks, 2013

2009
Searching symmetric networks with Utilitarian-Postman paths.
Networks, 2009

Technical Note - An Ambush Game with a Fat Infiltrator.
Oper. Res., 2009

2008
Network search games with immobile hider, without a designated searcher starting point.
Int. J. Game Theory, 2008

2006
Rendezvous in Higher Dimensions.
SIAM J. Control. Optim., 2006

A common notion of clockwise can help in planar rendezvous.
Eur. J. Oper. Res., 2006

2005
Rendezvous on a Planar Lattice.
Oper. Res., 2005

2004
An Ambush Game with an Unknown Number of Infiltrators.
Oper. Res., 2004

2000
On a game in manufacturing.
Math. Methods Oper. Res., 2000

1997
A non-zero-zum War of Attrition.
Math. Methods Oper. Res., 1997

1978
A Gallai-Type Problem.
J. Comb. Theory, Ser. A, 1978

1977
Generalizations of a Combinatorial Lemma of Kelly.
J. Comb. Theory, Ser. A, 1977

Copying Configurations in Algebraic Extensions of Prime Fields.
J. Comb. Theory, Ser. A, 1977


  Loading...