default search action
Tom Lidbetter
Person information
- affiliation: Rutgers University, Newark, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j25]Thuy Bui
, Thomas Lidbetter, Kyle Y. Lin:
Optimal pure strategies for a discrete search game. Eur. J. Oper. Res. 313(2): 767-775 (2024) - [i14]Spyros Angelopoulos, Thomas Lidbetter, Konstantinos Panagiotou:
Search Games with Predictions. CoRR abs/2401.01149 (2024) - 2023
- [j24]Lisa Hellerstein
A game theoretic approach to a problem in polymatroid maximization. Eur. J. Oper. Res. 305(2): 979-988 (2023) - [j23]Thuy Bui
Optimal patrolling strategies for trees and complete networks. Eur. J. Oper. Res. 311(2): 769-776 (2023) - [j22]Thomas Lidbetter
The search and rescue game on a cycle. Theor. Comput. Sci. 966-967: 114016 (2023) - [i13]Steve Alpern, Thomas Lidbetter:
Searching a Tree with Signals: Routing Mobile Sensors for Targets Emitting Radiation, Chemicals or Scents. CoRR abs/2303.13378 (2023) - [i12]Thuy Bui, Thomas Lidbetter, Kyle Y. Lin:
Optimal Pure Strategies for a Discrete Search Game. CoRR abs/2306.10908 (2023) - 2022
- [j21]Felix Happach
A General Framework for Approximating Min Sum Ordering Problems. INFORMS J. Comput. 34(3): 1437-1452 (2022) - [j20]Steve Alpern
Continuous Patrolling Games. Oper. Res. 70(6): 3076-3089 (2022) - [c5]Lisa Hellerstein, Thomas Lidbetter, R. Teal Witter:
A Local Search Algorithm for the Min-Sum Submodular Cover Problem. ISAAC 2022: 3:1-3:13 - [c4]Felix Happach, Lisa Hellerstein, Thomas Lidbetter:
A general framework for approximating min sum ordering problems. ISAIM 2022 - [i11]Thomas Lidbetter, Yifan Xie:
The Search and Rescue Game on a Cycle. CoRR abs/2208.00482 (2022) - [i10]Lisa Hellerstein, Thomas Lidbetter, R. Teal Witter:
A Local Search Algorithm for the Min-Sum Submodular Cover Problem. CoRR abs/2209.03054 (2022) - [i9]Thomas Lidbetter, Thuy Bui:
An Optimal Patrolling Strategy for Tree Networks. CoRR abs/2210.15045 (2022) - 2021
- [i8]Lisa Hellerstein, Thomas Lidbetter:
A Polyhedral Approach to Some Max-min Problems. CoRR abs/2104.10236 (2021) - 2020
- [j19]Steve Alpern
Search and Delivery Man Problems: When are depth-first paths optimal? Eur. J. Oper. Res. 285(3): 965-976 (2020) - [j18]Thomas Lidbetter
Search and rescue in the face of uncertain threats. Eur. J. Oper. Res. 285(3): 1153-1160 (2020) - [j17]Spyros Angelopoulos, Thomas Lidbetter:
Competitive search in a network. Eur. J. Oper. Res. 286(2): 781-790 (2020) - [j16]Alessandro Agnetis, Thomas Lidbetter:
The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines. Oper. Res. Lett. 48(4): 405-409 (2020) - [j15]Thomas Lidbetter
A search game on a hypergraph with booby traps. Theor. Comput. Sci. 821: 57-70 (2020) - [i7]Felix Happach, Lisa Hellerstein, Thomas Lidbetter:
A General Framework for Approximating Min Sum Ordering Problems. CoRR abs/2004.05954 (2020) - [i6]Steve Alpern, Thomas Lidbetter, Katerina Papadaki:
Continuous Patrolling Games. CoRR abs/2008.07369 (2020)
2010 – 2019
- 2019
- [j14]Steve Alpern, Thomas Lidbetter
Approximate solutions for expanding search games on general networks. Ann. Oper. Res. 275(2): 259-279 (2019) - [j13]Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The expanding search ratio of a graph. Discret. Appl. Math. 260: 51-65 (2019) - [j12]Steve Alpern, Thomas Lidbetter
Optimizing periodic patrols against short attacks on the line and other networks. Eur. J. Oper. Res. 273(3): 1065-1073 (2019) - [j11]Thomas Lidbetter
Searching for multiple objects in multiple locations. Eur. J. Oper. Res. 278(2): 709-720 (2019) - [j10]Lisa Hellerstein
Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games. Oper. Res. 67(3): 731-743 (2019) - [j9]Robbert Fokkink, Thomas Lidbetter
On Submodular Search and Machine Scheduling. Math. Oper. Res. 44(4): 1431-1449 (2019) - [j8]Anthony Bonato, Thomas Lidbetter:
Bounds on the burning numbers of spiders and path-forests. Theor. Comput. Sci. 794: 12-19 (2019) - [i5]Thomas Lidbetter:
Search and Rescue in the Face of Uncertain Threats. CoRR abs/1902.05432 (2019) - [i4]Spyros Angelopoulos, Thomas Lidbetter:
Competitive Search in a Network. CoRR abs/1908.02132 (2019) - 2017
- [j7]Thomas Lidbetter:
On the approximation ratio of the Random Chinese Postman Tour for network search. Eur. J. Oper. Res. 263(3): 782-788 (2017) - [i3]Lisa Hellerstein, Thomas Lidbetter:
An Algorithmic Approach to Search Games: Finding Solutions Using Best Response Oracles. CoRR abs/1704.02657 (2017) - 2016
- [j6]Katerina Papadaki, Steve Alpern, Thomas Lidbetter, Alec Morton
Patrolling a Border. Oper. Res. 64(6): 1256-1269 (2016) - [c3]Steve Alpern, Thomas Lidbetter, Alec Morton, Katerina Papadaki:
Patrolling a Pipeline. GameSec 2016: 129-138 - [c2]Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The Expanding Search Ratio of a Graph. STACS 2016: 9:1-9:14 - [i2]Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The expanding search ratio of a graph. CoRR abs/1602.06258 (2016) - [i1]Steve Alpern, Thomas Lidbetter:
Constant Factor Approximate Solutions for Expanding Search on General Networks. CoRR abs/1608.05390 (2016) - 2015
- [j5]Steve Alpern, Thomas Lidbetter:
Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object. Oper. Res. 63(1): 122-133 (2015) - [j4]Thomas Lidbetter:
A Caching Game with Infinitely Divisible Hidden Material. SIAM J. Control. Optim. 53(5): 3040-3056 (2015) - 2014
- [j3]Steve Alpern, Thomas Lidbetter:
Searching a Variable Speed Network. Math. Oper. Res. 39(3): 697-711 (2014) - 2013
- [j2]Steve Alpern, Thomas Lidbetter:
Mining Coal or Finding Terrorists: The Expanding Search Paradigm. Oper. Res. 61(2): 265-279 (2013) - [j1]Thomas Lidbetter:
Search Games with Multiple Hidden Objects. SIAM J. Control. Optim. 51(4): 3056-3074 (2013) - 2010
- [c1]Steve Alpern, Robbert Fokkink, Joram op den Kelder, Tom Lidbetter:
Disperse or Unite? A Mathematical Model of Coordinated Attack. GameSec 2010: 220-233
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: