Thomas Lidbetter

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Search for an Immobile Hider on a Binary Tree with Unreliable Locational Information	2024	Steve Alpern Thomas Lidbetter
+	Search Games with Predictions	2024	Spyros Angelopoulos Thomas Lidbetter Κωνσταντίνος Παναγιώτου
+ PDF Chat	Optimal pure strategies for a discrete search game	2023	Thuy Bui Thomas Lidbetter Kyle Y. Lin
+ PDF Chat	The search and rescue game on a cycle	2023	Thomas Lidbetter Yifan Xie
+ PDF Chat	Optimal patrolling strategies for trees and complete networks	2023	Thuy Bui Thomas Lidbetter
+	Searching a Tree with Signals: Routing Mobile Sensors for Targets Emitting Radiation, Chemicals or Scents	2023	Steve Alpern Thomas Lidbetter
+	Improved Bound for the Gerver-Ramsey Collinearity Problem	2023	Thomas Lidbetter
+	Optimal Pure Strategies for a Discrete Search Game	2023	Thuy Bui Thomas Lidbetter Kyle Y. Lin
+ PDF Chat	Continuous Patrolling Games	2022	Steve Alpern Thuy Bui Thomas Lidbetter Katerina Papadaki
+ PDF Chat	A game theoretic approach to a problem in polymatroid maximization	2022	Lisa Hellerstein Thomas Lidbetter
+	The Search and Rescue Game on a Cycle	2022	Thomas Lidbetter Yifan Xie
+	Optimal Patrolling Strategies for Trees and Complete Networks	2022	Thomas Lidbetter Thuy Bui
+ PDF Chat	A General Framework for Approximating Min Sum Ordering Problems	2021	Felix Happach Lisa Hellerstein Thomas Lidbetter
+	A Polyhedral Approach to Some Max-min Problems.	2021	Lisa Hellerstein Thomas Lidbetter
+	A Game Theoretic Approach to a Problem in Polymatroid Maximization	2021	Lisa Hellerstein Thomas Lidbetter
+ PDF Chat	Competitive search in a network	2020	Spyros Angelopoulos Thomas Lidbetter
+	A search game on a hypergraph with booby traps	2020	Thomas Lidbetter Kyle Y. Lin
+	Search and rescue in the face of uncertain threats	2020	Thomas Lidbetter
+ PDF Chat	Search and Delivery Man Problems: When are depth-first paths optimal?	2020	Steve Alpern Thomas Lidbetter
+	A General Framework for Approximating Min Sum Ordering Problems	2020	Felix Happach Lisa Hellerstein Thomas Lidbetter
+	Search and Delivery Man Problems: When Are Depth-First Paths Optimal?.	2019	Steve Alpern Thomas Lidbetter
+	List scheduling is 0.8531-approximate for scheduling unreliable jobs on m parallel machines	2019	Alessandro Agnetis Thomas Lidbetter
+	The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines	2019	Alessandro Agnetis Thomas Lidbetter
+ PDF Chat	On Submodular Search and Machine Scheduling	2019	Robbert Fokkink Thomas Lidbetter László A. Végh
+ PDF Chat	Searching for multiple objects in multiple locations	2019	Thomas Lidbetter Kyle Y. Lin
+ PDF Chat	Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games	2019	Lisa Hellerstein Thomas Lidbetter Daniel Pirutinsky
+ PDF Chat	The expanding search ratio of a graph	2019	Spyros Angelopoulos Christoph Dürr Thomas Lidbetter
+	Search and Rescue in the Face of Uncertain Threats	2019	Thomas Lidbetter
+	A Search Game on a Hypergraph with Booby Traps	2019	Thomas Lidbetter Kyle Y. Lin
+	Search and Delivery Man Problems: When Are Depth-First Paths Optimal?	2019	Steve Alpern Thomas Lidbetter
+	The Largest-Z-ratio-First algorithm is 0.8531-approximate for scheduling unreliable jobs on m parallel machines	2019	Alessandro Agnetis Thomas Lidbetter
+	Competitive Search in a Network	2019	Spyros Angelopoulos Thomas Lidbetter
+	Search and Rescue in the Face of Uncertain Threats	2019	Thomas Lidbetter
+	Bounds on the burning numbers of spiders and path-forests	2018	Anthony Bonato Thomas Lidbetter
+	Bounds on the burning numbers of spiders and path-forests	2017	Anthony Bonato Thomas Lidbetter
+ PDF Chat	On the approximation ratio of the Random Chinese Postman Tour for network search	2017	Thomas Lidbetter
+	Periodic Patrols on the Line and Other Networks	2017	Steve Alpern Thomas Lidbetter Katerina Papadaki
+	An Algorithmic Approach to Search Games: Finding Solutions Using Best Response Oracles.	2017	Lisa Hellerstein Thomas Lidbetter
+	Solving Zero-sum Games using Best Response Oracles with Applications to Search Games	2017	Lisa Hellerstein Thomas Lidbetter Daniel Pirutinsky
+	Searching for Multiple Objects in Multiple Locations	2017	Thomas Lidbetter Kyle Y. Lin
+	Periodic Patrols on the Line and Other Networks	2017	Steve Alpern Thomas Lidbetter Katerina Papadaki
+	Solving Zero-sum Games using Best Response Oracles with Applications to Search Games	2017	Lisa Hellerstein Thomas Lidbetter Daniel Pirutinsky
+	Bounds on the burning numbers of spiders and path-forests	2017	Anthony Bonato Thomas Lidbetter
+	A Variation on Chip-Firing: the diffusion game	2016	Christopher Duffy Thomas Lidbetter Margaret-Ellen Messinger Richard J. Nowakowski
+	On Submodular Search and Machine Scheduling.	2016	Robbert Fokkink Thomas Lidbetter László A. Végh
+ PDF Chat	The expanding search ratio of a graph	2016	Spyros Angelopoulos Christoph Dürr Thomas Lidbetter
+ PDF Chat	The solution to an open problem for a caching game	2016	Endre Csóka Thomas Lidbetter
+	Constant Factor Approximate Solutions for Expanding Search on General Networks	2016	Steve Alpern Thomas Lidbetter
+	A Variation on Chip-Firing: the diffusion game	2016	Christopher Duffy Thomas Lidbetter Margaret-Ellen Messinger Richard J. Nowakowski
+	The expanding search ratio of a graph	2016	Spyros Angelopoulos Christoph Dürr Thomas Lidbetter
+	On the Approximation Ratio of the Random Chinese Postman Tour for Network Search	2015	Thomas Lidbetter
+	The Random Chinese Postman Tour is 4/3-approximate for network search	2015	Thomas Lidbetter
+	The solution to an open problem for a caching game	2015	Endre Csóka Thomas Lidbetter
+	On the Approximation Ratio of the Random Chinese Postman Tour for Network Search	2015	Thomas Lidbetter
+	The solution to an open problem for a caching game	2015	Endre Csóka Thomas Lidbetter

