2 papers
cs.DM2022
The mixed search game against an agile and visible fugitive is monotone
Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos
We consider the mixed search game against an agile and visible fugitive. This is the variant of the classic fugitive search game on graphs where searchers may be placed to (or remo…
cs.DS2020
A polynomial time algorithm to compute the connected tree-width of a series-parallel graph
Guillaume Mescoff, Christophe Paul, Dimitrios Thilikos
It is well known that the treewidth of a graph corresponds to the node search number where a team of cops is pursuing a robber that is lazy, visible and has the ability to move…