• Black hole search with finite automata scattered in a synchronous torus 

      Chalopin, J.; Das, S.; Labourel, A.; Markou, E. (2011)
      We consider the problem of locating a black hole in synchronous anonymous networks using finite state agents. A black hole is a harmful node in the network that destroys any agent visiting that node without leaving any ...
    • Black virus decontamination of synchronous ring networks by initially scattered mobile agents 

      Giachoudis N., Kokkou M., Markou E. (2020)
      We study the Black Virus Decontamination problem in ring topologies for initially scattered mobile agents. In this problem a number of mobile agents operate in a network where one of its nodes u is hostile (contaminated) ...
    • Dangerous graphs 

      Markou E., Shi W. (2019)
      Anomalies and faults are inevitable in computer networks, today more than ever before. This is due to the large scale and dynamic nature of the networks used to process big data and to the ever-increasing number of ad-hoc ...
    • Tight bounds for black hole search with scattered agents in synchronous rings 

      Chalopin, J.; Das, S.; Labourel, A.; Markou, E. (2013)
      We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents. A black hole is a harmful stationary process residing in a node of the ...
    • Tight bounds for scattered black hole search in a ring 

      Chalopin, J.; Das, S.; Labourel, A.; Markou, E. (2011)
      We study the problem of locating a particularly dangerous node, the so-called black hole in a synchronous anonymous ring network with mobile agents. A black hole destroys all mobile agents visiting that node without leaving ...