• 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 ...
    • Bounds on the Spectral Radius of Nonnegative Matrices 

      Babouklis F., Adam M., Assimakis N. (2020)
      In this paper, we determine some new bounds for the spectral radius of a nonnegative matrix with respect to the upper and the lower bounds for the spectral radius given by Frobenius' bounds, by using similarity transformations. ...
    • Online graph exploration with advice 

      Dobrev, S.; Královič, R.; Markou, E. (2012)
      We study the problem of exploring an unknown undirected graph with non-negative edge weights. Starting at a distinguished initial vertex s, an agent must visit every vertex of the graph and return to s. Upon visiting a ...
    • Sharp bounds on the spectral radius of nonnegative matrices and comparison to the frobenius’ bounds 

      Adam M., Assimakis N., Babouklis F. (2020)
      In this paper, a new upper bound and a new lower bound for the spectral radius of a nοnnegative matrix are proved by using similarity transformations. These bounds depend only on the elements of the nonnegative matrix and ...