The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
We study problems of Clote and Paris, concerning the existence of end extensions of models of n-collection. We continue the study of the notion of ` -fullness', begun by Wilki...
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...