- E. Kranakis, D. Krizanc, E. Markou, A. Pagourtzis, F. Ramirez, Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs, Proc.
*43rd International Conference on Current Trends in Theory and Practice of Computer Science, Foundations of Computer Science Track*(SOFSEM’ 2017), January 2017, Limerick, Ireland, LNCS 10139, pp. 79-90. - S. Das, R. Focardi, F. Luccio, E. Markou, D. Moro, M. Squarcina, Gathering of Robots in a Ring with Mobile Faults, Proc.
*17th Italian Conference on Theoretical Computer Science*(ICTCS' 2016), September 2016, Lecce, Italy, pp. 122-135. - S. Das, F. Luccio, E. Markou, Mobile Agents Rendezvous in spite of a Malicious Agent, Proc.
*11th International Symposium on Algorithms and Experiments for Wireless Sensor Networks*(ALGOSENSORS’ 2015), September 2015, Patras, Greece LNCS 9536, pp. 211-224. - E. Bampas, N. Leonardos, E. Markou, A. Pagourtzis, M. Petrolia, Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host, Proc.
*21st International Colloquium on Structural Information and Communication Complexity*(SIROCCO’ 2014), July 2014, Hida Takayama, Japan, LNCS 8576, pp. 355-370. pdf - E. Markou, M. Paquette, Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata, Proc. 16
*th International Conference on Principles of Distributed Systems*(OPODIS' 12), December 2012, Rome, Italy, LNCS 7702, pp. 239-253. pdf - S. Dobrev, R. Královič, E. Markou, Online Graph Exploration with Advice, Proc. 19
*th International Colloquium on Structural Information and Communication Complexity*(SIROCCO' 12), June 2012, Reykjavík, Iceland, LNCS 7355, pp. 267-278. pdf - J. Chalopin, S. Das, A. Labourel, E. Markou, Black Hole Search with Finite Automata Scattered in a Synchronous Torus, Proc.
*25th International Symposium on Distributed Computing*(DISC' 11), September 2011, Rome, Italy, LNCS 6950, pp. 432-446. pdf - J. Chalopin, S. Das, A. Labourel, E. Markou, Tight Bounds for Scattered Black Hole Search in a Ring, Proc. 1
*8th International Colloquium on Structural Information and Communication Complexity*(SIROCCO' 11), June 2011, Gdansk, Poland, LNCS 6796, pp. 186-197. pdf

- 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.
*10**th**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.
*12**th**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