| Publication | Date of Publication | Type |
|---|
| Gathering on a circle with limited visibility by anonymous oblivious robots | 2024-12-12 | Paper |
| Pushing blocks by sweeping lines | 2024-05-16 | Paper |
| Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks | 2024-03-26 | Paper |
| Computational complexity of jumping block puzzles | 2024-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6179334 | 2023-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6179342 | 2023-12-16 | Paper |
| Gathering on a circle with limited visibility by anonymous oblivious robots | 2023-11-02 | Paper |
| Minimizing visible edges in polyhedra | 2023-10-31 | Paper |
| Token shifting on graphs | 2023-03-30 | Paper |
| Oblivious Permutations on the Plane | 2023-02-07 | Paper |
| Meeting in a polygon by anonymous oblivious robots | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5057207 | 2022-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090910 | 2022-07-21 | Paper |
| Edge guards for polyhedra in three-space | 2022-04-08 | Paper |
| TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications | 2022-04-01 | Paper |
| Cyclic shift problems on graphs | 2021-10-04 | Paper |
| Fault-tolerant simulation of population protocols | 2021-01-22 | Paper |
| Meeting in a polygon by anonymous oblivious robots | 2020-10-16 | Paper |
| Shape formation by programmable particles | 2020-07-30 | Paper |
| Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards | 2020-04-22 | Paper |
| Shape formation by programmable particles | 2020-04-21 | Paper |
| Gathering in dynamic rings | 2020-02-13 | Paper |
| Constructing Self-stabilizing Oscillators in Population Protocols | 2020-01-14 | Paper |
| Population protocols with faulty interactions: the impact of a leader | 2018-12-04 | Paper |
| Rendezvous of two robots with visible bits | 2018-10-17 | Paper |
| Gathering in dynamic rings | 2018-04-12 | Paper |
| Distributed computing by mobile robots: uniform circle formation | 2017-11-29 | Paper |
| Constructing self-stabilizing oscillators in population protocols | 2017-08-08 | Paper |
| Population protocols with faulty interactions: the impact of a leader | 2017-07-21 | Paper |
| Super Mario Bros. Is Harder/Easier than We Thought | 2017-07-17 | Paper |
| A Rupestrian Algorithm. | 2017-07-17 | Paper |
| Mediated Population Protocols: Leader Election and Applications | 2017-05-19 | Paper |
| Mutual visibility by luminous robots without collisions | 2017-05-12 | Paper |
| Algorithms for Designing Pop-Up Cards | 2017-01-30 | Paper |
| Universal Systems of Oblivious Mobile Robots | 2016-12-01 | Paper |
| Rendezvous with constant memory | 2016-02-26 | Paper |
| Getting close without touching: near-gathering for autonomous mobile robots | 2015-10-20 | Paper |
| The Shadows of a Cycle Cannot All Be Paths | 2015-07-08 | Paper |
| Simulating a die roll by flipping two coins | 2015-05-30 | Paper |
| Classic Nintendo games are (computationally) hard | 2015-05-26 | Paper |
| Lemmings is PSPACE-complete | 2015-05-26 | Paper |
| Reprint of: Face-guarding polyhedra | 2015-04-27 | Paper |
| Gaming is a hard job, but someone has to do it! | 2015-01-21 | Paper |
| Face-guarding polyhedra | 2014-06-27 | Paper |
| Rendezvous of Two Robots with Constant Memory | 2013-12-17 | Paper |
| SEARCHING POLYHEDRA BY ROTATING HALF-PLANES | 2013-06-24 | Paper |
| Minimal Arrangements of Spherical Geodesics | N/A | Paper |
