• Connected graph searching 

      Barrière Figueroa, Eulalia; Flocchini, Paola; Fomin, Fedor V.; Fraigniaud, Pierre; Nisse, Nicolas; Santoro, Nicola; Thilikos Touloupas, Dimitrios (2010-09-26)
      Report de recerca
      Accés obert
      In 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 ...
    • The price of connectedness in expansions 

      Fomin, Fedor V.; Fraigniaud, Pierre; Thilikos Touloupas, Dimitrios (2004-05)
      Report de recerca
      Accés obert
      Expansion is the way of generalizing different graph layout and searching problems. We initiate the study of connected expansion which naturally arises in a number of applications. Our main tool for this investigation ...