VLDB 2026 Research / reviewers in the wild / expert
John Marcoux
dblp:317/6969
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0004-8728-1489ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Firefighting with a distance-based restrictionabstractIn the classic version of the game of firefighter, on the first turn a fire breaks out on a vertex in a graph and then firefighters protect vertices. On each subsequent turn, the fire spreads to the collective unburnt neighbourhood of all the burning vertices and the firefighters again protect vertices. Once a vertex has been burnt or protected it remains that way for the rest of the game. A common objective with respect to some infinite graph is to determine how many firefighters are necessary to stop the fire from spreading after a finite number of turns, commonly referred to as containing the fire. We introduce the concept of distance-restricted firefighting where the firefighters’ movement is restricted so they can only move up to some fixed distance per turn rather than being able to move without restriction. We establish some general properties of this new game in contrast to properties of the original game, and we investigate specific cases of the distance-restricted game on the infinite square, strong, and hexagonal grids. We conjecture that two firefighters are insufficient on the infinite square grid when , and we pose some questions about how many firefighters are required in general when . Andrea C. Burgess, John Marcoux, David A. Pike |
Discret. Appl. Math. | 2 |
| 2026 | Distance-restricted firefighting on finite graphsabstractIn the classic version of the game of firefighter, on the first turn a fire breaks out on a vertex in a graph G and then b firefighters protect b vertices. On each subsequent turn, the fire spreads to the collective unburned neighbourhood of all the burning vertices and the firefighters again protect b vertices. Once a vertex has been burned or protected it remains that way for the rest of the game. In distance-restricted firefighting the firefighters’ movement is restricted so they can only move up to some fixed distance d and they may or may not be permitted to move through burning vertices. In this paper we establish the NP-completeness of the distance-restricted versions of b -Firefighter and present an integer program for computing the exact value. We also discuss some interesting properties of the Expected Damage function. Andrea C. Burgess, John Hawkin, Alexander J. M. Howse, John Marcoux, David A. Pike |
Theor. Comput. Sci. | 4 |