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

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

Search Games with Multiple Hidden Objects. - Thomas Lidbetter (SIAM J. Control. Optim., 2013)

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

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

A Caching Game with Infinitely Divisible Hidden Material. - Thomas Lidbetter (SIAM J. Control. Optim., 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)

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

An Algorithmic Approach to Search Games: Finding Solutions Using Best Response Oracles. - Lisa Hellerstein; Thomas Lidbetter (CoRR, 2017)

On the approximation ratio of the Random Chinese Postman Tour for network search. - Thomas Lidbetter (Eur. J. Oper. Res., 2017)

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

The expanding search ratio of a graph. - Spyros Angelopoulos 001; Christoph Dürr; Thomas Lidbetter (Discret. Appl. Math., 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)

Searching for multiple objects in multiple locations. - Thomas Lidbetter; Kyle Y. Lin (Eur. J. Oper. Res., 2019)

Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games. - Lisa Hellerstein; Thomas Lidbetter; Daniel Pirutinsky (Oper. Res., 2019)

On Submodular Search and Machine Scheduling. - Robbert Fokkink; Thomas Lidbetter; László A. Végh (Math. Oper. Res., 2019)

Bounds on the burning numbers of spiders and path-forests. - Anthony Bonato; Thomas Lidbetter (Theor. Comput. Sci., 2019)

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)

Competitive search in a network. - Spyros Angelopoulos 001; Thomas Lidbetter (Eur. J. Oper. Res., 2020)

Search and rescue in the face of uncertain threats. - Thomas Lidbetter (Eur. J. Oper. Res., 2020)

The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines. - Alessandro Agnetis; Thomas Lidbetter (Oper. Res. Lett., 2020)

A search game on a hypergraph with booby traps. - Thomas Lidbetter; Kyle Y. Lin (Theor. Comput. Sci., 2020)

A Polyhedral Approach to Some Max-min Problems. - Lisa Hellerstein; Thomas Lidbetter (CoRR, 2021)

A Local Search Algorithm for the Min-Sum Submodular Cover Problem. - Lisa Hellerstein; Thomas Lidbetter; R. Teal Witter (ISAAC, 2022)

An Optimal Patrolling Strategy for Tree Networks. - Thomas Lidbetter; Thuy Bui (CoRR, 2022)

A General Framework for Approximating Min Sum Ordering Problems. - Felix Happach; Lisa Hellerstein; Thomas Lidbetter (INFORMS J. Comput., 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)

A game theoretic approach to a problem in polymatroid maximization. - Lisa Hellerstein; Thomas Lidbetter (Eur. J. Oper. Res., 2023)

The search and rescue game on a cycle. - Thomas Lidbetter; Yifan Xie (Theor. Comput. Sci., 2023)

Optimal patrolling strategies for trees and complete networks. - Thuy Bui; Thomas Lidbetter (Eur. J. Oper. Res., 2023)

Search Games with Predictions. - Spyros Angelopoulos 001; Thomas Lidbetter; Konstantinos Panagiotou (CoRR, 2024)

Optimal pure strategies for a discrete search game. - Thuy Bui; Thomas Lidbetter; Kyle Y. Lin (Eur. J. Oper. Res., 2024)

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

A review of minimum cost box searching games. - Thomas Lidbetter (CoRR, 2025)