Díaz Cort, Josep; Kaminski, Marcin; Thilikos Touloupas, Dimitrios (2010-02)
Restricted access - publisher's policyWe give a linear-time algorithm checking whether a graph is a subgraph of the (2×k)-grid for some value of k. Our algorithm is based on a detailed characterization of the structure of such graphs.
Barrière Figueroa, Eulalia; Flocchini, Paola; Fomin, Fedor V.; Fraigniaud, Pierre; Nisse, Nicolas; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2010-09-26)
External research report
Open AccessIn graph searching game the opponents are a set of searchers and a fugitive in a graph. The searchers try to capture the fugitive by applying some sequence moves that include placement, removal, or sliding of a searcher ...
Álvarez Faura, M. del Carme; Duch Brown, Amalia; Serna Iglesias, María José; Thilikos Touloupas, Dimitrios (2011)
Open AccessWe consider a general multi-agent framework in which a set of n agents are roaming a network where m valuable and sharable goods (resources, services, information ....) are hidden in m different vertices of the network. ...