Superhamiltonian graphs. - Steve Alpern (J. Comb. Theory B, 1978)

The search value of a network. - Steve Alpern; Miroslav D. Asic (Networks, 1985)

Rendezvous Search on the Line with More Than Two Players. - Wei Shi Lim; Steve Alpern; Anatole Beck (Oper. Res., 1997)

Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting. - Steve Alpern; Anatole Beck (Oper. Res., 1999)

Asymmetric Rendezvous on the Line Is a Double Linear Search Problem. - Steve Alpern; Anatole Beck (Math. Oper. Res., 1999)

Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance. - Steve Alpern; Anatole Beck (Oper. Res., 2000)

Games of Crowding. - Steve Alpern; Diane J. Reyniers (IGTR, 2001)

Rendezvous Search: A Personal Perspective. - Steve Alpern (Oper. Res., 2002)

Searching for an Agent Who May OR May Not Want to be Found. - Steve Alpern; Shmuel Gal (Oper. Res., 2002)

The theory of search games and rendezvous. - Steve Alpern; Shmuel Gal (Kluwer, 2003)

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)

Line-of-sight rendezvous. - Steve Alpern (Eur. J. Oper. Res., 2008)

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

Hide-and-seek games on a tree to which Eulerian networks are attached. - Steve Alpern (Networks, 2008)

The ''Princess and Monster'' Game on an Interval. - Steve Alpern; Robbert Fokkink; Roy Lindelauf; Geert Jan Olsder (SIAM J. Control. Optim., 2008)

How to hide information for later use on networks. - Steve Alpern; Robbert Fokkink (GAMENETS, 2009)

Equilibria of two-sided matching games with common preferences. - Steve Alpern; Ioanna Katrantzi (Eur. J. Oper. Res., 2009)

Analysis and design of selection committees: a game theoretic secretary problem. - Steve Alpern; Shmuel Gal (Int. J. Game Theory, 2009)

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

Disperse or Unite? A Mathematical Model of Coordinated Attack. - Steve Alpern; Robbert Fokkink; Joram op den Kelder; Tom Lidbetter (GameSec, 2010)

A sequential selection game with vetoes. - Steve Alpern; Shmuel Gal; Eilon Solan (Games Econ. Behav., 2010)

Search Games on Trees with Asymmetric Travel Times. - Steve Alpern (SIAM J. Control. Optim., 2010)

On Ruckle's Conjecture on Accumulation Games. - Steve Alpern; Robbert Fokkink; Ken Kikuta (SIAM J. Control. Optim., 2010)

A New Approach to Gal's Theory of Search Games on Weakly Eulerian Networks. - Steve Alpern (Dyn. Games Appl., 2011)

Find-and-Fetch Search on a Tree. - Steve Alpern (Oper. Res., 2011)

Patrolling Games. - Steve Alpern; Alec Morton; Katerina Papadaki 001 (Oper. Res., 2011)

A Proof of the Kikuta-Ruckle Conjecture on Cyclic Caching of Resources. - Steve Alpern; Robbert Fokkink; Christos Pelekis (J. Optim. Theory Appl., 2012)

Partnership formation with age-dependent preferences. - Steve Alpern; Ioanna Katrantzi; David M. Ramsey (Eur. J. Oper. Res., 2013)

Mining Coal or Finding Terrorists: The Expanding Search Paradigm. - Steve Alpern; Thomas Lidbetter (Oper. Res., 2013)

On Search Games That Include Ambush. - Steve Alpern; Robbert Fokkink; Shmuel Gal; Marco Timmer (SIAM J. Control. Optim., 2013)

Illuminating a Network from Its Nodes. - Steve Alpern; Robbert Fokkink (Am. Math. Mon., 2013)

Searching a Variable Speed Network. - Steve Alpern; Thomas Lidbetter (Math. Oper. Res., 2014)

Accumulation games on graphs. - Steve Alpern; Robbert Fokkink (Networks, 2014)

Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object. - Steve Alpern; Thomas Lidbetter (Oper. Res., 2015)

