Περιοδικά

  • S. Das, R. Focardi, F. Luccio, E. Markou, M. Squarcina, Gathering of Robots in a Ring with Mobile Faults, Theoretical Computer Science, 764 (2019), pp. 42-60.

  • E. Markou, N. Nisse, S. Perennes, Exclusive Graph Searching vs. Pathwidth, Information and Computation, 252 (2017), pp. 243-260.

  • E. Bampas, N. Leonardos, E. Markou, A. Pagourtzis, M. Petrolia, Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host, Theoretical Computer Science, 608 (2015), pp. 231-254.

  • G. Karakostas, E. Markou, Emergency connectivity in ad-hoc networks with selfish nodes, Algorithmica, 68 (2) (2014), pp. 358-389. pdf

  • J. Chalopin, S. Das, A. Labourel, E. Markou, Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings, Theoretical Computer Science, 509 (2013), pp. 70-85. pdf

  • E. Markou, Identifying Hostile Nodes in Networks Using Mobile Agents, Bulletin of the European Association for Theoretical Computer Science, 108 (2012), pp. 93-129.

  • E. Kranakis, D. Krizanc, E. Markou, Deterministic Symmetric Rendezvous with Tokens in a Synchronous Torus, Discrete Applied Mathematics, 159 (2011), pp. 896-923. pdf

  • R. Klasing, E. Markou, A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Theoretical Computer Science, 390 (2008), pp. 27-39. pdf

  • R. Klasing, E. Markou, T. Radzik, F. Sarracco, Approximation bounds for Black Hole Search problems, Networks, 52 (4) (2008), pp. 216-226. pdf

  • C. Fragoudakis, E. Markou, S. Zachos, Maximizing the Guarded Boundary of an Art Gallery is APX-complete, Computational Geometry: Theory and Applications, 38 (3) (2007), pp. 170-180. pdf

  • J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Searching for a black hole in synchronous tree networks, Combinatorics, Probability & Computing, 16 (4) (2007), pp. 595-619. pdf

  • R. Klasing, E. Markou, T. Radzik, F. Sarracco, Hardness and approximation results for black hole search in arbitrary networks, Theoretical Computer Science, 384 (2-3) (2007), pp. 201-221. pdf

  • E. Markou, A. Pelc, Efficient exploration of faulty trees, Theory of Computing Systems, 40 (2007), pp. 225-247. pdf

  • J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Complexity of searching for a black hole, Fundamenta Informaticae, 71 (2-3) 2006, 229-242. pdf
Ενημέρωση: 12-Οκτ-2023                                                                                                                            email: e<lastname>@dib.uth.gr