| Publication | Date of Publication | Type |
|---|
| Broadcasting with mobile agents in dynamic networks | 2026-03-31 | Paper |
Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents
Structural Information and Communication Complexity | 2022-09-01 | Paper |
| Gathering of robots in a grid with mobile faults | 2020-10-22 | Paper |
Exploring graphs with time constraints by unreliable collections of mobile robots
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Gathering of robots in a ring with mobile faults
Theoretical Computer Science | 2019-03-13 | Paper |
| Identifying hostile nodes in networks using mobile agents | 2018-09-04 | Paper |
Stathis Zachos at 70!
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Different speeds suffice for rendezvous of two agents on arbitrary graphs
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
Exclusive graph searching vs. pathwidth
Information and Computation | 2016-12-22 | Paper |
Improved periodic data retrieval in asynchronous rings with a faulty host
Theoretical Computer Science | 2015-12-11 | Paper |
Emergency connectivity in ad-hoc networks with selfish nodes
Algorithmica | 2014-12-02 | Paper |
Improved periodic data retrieval in asynchronous rings with a faulty host
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Tight bounds for black hole search with scattered agents in synchronous rings
Theoretical Computer Science | 2014-01-13 | Paper |
Online graph exploration with advice
Structural Information and Communication Complexity | 2012-09-26 | Paper |
Black hole search with finite automata scattered in a synchronous torus
Lecture Notes in Computer Science | 2011-10-28 | Paper |
Deterministic symmetric rendezvous with tokens in a synchronous torus
Discrete Applied Mathematics | 2011-06-01 | Paper |
Approximation bounds for Black Hole Search problems
Networks | 2008-12-17 | Paper |
Mobile Agent Rendezvous in a Synchronous Torus
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Gathering Asynchronous Oblivious Mobile Robots in a Ring
Algorithms and Computation | 2008-04-24 | Paper |
Distributed Routing in Tree Networks with Few Landmarks
Combinatorial and Algorithmic Aspects of Networking | 2008-04-17 | Paper |
Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science | 2008-03-05 | Paper |
Searching for a Black Hole in Synchronous Tree Networks
Combinatorics, Probability and Computing | 2008-01-18 | Paper |
Maximizing the guarded boundary of an Art Gallery is APX-complete
Computational Geometry | 2007-10-12 | Paper |
Hardness and approximation results for black hole search in arbitrary networks
Theoretical Computer Science | 2007-10-02 | Paper |
Efficient exploration of faulty trees
Theory of Computing Systems | 2007-03-12 | Paper |
| Complexity of searching for a black hole | 2006-08-03 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
| scientific article; zbMATH DE number 2011842 (Why is no real title available?) | 2003-12-02 | Paper |
