Publications
Books
The Mobile Agent Rendezvous Problem in the Ring. Evangelos Kranakis, Danny Krizanc, and Euripides Markou. Morgan and Claypool Publishers. Synthesis Lectures on Distributed Computing Theory. xvi + 106 pages, 2010. ISBN: 9781608451364 Paperback.
Ph.D.
E. Markou, Approximation algorithms for near - optimal covering of polygonal regions Ph.D. Thesis, National Technical University of Athens, Athens, Greece, 2003 (in greek). pdf
Journals
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
Conferences
G. Karakostas, E. Markou, Emergency connectivity in ad-hoc networks with selfish nodes, Proc. 8th Latin American Theoretical Informatics Symposium (LATIN' 08), April 2008, Rio de Janeiro, Brazil, LNCS 4957, pp. 350-361. pdf
R. Klasing, E. Markou, A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, Proc. 17th International Symposium on Algorithms and Computation (ISAAC' 06), December 2006, Kolkata, India, LNCS 4288, pp. 744-753. pdf
I. Emiris, E. Markou, A. Pagourtzis, Distributed Routing in Trees Networks with Few Landmarks, Proc. 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN' 06), July 2006, Chester, United Kingdom, LNCS 4235, pp. 45-57. pdf
I. Emiris, C. Fragoudakis, E. Markou, Maximizing the Guarded Interior of an Art Gallery, Proc. 22nd European Workshop on Computational Geometry, March 2006, Delphi, Greece, pp. 165-168. pdf
E. Kranakis, D. Krizanc, E. Markou, Mobile agent rendezvous in a synchronous torus, Proc. 7th Latin American Theoretical Informatics Symposium (LATIN' 06), March 2006, Valdivia, Chile, LNCS 3887, pp. 653-664. pdf
R. Klasing, E. Markou, T. Radzik, F. Sarracco, Approximation bounds for Black Hole Search problems, Proc. 9th International Conference on Principles of Distributed Systems (OPODIS' 05), December 2005, Pisa, Italy, LNCS 3974, pp. 261-274. pdf
C. Fragoudakis, E. Markou, S. Zachos, How to place efficiently guards and paintings in an art gallery, Proc. 10th Panhellenic Conference on Informatics (PCI' 05), November 2005, Volos, Greece, LNCS 3746, pp. 145-154. pdf
R. Klasing, E. Markou, T. Radzik, F. Sarracco, Hardness and approximation results for black - hole search in arbitrary graphs, Proc. 12th Colloquium on Structural Information and Communication Complexity (SIROCCO' 05), May 2005, Le Mont Saint-Michel, France, LNCS 3499, pp. 200-215. pdf
J. Czyzowicz, D. Kowalski, E. Markou, A. Pelc, Searching for a black hole in tree networks, Proc. 8th International Conference on Principles of Distributed Systems (OPODIS'2004), December 2004, Grenoble, France, LNCS 3544, pp. 67-80. pdf
E. Markou, A. Pelc, Efficient exploration of faulty trees, Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA' 04), July 2004, Ballina Beach Resort, New South Wales, Australia, 52-63. pdf
E. Markou, S. Zachos, C. Fragoudakis, Budgeted Coverage of a Maximum Part of a Polygonal Area, 1st Balkan Conference on Informatics (BCI' 03) Thessaloniki, Greece 2003, pp. 174-182. pdf
E. Markou, S. Zachos, C. Fragoudakis, Maximizing the Guarded Boundary of an Art Gallery is APX-complete, 5th Italian Conference on Algorithms and Complexity (CIAC' 03) Rome, Italy 2003, LNCS 2653, pp. 24 - 35. pdf
E. Markou, C. Fragoudakis, S. Zachos, Approximating Visibility Problems within a constant, 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (ARACNE' 02) Rome, Italy 2002, 91-103. pdf
C. Nomikos, S. Zachos, E. Markou, Coloring Paths In A Tree, 6th Panhellenic Conference on Informatics (PCI' 97) Athens, Greece 1997, 578 - 588 (in greek). pdf
Technical reports
G. Karakostas, E. Markou, Connectivity in ad-hoc networks with selfish nodes, Technical Report CAS-07-02-GK, July 2007, McMaster University, Hamilton, Canada.
R. Klasing, E. Markou, A. Pelc. Gathering asynchronous oblivious mobile robots in a ring, Technical Report RR-1422-07, January 2007, LaBRI, Bordeaux, France. pdf
R. Klasing, E. Markou, T. Radzik, F. Sarracco, Approximation bounds for Black Hole Search problems, Technical Report RR-1407-06, July 2006, LaBRI, Bordeaux, France. pdf
R. Klasing, E. Markou, T. Radzik, F. Sarracco, Hardness and approximation results for black hole search in arbitrary graphs, Technical Report 5659, July 2005, INRIA, Sophia-Antipolis, France. pdf
In preparation
I. Emiris, C. Fragoudakis, E. Markou, On the embeddability of almost complete graphs.
P. Fraigniaud, D. Ilcinkas, E. Markou, A. Pelc, Power of communication in cooperative exploration of graphs