• Different speeds suffice for rendezvous of two agents on arbitrary graphs 

      Kranakis E., Krizanc D., Markou E., Pagourtzis A., Ramírez F. (2017)
      We consider the rendezvous problem for two robots on an arbitrary connected graph with n vertices and all its edges of length one. Two robots are initially located on two different vertices of the graph and can traverse ...
    • Mobile agents rendezvous in spite of a malicious agent 

      Das S., Luccio F.L., Markou E. (2015)
      We examine the problem of rendezvous, i.e., having multiple mobile agents gather in a single node of the network. Unlike previous studies, we need to achieve rendezvous in presence of a very powerful adversary, a malicious ...