| Publication | Date of Publication | Type |
|---|
A local search algorithm for the min-sum submodular cover problem
| 2024-09-11 | Paper |
Optimal pure strategies for a discrete search game
European Journal of Operational Research | 2024-06-14 | Paper |
Improved bound for the Gerver-Ramsey collinearity problem
Discrete Mathematics | 2023-10-30 | Paper |
Optimal patrolling strategies for trees and complete networks
European Journal of Operational Research | 2023-09-15 | Paper |
The search and rescue game on a cycle
Theoretical Computer Science | 2023-06-21 | Paper |
Computational fun with sturdy and flimsy numbers
| 2023-02-07 | Paper |
Continuous Patrolling Games
Operations Research | 2023-01-10 | Paper |
A game theoretic approach to a problem in polymatroid maximization
European Journal of Operational Research | 2022-11-17 | Paper |
Computational aspects of sturdy and flimsy numbers
Theoretical Computer Science | 2022-08-10 | Paper |
A General Framework for Approximating Min Sum Ordering Problems
INFORMS Journal on Computing | 2022-07-01 | Paper |
A Game Theoretic Approach to a Problem in Polymatroid Maximization
| 2021-04-20 | Paper |
Additive Number Theory via Approximation by Regular Languages
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines
Operations Research Letters | 2021-04-07 | Paper |
Solving zero-sum games using best-response oracles with applications to search games
Operations Research | 2020-10-20 | Paper |
Search and rescue in the face of uncertain threats
European Journal of Operational Research | 2020-05-27 | Paper |
Competitive search in a network
European Journal of Operational Research | 2020-05-27 | Paper |
Search and delivery man problems: when are depth-first paths optimal?
European Journal of Operational Research | 2020-05-27 | Paper |
On Submodular Search and Machine Scheduling
Mathematics of Operations Research | 2020-04-30 | Paper |
A search game on a hypergraph with booby traps
Theoretical Computer Science | 2020-04-22 | Paper |
Computational Aspects of Sturdy and Flimsy Numbers
| 2020-02-07 | Paper |
Bounds on the burning numbers of spiders and path-forests
Theoretical Computer Science | 2019-10-16 | Paper |
Approximate solutions for expanding search games on general networks
Annals of Operations Research | 2019-10-15 | Paper |
Searching for multiple objects in multiple locations
European Journal of Operational Research | 2019-06-26 | Paper |
The expanding search ratio of a graph
Discrete Applied Mathematics | 2019-05-03 | Paper |
Optimizing periodic patrols against short attacks on the line and other networks
European Journal of Operational Research | 2018-12-06 | Paper |
Counting subwords and regular languages
| 2018-11-22 | Paper |
Additive number theory via approximation by regular languages
| 2018-11-22 | Paper |
On the approximation ratio of the random Chinese postman tour for network search
European Journal of Operational Research | 2018-02-06 | Paper |
The expanding search ratio of a graph
| 2018-01-24 | Paper |
Periodic Patrols on the Line and Other Networks
| 2017-05-29 | Paper |
Search games for an immobile hider
Search Theory | 2017-02-20 | Paper |
Patrolling a border
Operations Research | 2017-01-26 | Paper |
Patrolling a pipeline
Lecture Notes in Computer Science | 2016-12-21 | Paper |
The solution to an open problem for a caching game
Naval Research Logistics | 2016-05-23 | Paper |
Optimal trade-off between speed and acuity when searching for a small object
Operations Research | 2015-10-22 | Paper |
A Caching Game with Infinitely Divisible Hidden Material
SIAM Journal on Control and Optimization | 2015-10-05 | Paper |
Searching a variable speed network
Mathematics of Operations Research | 2015-03-31 | Paper |
Search games with multiple hidden objects
SIAM Journal on Control and Optimization | 2013-11-15 | Paper |
Mining coal or finding terrorists: the expanding search paradigm
Operations Research | 2013-07-02 | Paper |