Patrolling a Pipeline. - Steve Alpern; Thomas Lidbetter; Alec Morton; Katerina Papadaki 001 (GameSec, 2016)

Constant Factor Approximate Solutions for Expanding Search on General Networks. - Steve Alpern; Thomas Lidbetter (CoRR, 2016)

Search-and-Rescue Rendezvous. - Pierre Leone; Steve Alpern (CoRR, 2016)

Optimal search and ambush for a hider who can escape the search region. - Steve Alpern; Robbert Fokkink; Martin Simanjuntak (Eur. J. Oper. Res., 2016)

Patrolling a Border. - Katerina Papadaki 001; Steve Alpern; Thomas Lidbetter; Alec Morton (Oper. Res., 2016)

The importance of voting order for jury decisions by sequential majority voting. - Steve Alpern; Bo Chen 002 (Eur. J. Oper. Res., 2017)

Hide-and-Seek Games on a Network, Using Combinatorial Search Paths. - Steve Alpern (Oper. Res., 2017)

Winner-Take-All Games: The Strategic Optimisation of Rank. - Steve Alpern; J. V. Howard (Oper. Res., 2017)

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

A Game Model of Search and Pursuit. - Steve Alpern; Viciano Lee (CoRR, 2018)

Approximate solutions for expanding search games on general networks. - Steve Alpern; Thomas Lidbetter (Ann. Oper. Res., 2019)

A note on the Uniformed Patroller Game. - Steve Alpern; Stamatios Katsikas (CoRR, 2019)

A short solution to the many-player silent duel with arbitrary consolation prize. - Steve Alpern; J. V. Howard (Eur. J. Oper. Res., 2019)

Optimizing periodic patrols against short attacks on the line and other networks. - Steve Alpern; Thomas Lidbetter; Katerina Papadaki 001 (Eur. J. Oper. Res., 2019)

Search for an immobile Hider in a known subset of a network. - Steve Alpern (Theor. Comput. Sci., 2019)

Optimizing Voting Order on Sequential Juries: A Median Voter Theorem. - Steve Alpern; Bo Chen 002 (CoRR, 2020)

Continuous Patrolling Games. - Steve Alpern; Thomas Lidbetter; Katerina Papadaki 001 (CoRR, 2020)

Search and Delivery Man Problems: When are depth-first paths optimal? - Steve Alpern; Thomas Lidbetter (Eur. J. Oper. Res., 2020)

The Faulty GPS Problem: Shortest Time Paths in Networks with Unreliable Directions. - Steve Alpern (CoRR, 2021)

Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks. - Steve Alpern; Li Zeng (Dyn. Games Appl., 2022)

Search-and-rescue rendezvous. - Pierre Leone; Julia Buwaya; Steve Alpern (Eur. J. Oper. Res., 2022)

Adversarial Patrolling in a Uniform. - Steve Alpern; Paul Chleboun; Stamatios Katsikas; Kyle Y. Lin (Oper. Res., 2022)

A Symbolic Programming Approach to the Rendezvous Search Problem. - Pierre Leone; Steve Alpern (Oper. Res. Forum, 2022)

Optimizing voting order on sequential juries: a median voter theorem and beyond. - Steve Alpern; Bo Chen 002 (Soc. Choice Welf., 2022)

Continuous Patrolling Games. - Steve Alpern; Thuy Bui; Thomas Lidbetter; Katerina Papadaki 001 (Oper. Res., 2022)

Searching a Tree with Signals: Routing Mobile Sensors for Targets Emitting Radiation, Chemicals or Scents. - Steve Alpern; Thomas Lidbetter (CoRR, 2023)

The Faulty Satnav (GPS) Problem: Search for home in networks with unreliable directions. - Steve Alpern (Theor. Comput. Sci., 2023)

Search for an Immobile Hider on a Binary Tree with Unreliable Locational Information. - Steve Alpern; Thomas Lidbetter (Oper. Res., 2025)

Winner-take-all games: existence of equilibria and three player dice. - Steve Alpern (Int. J. Game Theory, 2025)