| Publication | Date of Publication | Type |
|---|
| The complexity of growing a graph | 2024-10-29 | Paper |
| Fault tolerant network constructors | 2024-04-19 | Paper |
| Pushing lines helps: efficient universal centralised transformations for programmable matter | 2024-04-05 | Paper |
| On geometric shape construction via growth operations | 2024-01-02 | Paper |
| Centralised connectivity-preserving transformations by rotation: 3 musketeers for all orthogonal convex shapes | 2023-08-04 | Paper |
| On geometric shape construction via growth operations | 2023-08-04 | Paper |
| The complexity of growing a graph | 2023-08-04 | Paper |
| Simple and fast approximate counting and leader election in populations | 2023-08-02 | Paper |
| Fault tolerant network constructors | 2023-05-19 | Paper |
| Distributed transformations of Hamiltonian shapes based on line moves | 2022-12-21 | Paper |
| Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach | 2022-10-21 | Paper |
| Beyond Rings: Gathering in 1-Interval Connected Graphs | 2022-07-08 | Paper |
| Centralised connectivity-preserving transformations for programmable matter: a minimal seed approach | 2022-06-24 | Paper |
| Distributed transformations of Hamiltonian shapes based on line moves | 2022-06-24 | Paper |
| Simple and fast approximate counting and leader election in populations | 2022-05-17 | Paper |
| Distributed computation and reconfiguration in actively dynamic networks | 2022-04-01 | Paper |
| How many cooks spoil the soup? | 2022-02-15 | Paper |
| On efficient connectivity-preserving transformations in a grid | 2021-12-01 | Paper |
| On efficient connectivity-preserving transformations in a grid | 2021-07-08 | Paper |
| An Introduction to Temporal Graphs: An Algorithmic Perspective* | 2021-03-26 | Paper |
| Distributed Computation and Reconfiguration in Actively Dynamic Networks | 2021-03-15 | Paper |
| On the Transformation Capability of Feasible Mechanisms for Programmable Matter | 2020-05-27 | Paper |
| Pushing lines helps: efficient universal centralised transformations for programmable matter | 2020-05-26 | Paper |
| On the transformation capability of feasible mechanisms for programmable matter | 2019-05-03 | Paper |
| Temporal network optimization subject to connectivity constraints | 2019-04-25 | Paper |
| Brief announcement: fast approximate counting and leader election in populations | 2019-01-30 | Paper |
| Connectivity Preserving Network Transformers | 2018-10-04 | Paper |
| Terminating distributed construction of shapes and patterns in a fair solution of automata | 2018-08-10 | Paper |
| Connectivity preserving network transformers | 2017-05-18 | Paper |
| Network Constructors: A Model for Programmable Matter | 2017-04-04 | Paper |
| How Many Cooks Spoil the Soup? | 2016-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2990267 | 2016-07-29 | Paper |
| Simple and efficient local codes for distributed stable network construction | 2016-07-05 | Paper |
| Traveling salesman problems in temporal graphs | 2016-05-18 | Paper |
| Terminating distributed construction of shapes and patterns in a fair solution of automata | 2016-03-23 | Paper |
| An Introduction to Temporal Graphs: An Algorithmic Perspective | 2016-01-27 | Paper |
| A Glimpse at Paul G. Spirakis | 2016-01-27 | Paper |
| Causality, influence, and computation in possibly disconnected synchronous dynamic networks | 2015-12-18 | Paper |
| Simple and efficient local codes for distributed stable network construction | 2015-09-03 | Paper |
| Computational models for networks of tiny artifacts: a survey | 2014-10-24 | Paper |
| Traveling Salesman Problems in Temporal Graphs | 2014-10-14 | Paper |
| Naming and Counting in Anonymous Unknown Dynamic Networks | 2014-09-30 | Paper |
| The computational power of simple protocols for self-awareness on graphs | 2014-01-13 | Paper |
| Temporal Network Optimization Subject to Connectivity Constraints | 2013-08-07 | Paper |
| Passively mobile communicating machines that use restricted space | 2011-12-07 | Paper |
| Mediated population protocols | 2011-05-10 | Paper |
| All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model | 2010-09-03 | Paper |
| Recent Advances in Population Protocols | 2009-10-16 | Paper |
| Mediated Population Protocols | 2009-07-14 | Paper |
