Euripides Markou

According to our database1, Euripides Markou authored at least 36 papers between 2003 and 2026.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
On the Broadcast problem for mobile agents in dynamic networks.
Discret. Appl. Math., 2026

2025
Finite Pinwheel Scheduling: the k-Visits Problem.
CoRR, July, 2025

2020
Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents.
Proceedings of the Structural Information and Communication Complexity, 2020

Broadcasting with Mobile Agents in Dynamic Networks.
Proceedings of the 24th International Conference on Principles of Distributed Systems, 2020

2019
Dangerous Graphs.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Gathering of robots in a ring with mobile faults.
Theor. Comput. Sci., 2019

Gathering of Robots in a Grid with Mobile Faults.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

2018
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017
Exclusive graph searching vs. pathwidth.
Inf. Comput., 2017

Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017


2016
Gathering of Robots in a Ring with Mobile Faults.
Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

2015
Mobile Agents Rendezvous in Spite of a Malicious Agent.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
Mobile Agents Rendezvous in spite of a Malicious Agent.
CoRR, 2014

Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host.
Proceedings of the Structural Information and Communication Complexity, 2014

2013
Tight bounds for black hole search with scattered agents in synchronous rings.
Theor. Comput. Sci., 2013

2012
Identifying Hostile Nodes in Networks Using Mobile Agents.
Bull. EATCS, 2012

Online Graph Exploration with Advice.
Proceedings of the Structural Information and Communication Complexity, 2012

Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011
Deterministic symmetric rendezvous with tokens in a synchronous torus.
Discret. Appl. Math., 2011

Black Hole Search with Finite Automata Scattered in a Synchronous Torus.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Tight Bounds for Scattered Black Hole Search in a Ring.
Proceedings of the Structural Information and Communication Complexity, 2011

2010
The Mobile Agent Rendezvous Problem in the Ring
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-01999-9, 2010

2008
Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Hardness and approximation results for Black Hole Search in arbitrary networks.
Theor. Comput. Sci., 2007

Efficient Exploration of Faulty Trees.
Theory Comput. Syst., 2007

Searching for a Black Hole in Synchronous Tree Networks.
Comb. Probab. Comput., 2007

2006
Complexity of Searching for a Black Hole.
Fundam. Informaticae, 2006

Mobile Agent Rendezvous in a Synchronous Torus.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Gathering Asynchronous Oblivious Mobile Robots in a Ring.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Distributed Routing in Tree Networks with Few Landmarks.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005
Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs.
Proceedings of the Structural Information and Communication Complexity, 2005

How to Place Efficiently Guards and Paintings in an Art Gallery.
Proceedings of the Advances in Informatics, 2005

Approximation Bounds for Black Hole Search Problems.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

2004
Searching for a Black Hole in Tree Networks.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

2003
Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003


  Loading...