| Mining coal or finding terrorists: The expanding search paradigm S Alpern, T Lidbetter Operations Research 61 (2), 265-279, 2013 | 83 | 2013 |
| Bounds on the burning numbers of spiders and path-forests A Bonato, T Lidbetter Theoretical Computer Science 794, 12-19, 2019 | 64 | 2019 |
| Search games with multiple hidden objects T Lidbetter SIAM Journal on Control and Optimization 51 (4), 3056-3074, 2013 | 48 | 2013 |
| Patrolling a border K Papadaki, S Alpern, T Lidbetter, A Morton Operations Research 64 (6), 1256-1269, 2016 | 41 | 2016 |
| Searching a variable speed network S Alpern, T Lidbetter Mathematics of Operations research 39 (3), 697-711, 2014 | 32 | 2014 |
| The expanding search ratio of a graph S Angelopoulos, C Dürr, T Lidbetter Discrete Applied Mathematics 260, 51-65, 2019 | 30 | 2019 |
| A search game model of the scatter hoarder's problem S Alpern, R Fokkink, T Lidbetter, NS Clayton Journal of the Royal Society Interface 9 (70), 869-879, 2012 | 28 | 2012 |
| On submodular search and machine scheduling R Fokkink, T Lidbetter, LA Végh Mathematics of Operations Research 44 (4), 1431-1449, 2019 | 26 | 2019 |
| Search and rescue in the face of uncertain threats T Lidbetter European Journal of Operational Research 285 (3), 1153-1160, 2020 | 24 | 2020 |
| Optimizing periodic patrols against short attacks on the line and other networks S Alpern, T Lidbetter, K Papadaki European Journal of Operational Research 273 (3), 1065-1073, 2019 | 22* | 2019 |
| Optimal trade-off between speed and acuity when searching for a small object S Alpern, T Lidbetter Operations Research 63 (1), 122-133, 2015 | 20 | 2015 |
| Solving zero-sum games using best-response oracles with applications to search games L Hellerstein, T Lidbetter, D Pirutinsky Operations Research 67 (3), 731-743, 2019 | 19 | 2019 |
| A general framework for approximating min sum ordering problems F Happach, L Hellerstein, T Lidbetter INFORMS Journal on Computing 34 (3), 1437-1452, 2022 | 16 | 2022 |
| Searching for multiple objects in multiple locations T Lidbetter, KY Lin European Journal of Operational Research 278 (2), 709-720, 2019 | 14 | 2019 |
| Patrolling a pipeline S Alpern, T Lidbetter, A Morton, K Papadaki Decision and Game Theory for Security: 7th International Conference, GameSec …, 2016 | 14 | 2016 |
| Competitive search in a network S Angelopoulos, T Lidbetter European Journal of Operational Research 286 (2), 781-790, 2020 | 13 | 2020 |
| Approximate solutions for expanding search games on general networks S Alpern, T Lidbetter Annals of Operations Research 275 (2), 259-279, 2019 | 9 | 2019 |
| Hide-and-seek and other search games T Lidbetter London School of Economics and Political Science, 2013 | 8 | 2013 |
| A search game on a hypergraph with booby traps T Lidbetter, KY Lin Theoretical Computer Science 821, 57-70, 2020 | 6 | 2020 |
| The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines A Agnetis, T Lidbetter Operations Research Letters 48 (4), 405-409, 2020 | 5 | 2020 |
Steve AlpernProfessor of operational research, Warwick universityVerified email at wbs.ac.uk
