| Publication | Date of Publication | Type |
|---|
Cops \& Robber on periodic temporal graphs
Discrete Applied Mathematics | 2025-12-11 | Paper |
Cops \& robber on periodic temporal graphs: characterization and improved bounds
Structural Information and Communication Complexity | 2024-01-11 | Paper |
| Copnumbers of periodic graphs | 2023-10-20 | Paper |
Compact Routing In Chordal Grids And Other Networks
INFOR: Information Systems and Operational Research | 2023-04-24 | Paper |
Oblivious Permutations on the Plane
(available as arXiv preprint) | 2023-02-07 | Paper |
| Tight bounds on distributed exploration of temporal graphs | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650875 (Why is no real title available?) | 2023-02-07 | Paper |
| Meeting in a polygon by anonymous oblivious robots | 2023-02-03 | Paper |
| Gathering and Election by Mobile Robots in a Continuous Cycle. | 2023-02-03 | Paper |
Fault-Induced Dynamics of Oblivious Robots on a Line
Lecture Notes in Computer Science | 2022-11-04 | Paper |
| TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications | 2022-07-21 | Paper |
TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
Distributed Computing | 2022-04-01 | Paper |
TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
Distributed Computing | 2022-04-01 | Paper |
On synchronization and orientation in distributed barrier coverage with relocatable sensors
Theoretical Computer Science | 2021-09-27 | Paper |
Exploration of dynamic networks: tight bounds on the number of agents
Journal of Computer and System Sciences | 2021-09-17 | Paper |
| scientific article; zbMATH DE number 7339755 (Why is no real title available?) | 2021-04-27 | Paper |
Fault-tolerant simulation of population protocols
Distributed Computing | 2021-01-22 | Paper |
Fault-tolerant simulation of population protocols
Distributed Computing | 2021-01-22 | Paper |
Meeting in a polygon by anonymous oblivious robots
Distributed Computing | 2020-10-16 | Paper |
Meeting in a polygon by anonymous oblivious robots
Distributed Computing | 2020-10-16 | Paper |
Shape formation by programmable particles
(available as arXiv preprint) | 2020-07-30 | Paper |
Shape formation by programmable particles
Distributed Computing | 2020-04-21 | Paper |
Shape formation by programmable particles
Distributed Computing | 2020-04-21 | Paper |
Distributed exploration of dynamic rings
Distributed Computing | 2020-04-21 | Paper |
Fault-induced dynamics of oblivious robots on a line
Information and Computation | 2020-03-12 | Paper |
| On sense of direction and mobile agents | 2020-03-03 | Paper |
Gathering in dynamic rings
Theoretical Computer Science | 2020-02-13 | Paper |
Population protocols with faulty interactions: the impact of a leader
Theoretical Computer Science | 2018-12-04 | Paper |
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
Automata, Languages and Programming | 2018-07-04 | Paper |
Gathering in dynamic rings
Structural Information and Communication Complexity | 2018-04-12 | Paper |
Distributed computing by mobile robots: uniform circle formation
Distributed Computing | 2017-11-29 | Paper |
Population protocols with faulty interactions: the impact of a leader
Lecture Notes in Computer Science | 2017-07-21 | Paper |
| A rupestrian algorithm | 2017-07-17 | Paper |
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures
IEEE Transactions on Computers | 2017-07-12 | Paper |
Measuring Temporal Lags in Delay-Tolerant Networks
IEEE Transactions on Computers | 2017-06-20 | Paper |
Mediated population protocols: leader election and applications
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Mutual visibility by luminous robots without collisions
Information and Computation | 2017-05-12 | Paper |
Universal systems of oblivious mobile robots
Structural Information and Communication Complexity | 2016-12-01 | Paper |
On the relationship between Boolean and fuzzy cellular automata
Electronic Notes in Theoretical Computer Science | 2016-06-09 | Paper |
On the asymptotic behavior of fuzzy cellular automata
Electronic Notes in Theoretical Computer Science | 2016-06-09 | Paper |
Minimal sense of direction in regular networks
Information Processing Letters | 2016-06-01 | Paper |
On the impact of sense of direction on message complexity
Information Processing Letters | 2016-05-26 | Paper |
Solving the parity problem in one-dimensional cellular automata
Natural Computing | 2016-04-21 | Paper |
Rendezvous with constant memory
Theoretical Computer Science | 2016-02-26 | Paper |
Network decontamination under \(m\)-immunity
Discrete Applied Mathematics | 2016-02-04 | Paper |
Exploring an unknown dangerous graph with a constant number of tokens
Theoretical Computer Science | 2015-12-10 | Paper |
Autonomous mobile robots with lights
Theoretical Computer Science | 2015-12-08 | Paper |
Shortest, fastest, and foremost broadcast in dynamic networks
International Journal of Foundations of Computer Science | 2015-09-29 | Paper |
Backward consistency and sense of direction in advanced distributed systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing | 2015-09-11 | Paper |
Forming sequences of geometric patterns with oblivious mobile robots
Distributed Computing | 2015-07-08 | Paper |
On the expressivity of time-varying graphs
Theoretical Computer Science | 2015-06-10 | Paper |
TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
On the computational power of oblivious robots
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Brief announcement: Waiting in dynamic networks
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Distributed barrier coverage with relocatable sensors
Structural Information and Communication Complexity | 2014-08-07 | Paper |
Searching for a black hole in arbitrary networks, optimal mobile agent protocols
Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
Rendezvous of two robots with constant memory
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Expressivity of Time-Varying Graphs
Fundamentals of Computation Theory | 2013-08-16 | Paper |
Computing without communicating: ring exploration by asynchronous oblivious robots
Algorithmica | 2013-08-05 | Paper |
Searching for a black hole in arbitrary networks: optimal mobile agents protocols
Distributed Computing | 2013-06-20 | Paper |
Optimal network decontamination with threshold immunity
Lecture Notes in Computer Science | 2013-06-07 | Paper |
How many oblivious robots can explore a line
Information Processing Letters | 2013-04-04 | Paper |
Exploring an unknown dangerous graph using tokens
Theoretical Computer Science | 2013-03-04 | Paper |
On the exploration of time-varying networks
Theoretical Computer Science | 2013-02-19 | Paper |
Searching for black holes in subways
Theory of Computing Systems | 2012-12-06 | Paper |
Distributed computing by mobile robots: gathering
SIAM Journal on Computing | 2012-11-29 | Paper |
Connected graph searching
Information and Computation | 2012-11-27 | Paper |
Time optimal algorithms for black hole search in rings
Discrete Mathematics, Algorithms and Applications | 2012-08-27 | Paper |
Computing all the best swap edges distributively
Journal of Parallel and Distributed Computing | 2012-07-26 | Paper |
Ping pong in dangerous graphs: optimal black hole search with pebbles
Algorithmica | 2012-04-26 | Paper |
| On the asymptotic behaviour of circular fuzzy cellular automata | 2011-05-18 | Paper |
Uniform scattering of autonomous mobile robots in a grid
International Journal of Foundations of Computer Science | 2011-05-10 | Paper |
Computing by mobile robotic sensors
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
On the relationship between fuzzy and Boolean cellular automata
Theoretical Computer Science | 2011-02-21 | Paper |
Time optimal algorithms for black hole search in rings
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Network exploration by silent and oblivious robots
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Deterministic computations in time-varying graphs: broadcasting under unstructured mobility
IFIP Advances in Information and Communication Technology | 2010-10-27 | Paper |
Network decontamination with temporal immunity by cellular automata
Lecture Notes in Computer Science | 2010-10-04 | Paper |
Remembering without memory: tree exploration by asynchronous oblivious robots
Theoretical Computer Science | 2010-04-06 | Paper |
Exploration of periodically varying graphs
Algorithms and Computation | 2009-12-17 | Paper |
Decontamination of hypercubes by mobile agents
Networks | 2009-10-21 | Paper |
Fault-tolerant sequential scan
Theory of Computing Systems | 2009-09-18 | Paper |
| Contamination and decontamination in majority-based systems | 2009-06-30 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
| Radial view of continuous cellular automata | 2009-02-17 | Paper |
| Radial view of continuous cellular automata | 2009-02-17 | Paper |
Tree Decontamination with Temporary Immunity
Algorithms and Computation | 2009-01-29 | Paper |
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
Theoretical Computer Science | 2008-11-18 | Paper |
Self-deployment of mobile sensors on a ring
Theoretical Computer Science | 2008-08-14 | Paper |
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Effective Elections for Anonymous Mobile Agents
Algorithms and Computation | 2008-04-24 | Paper |
Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Map construction of unknown graphs by multiple agents
Theoretical Computer Science | 2007-10-18 | Paper |
Mobile search for a black hole in an anonymous ring
Algorithmica | 2007-07-19 | Paper |
OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
International Journal of Foundations of Computer Science | 2007-06-05 | Paper |
DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
International Journal of Foundations of Computer Science | 2007-06-05 | Paper |
Rendezvous and election of mobile agents: Impact of sense of direction
Theory of Computing Systems | 2007-02-14 | 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 |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Principles of Distributed Systems
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Gathering of asynchronous robots with limited visibility
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 2163017 (Why is no real title available?) | 2005-04-29 | Paper |
On time versus size for monotone dynamic monopolies in regular topologies
Journal of Discrete Algorithms | 2004-08-06 | Paper |
Dynamic monopolies in tori.
Discrete Applied Mathematics | 2004-03-14 | Paper |
Sorting and election in anonymous asynchronous rings.
Journal of Parallel and Distributed Computing | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2038783 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 2006651 (Why is no real title available?) | 2003-11-23 | Paper |
Routing in series parallel networks
Theory of Computing Systems | 2003-08-26 | Paper |
Computing on anonymous networks with sense of direction
Theoretical Computer Science | 2003-07-30 | Paper |
Backward Consistency and Sense of Direction in Advanced Distributed Systems
SIAM Journal on Computing | 2003-06-19 | Paper |
Sense of direction in distributed computing
Theoretical Computer Science | 2003-05-14 | Paper |
| Sense of direction: Definitions, properties, and classes | 2002-07-21 | Paper |
Optimal irreversible dynamos in chordal rings
Discrete Applied Mathematics | 2002-01-16 | Paper |
| scientific article; zbMATH DE number 1688369 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1629980 (Why is no real title available?) | 2001-10-23 | Paper |
Searching for chaos in cellular automata: compositional approach
Complexity International | 2001-10-21 | Paper |
Convergence and aperiodicity in fuzzy cellular automata: Revisiting rule 90
Complexity International | 2001-10-21 | Paper |
Searching for chaos in cellular automata: New tools for classification
Complexity International | 2001-10-21 | Paper |
Convergence and aperiodicity in fuzzy cellular automata: Revisiting rule 90
Physica D | 2000-11-22 | Paper |
| scientific article; zbMATH DE number 1420911 (Why is no real title available?) | 2000-03-22 | Paper |
Cellular automata in fuzzy backgrounds
Physica D | 2000-01-24 | Paper |
| scientific article; zbMATH DE number 1185591 (Why is no real title available?) | 1998-11-26 | Paper |
Symmetries and sense of direction in labeled graphs
Discrete Applied Mathematics | 1998-11-03 | Paper |
| scientific article; zbMATH DE number 1151833 (Why is no real title available?) | 1998-10-05 | Paper |
Pattern growth in elementary cellular automata
Theoretical Computer Science | 1997-02-28 | Paper |
Finding the extrema of a distributed multiset
Journal of Parallel and Distributed Computing | 1996-01-01 | Paper |
| scientific article; zbMATH DE number 718627 (Why is no real title available?) | 1995-02-02 | Paper |
