Journals

  • 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 Applications38 (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 Systems40 (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

Updated: 25-Nov-2011                                                                               email: emarkou@ucg.gr