• 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 ...
    • 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 ...