Tom Lidbetter

Kyle Y. Lin

Eur. J. Oper. Res., March, 2024

Search Games with Predictions.

[BibT_eX]

[DOI]

Spyros Angelopoulos

Konstantinos Panagiotou

CoRR, 2024

2023

Optimal patrolling strategies for trees and complete networks.

[BibT_eX]

[DOI]

Thuy Bui

Eur. J. Oper. Res., December, 2023

The search and rescue game on a cycle.

[BibT_eX]

[DOI]

Yifan Xie

Theor. Comput. Sci., 2023

A game theoretic approach to a problem in polymatroid maximization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2023

Searching a Tree with Signals: Routing Mobile Sensors for Targets Emitting Radiation, Chemicals or Scents.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Continuous Patrolling Games.

[BibT_eX]

[DOI]

Oper. Res., November, 2022

A General Framework for Approximating Min Sum Ordering Problems.

[BibT_eX]

[DOI]

Felix Happach

INFORMS J. Comput., 2022

An Optimal Patrolling Strategy for Tree Networks.

[BibT_eX]

[DOI]

Thuy Bui

CoRR, 2022

A Local Search Algorithm for the Min-Sum Submodular Cover Problem.

[BibT_eX]

[DOI]

R. Teal Witter

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

A Polyhedral Approach to Some Max-min Problems.

[BibT_eX]

[DOI]

CoRR, 2021

2020

A search game on a hypergraph with booby traps.

[BibT_eX]

[DOI]

Kyle Y. Lin

Theor. Comput. Sci., 2020

The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines.

[BibT_eX]

[DOI]

Alessandro Agnetis

Oper. Res. Lett., 2020

Search and rescue in the face of uncertain threats.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Competitive search in a network.

[BibT_eX]

[DOI]

Spyros Angelopoulos

Eur. J. Oper. Res., 2020

Search and Delivery Man Problems: When are depth-first paths optimal?

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Continuous Patrolling Games.

[BibT_eX]

[DOI]

Katerina Papadaki

CoRR, 2020

2019

Bounds on the burning numbers of spiders and path-forests.

[BibT_eX]

[DOI]

Anthony Bonato

Theor. Comput. Sci., 2019

On Submodular Search and Machine Scheduling.

[BibT_eX]

[DOI]

Robbert Fokkink

László A. Végh

Math. Oper. Res., 2019

Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games.

[BibT_eX]

[DOI]

Daniel Pirutinsky

Oper. Res., 2019

Searching for multiple objects in multiple locations.

[BibT_eX]

[DOI]

Kyle Y. Lin

Eur. J. Oper. Res., 2019

Optimizing periodic patrols against short attacks on the line and other networks.

[BibT_eX]

[DOI]

Katerina Papadaki

Eur. J. Oper. Res., 2019

The expanding search ratio of a graph.

[BibT_eX]

[DOI]

Spyros Angelopoulos

Christoph Dürr

Discret. Appl. Math., 2019

Approximate solutions for expanding search games on general networks.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2019

2017

On the approximation ratio of the Random Chinese Postman Tour for network search.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

An Algorithmic Approach to Search Games: Finding Solutions Using Best Response Oracles.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Patrolling a Border.

[BibT_eX]

[DOI]

Oper. Res., 2016

Constant Factor Approximate Solutions for Expanding Search on General Networks.

[BibT_eX]

[DOI]

CoRR, 2016

Patrolling a Pipeline.

[BibT_eX]

[DOI]

Proceedings of the Decision and Game Theory for Security - 7th International Conference, 2016

2015

A Caching Game with Infinitely Divisible Hidden Material.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2015

Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object.

[BibT_eX]

[DOI]

Oper. Res., 2015

2014

Searching a Variable Speed Network.

[BibT_eX]

[DOI]

Math. Oper. Res., 2014

2013

Search Games with Multiple Hidden Objects.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2013

Mining Coal or Finding Terrorists: The Expanding Search Paradigm.

[BibT_eX]

[DOI]