Searching for a Black Hole in Tree Networks. - Jurek Czyzowicz; Dariusz R. Kowalski; Euripides Markou; Andrzej Pelc (OPODIS, 2004)

How to Place Efficiently Guards and Paintings in an Art Gallery. - Christodoulos Fragoudakis; Euripides Markou; Stathis Zachos (Panhellenic Conference on Informatics, 2005)

Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. - Ralf Klasing; Euripides Markou; Tomasz Radzik; Fabiano Sarracco (SIROCCO, 2005)

Distributed Routing in Tree Networks with Few Landmarks. - Ioannis Z. Emiris; Euripides Markou; Aris Pagourtzis (CAAN, 2006)

Mobile Agent Rendezvous in a Synchronous Torus. - Evangelos Kranakis; Danny Krizanc; Euripides Markou (LATIN, 2006)

Complexity of Searching for a Black Hole. - Jurek Czyzowicz; Dariusz R. Kowalski; Euripides Markou; Andrzej Pelc (Fundam. Informaticae, 2006)

Maximizing the guarded boundary of an Art Gallery is APX-complete. - Christodoulos Fragoudakis; Euripides Markou; Stathis Zachos (Comput. Geom., 2007)

Searching for a Black Hole in Synchronous Tree Networks. - Jurek Czyzowicz; Dariusz R. Kowalski; Euripides Markou; Andrzej Pelc (Comb. Probab. Comput., 2007)

Efficient Exploration of Faulty Trees. - Euripides Markou; Andrzej Pelc (Theory Comput. Syst., 2007)

Hardness and approximation results for Black Hole Search in arbitrary networks. - Ralf Klasing; Euripides Markou; Tomasz Radzik; Fabiano Sarracco (Theor. Comput. Sci., 2007)

Approximation bounds for Black Hole Search problems. - Ralf Klasing; Euripides Markou; Tomasz Radzik; Fabiano Sarracco (Networks, 2008)

Gathering asynchronous oblivious mobile robots in a ring. - Ralf Klasing; Euripides Markou; Andrzej Pelc (Theor. Comput. Sci., 2008)

The Mobile Agent Rendezvous Problem in the Ring - Evangelos Kranakis; Danny Krizanc; Euripides Markou (Morgan & Claypool Publishers, 2010)

Tight Bounds for Scattered Black Hole Search in a Ring. - Jérémie Chalopin; Shantanu Das 001; Arnaud Labourel; Euripides Markou (SIROCCO, 2011)

Black Hole Search with Finite Automata Scattered in a Synchronous Torus. - Jérémie Chalopin; Shantanu Das 001; Arnaud Labourel; Euripides Markou (DISC, 2011)

Deterministic symmetric rendezvous with tokens in a synchronous torus. - Evangelos Kranakis; Danny Krizanc; Euripides Markou (Discret. Appl. Math., 2011)

Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata. - Euripides Markou; Michel Paquette (OPODIS, 2012)

Online Graph Exploration with Advice. - Stefan Dobrev; Rastislav Královic; Euripides Markou (SIROCCO, 2012)

Identifying Hostile Nodes in Networks Using Mobile Agents. - Euripides Markou (Bull. EATCS, 2012)

Tight bounds for black hole search with scattered agents in synchronous rings. - Jérémie Chalopin; Shantanu Das 001; Arnaud Labourel; Euripides Markou (Theor. Comput. Sci., 2013)

Emergency Connectivity in Ad-hoc Networks with Selfish Nodes. - George Karakostas; Euripides Markou (Algorithmica, 2014)

Mobile Agents Rendezvous in spite of a Malicious Agent. - Flaminia L. Luccio; Euripides Markou (CoRR, 2014)

Mobile Agents Rendezvous in Spite of a Malicious Agent. - Shantanu Das 001; Flaminia L. Luccio; Euripides Markou (ALGOSENSORS, 2015)

Improved periodic data retrieval in asynchronous rings with a faulty host. - Evangelos Bampas; Nikos Leonardos; Euripides Markou; Aris Pagourtzis; Matoula Petrolia (Theor. Comput. Sci., 2015)

Gathering of Robots in a Ring with Mobile Faults. - Shantanu Das 001; Riccardo Focardi; Flaminia L. Luccio; Euripides Markou; Davide Moro; Marco Squarcina (ICTCS, 2016)

Stathis Zachos at 70! - Eleni Bakali; Panagiotis Cheilaris; Dimitris Fotakis 001; Martin Fürer; Costas D. Koutras; Euripides Markou; Christos Nomikos; Aris Pagourtzis; Christos H. Papadimitriou; Nikolaos S. Papaspyrou; Katerina Potika (CIAC, 2017)

Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs. - Evangelos Kranakis; Danny Krizanc; Euripides Markou; Aris Pagourtzis; Felipe Ramírez (SOFSEM, 2017)

Exclusive graph searching vs. pathwidth. - Euripides Markou; Nicolas Nisse; Stéphane Pérennes (Inf. Comput., 2017)

Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots. - Jurek Czyzowicz; Maxime Godon; Evangelos Kranakis; Arnaud Labourel; Euripides Markou (SOFSEM, 2018)

Gathering of Robots in a Grid with Mobile Faults. - Shantanu Das 001; Nikos Giachoudis; Flaminia L. Luccio; Euripides Markou (SOFSEM, 2019)

Gathering of robots in a ring with mobile faults. - Shantanu Das 001; Riccardo Focardi; Flaminia L. Luccio; Euripides Markou; Marco Squarcina (Theor. Comput. Sci., 2019)

Dangerous Graphs. - Euripides Markou; Wei Shi 001 (Distributed Computing by Mobile Entities, 2019)

Broadcasting with Mobile Agents in Dynamic Networks. - Shantanu Das 001; Nikos Giachoudis; Flaminia L. Luccio; Euripides Markou (OPODIS, 2020)

Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents. - Nikos Giachoudis; Maria Kokkou; Euripides Markou (SIROCCO, 2020)

Finite Pinwheel Scheduling: the k-Visits Problem. - Sotiris Kanellopoulos; Christos Pergaminelis; Maria Kokkou; Euripides Markou; Aris Pagourtzis (CoRR, 2025)