Common Coauthors

Coauthor	Papers Together
Lisa Hellerstein	9
Steve Alpern	9
Spyros Angelopoulos	6
Kyle Y. Lin	6
Christoph Dürr	3
Alessandro Agnetis	3
Katerina Papadaki	3
Endre Csóka	3
Daniel Pirutinsky	3
Thuy Bui	3
Anthony Bonato	3
Thuy Bui	2
Christopher Duffy	2
László A. Végh	2
Felix Happach	2
Margaret-Ellen Messinger	2
Richard J. Nowakowski	2
Robbert Fokkink	2
Yifan Xie	2
Κωνσταντίνος Παναγιώτου	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	On Submodular Search and Machine Scheduling	2019	Robbert Fokkink Thomas Lidbetter László A. Végh	6
+ PDF Chat	The expanding search ratio of a graph	2019	Spyros Angelopoulos Christoph Dürr Thomas Lidbetter	5
+	Search and rescue in the face of uncertain threats	2020	Thomas Lidbetter	4
+ PDF Chat	The minimum latency problem	1994	Avrim Blum Prasad Chalasani Don Coppersmith Bill Pulleyblank Prabhakar Raghavan Madhu Sudan	3
+	Submodular functions, matroids, and certain polyhedra	1970	Jack Edmonds	3
+	Bounds on the burning number	2017	Stéphane Bessy Anthony Bonato Jeannette Janssen Dieter Rautenbach Elham Roshanbin	2
+ PDF Chat	Searching for multiple objects in multiple locations	2019	Thomas Lidbetter Kyle Y. Lin	2
+ PDF Chat	Burning Graphs: A Probabilistic Perspective	2017	Dieter Mitsche Paweł Prałat Elham Roshanbin	2
+	An Upper Bound on Burning Number of Graphs	2016	Max Land Linyuan Lü	2
+ PDF Chat	On the approximation ratio of the Random Chinese Postman Tour for network search	2017	Thomas Lidbetter	2
+ PDF Chat	Continuous patrolling and hiding games	2019	Tristan Garrec	2
+	A constant-factor approximation algorithm for the asymmetric traveling salesman problem	2018	Ola Svensson Jakub Tarnawski László A. Végh	2
+	Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption	2014	Christoph Dürr Łukasz Jeż Óscar C. Vásquez	2
+ PDF Chat	Exact and Approximation Algorithms for the Expanding Search Problem	2021	Ben Hermans Roel Leus Jannik Matuschke	2
+ PDF Chat	On Ruckle's Conjecture on Accumulation Games	2010	Steve Alpern Robbert Fokkink Ken Kikuta	2
+ PDF Chat	Accumulation games on graphs	2014	Steve Alpern Robbert Fokkink	2
+	Optimal Constructions of Hybrid Algorithms	1998	Ming‐Yang Kao Yuan Ma Michael Sipser Yiqun Lisa Yin	2
+	Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector	1980	Satoru Fujishige	2
+	Online searching with turn cost	2006	Erik D. Demaine Sándor P. Fekete Gal Shmuel	2
+ PDF Chat	The local–global conjecture for scheduling with non-linear cost	2016	Nikhil Bansal Christoph Dürr Nguyễn Kim Thắng Óscar C. Vásquez	2
+ PDF Chat	A Proof of the Kikuta–Ruckle Conjecture on Cyclic Caching of Resources	2011	Steve Alpern Robbert Fokkink Christos Pelekis	2
+	The boundaries of submodular functions	1992	N. I. Pisaruk	2
+	On Submodular Search and Machine Scheduling.	2016	Robbert Fokkink Thomas Lidbetter László A. Végh	1
+ PDF Chat	Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games	2019	Lisa Hellerstein Thomas Lidbetter Daniel Pirutinsky	1
+	The stochastic score classification problem	2018	Dimitrios Gkenosis Nathaniel Grammel Lisa Hellerstein Devorah Kletenik	1
+ PDF Chat	Dual Techniques for Scheduling on a Machine with Varying Speed	2018	Nicole Megow José Verschae	1
+ PDF Chat	Randomized metarounding	2002	Robert D. Carr Santosh Vempala	1
+	Stay Ahead of Poachers: Illegal Wildlife Poaching Prediction and Patrol Planning Under Uncertainty with Field Test Evaluations.	2019	Shahrzad Gholami Lily Xu Sara Mc Carthy Bistra Dilkina Andrew J. Plumptre Milind Tambe Rohit Singh Mustapha Nsubaga Joshua Mabonga Margaret Driciru	1
+	Optimal Patrol of a Perimeter	2019	Kyle Y. Lin	1
+	Limits of some combinatorial problems	2015	Endre Csóka	1
+	An Introduction to the Discharging Method via Graph Coloring	2013	Daniel W. Cranston Douglas B. West	1
+	The Uniformed Patroller Game	2019	Steve Alpern Paul Chleboun Stamatios Katsikas Kyle Y. Lin	1
+	Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover	2020	Felix Happach Andreas S. Schulz	1
+ PDF Chat	Continuous Patrolling Games	2022	Steve Alpern Thuy Bui Thomas Lidbetter Katerina Papadaki	1
+ PDF Chat	Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover	2021	Nikhil Bansal Jatin Batra Majid Farhadi Prasad Tetali	1
+ PDF Chat	A Classical Search Game in Discrete Locations	2022	Jake Clarkson Kyle Y. Lin K. D. Glazebrook	1
+	Search-and-rescue rendezvous	2021	Pierre Leone Julia Buwaya Steve Alpern	1
+ PDF Chat	Further connections between contract-scheduling and ray-searching problems	2021	Spyros Angelopoulos	1
+ PDF Chat	Proof of the 1-factorization and Hamilton Decomposition Conjectures	2016	Béla Csaba Daniela Kühn Allan Lo Deryk Osthus Andrew Treglown	1
+	Approximation Algorithms	2012	Mausam Kolobov Andrey Kolobov	1
+ PDF Chat	Dual Techniques for Scheduling on a Machine with Varying Speed	2013	Nicole Megow José Verschae	1
+	On the Period Lengths of the Parallel Chip-Firing Game	2010	Tian-Yi Jiang	1
+	A Formal Framework for Mobile Robot Patrolling in Arbitrary Environments with Adversaries	2009	Nicola Basilico Nicola Gatti Francesco Amigoni	1
+ PDF Chat	Exact Solution of the One-Dimensional Deterministic Fixed-Energy Sandpile	2006	Luca Dall’Asta	1
+	A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization	2015	Yin Tat Lee Aaron Sidford Sam Chiu-wai Wong	1
+	Shortest coverings of graphs with cycles	1983	Jean Claude Bermond Bill Jackson François Jaeger	1
+	Cleaning a network with brushes	2008	Margaret-Ellen Messinger Richard J. Nowakowski Paweł Prałat	1
+	The sphere method and the robustness of the ellipsoid algorithm	1983	S. Halfin	1
+	No polynomial bound for the period of the parallel chip firing game on graphs	1994	Marcos Kiwi René Ndoundam Maurice Tchuenté Éric Goles	1
+	Polynomial algorithms in linear programming	1980	Leonid Khachiyan	1