| Publication | Date of Publication | Type |
|---|
| On convergence and threshold properties of discrete Lotka-Volterra population protocols | 2022-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092347 | 2022-07-21 | Paper |
| Hardness of exact distance queries in sparse graphs through hub labeling | 2021-01-20 | Paper |
| Approximation strategies for generalized binary search in weighted trees | 2020-05-27 | Paper |
| Brief Announcement | 2019-09-19 | Paper |
| Does adding more agents make a difference? A case study of cover time for the rotor-router | 2019-08-30 | Paper |
| Universal protocols for information dissemination using emergent signals | 2019-08-22 | Paper |
| Faster walks in graphs: a \(\tilde O(n^2)\) time-space trade-off for undirected \(s\)-\(t\) connectivity | 2019-05-15 | Paper |
| Improved analysis of deterministic load-balancing schemes | 2019-03-28 | Paper |
| Patrolling trees with mobile robots | 2018-12-07 | Paper |
| Limit behavior of the multi-agent rotor-router system | 2018-08-24 | Paper |
| Sublinear-space distance labeling using hubs | 2018-08-16 | Paper |
| Beyond highway dimension: small distance labels using tree skeletons | 2018-07-16 | Paper |
| Multiple random walks on paths and grids | 2018-04-19 | Paper |
| A point set connection problem for autonomous mobile robots in a grid | 2018-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608065 | 2018-03-15 | Paper |
| Robust detection in leak-prone population protocols | 2018-02-02 | Paper |
| When patrolmen become corrupted: monitoring a graph using faulty mobile robots | 2017-11-09 | Paper |
| Robustness of the rotor-router mechanism | 2017-10-09 | Paper |
| The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks | 2017-10-06 | Paper |
| Brief announcement: Sublinear-space distance labeling using hubs | 2017-09-29 | Paper |
| Collision-free network exploration | 2017-05-26 | Paper |
| Bounds on the cover time of parallel rotor walks | 2017-03-03 | Paper |
| Setting ports in an anonymous network: how to reduce the level of symmetry? | 2016-12-01 | Paper |
| Bounds on the cover time of parallel rotor walks | 2016-04-18 | Paper |
| Improved analysis of deterministic load-balancing schemes | 2016-03-23 | Paper |
| When patrolmen become corrupted: monitoring a graph using faulty mobile robots | 2016-01-11 | Paper |
| Rendezvous of heterogeneous mobile agents in edge-weighted networks | 2015-12-11 | Paper |
| On convergence and threshold properties of discrete Lotka-Volterra population protocols | 2015-10-27 | Paper |
| Position discovery for a system of bouncing robots | 2015-09-28 | Paper |
| Allowing each node to communicate only once in a distributed system: shared whiteboard models | 2015-07-22 | Paper |
| Fast collaborative graph exploration | 2015-06-09 | Paper |
| Distinguishing views in symmetric networks: a tight lower bound | 2015-04-29 | Paper |
| Locating a target with an agent guided by unreliable local advice, how to beat the random walk when you have a clock? | 2015-03-02 | Paper |
| The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks | 2015-03-02 | Paper |
| How to meet when you forget: log-space rendezvous in arbitrary graphs | 2015-03-02 | Paper |
| Rendezvous of heterogeneous mobile agents in edge-weighted networks | 2014-08-07 | Paper |
| Rendezvous of distance-aware mobile agents in unknown graphs | 2014-08-07 | Paper |
| Time versus space trade-offs for rendezvous in trees | 2014-07-11 | Paper |
| Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router | 2014-07-01 | Paper |
| Collision-free network exploration | 2014-03-31 | Paper |
| Maximum matching in multi-interface networks | 2014-01-16 | Paper |
| Fast collaborative graph exploration | 2013-08-07 | Paper |
| Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains | 2013-04-15 | Paper |
| Position discovery for a system of bouncing robots | 2013-03-13 | Paper |
| How to meet when you forget: log-space rendezvous in arbitrary graphs | 2013-02-04 | Paper |
| Maximum matching in multi-interface networks | 2012-11-02 | Paper |
| \(k\)-chordal graphs: from cops and robber to compact routing via treewidth | 2012-11-01 | Paper |
| On the size of identifying codes in triangle-free graphs | 2012-06-18 | Paper |
| Graph decomposition for memoryless periodic exploration | 2012-04-26 | Paper |
| Derandomizing random walks in undirected graphs using locally fair exploration strategies | 2012-02-06 | Paper |
| Synchronous rendezvous for location-aware agents | 2011-10-28 | Paper |
| Synchronous black hole search in directed graphs | 2011-10-10 | Paper |
| Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds | 2011-09-16 | Paper |
| Packing three-vertex paths in 2-connected cubic graphs. | 2011-02-02 | Paper |
| On the complexity of distributed graph coloring with local minimality constraints | 2010-11-24 | Paper |
| Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains | 2010-09-03 | Paper |
| Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring | 2010-08-11 | Paper |
| Packing three-vertex paths in a subcubic graph | 2010-07-30 | Paper |
| Approximating the maximum 2- and 3-edge-colorable subgraph problems | 2010-04-28 | Paper |
| A note on the strength and minimum color sum of bipartite graphs | 2010-04-28 | Paper |
| A note on mixed tree coloring | 2010-04-19 | Paper |
| An improved strategy for exploring a grid polygon | 2010-02-24 | Paper |
| An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs | 2010-01-29 | Paper |
| Mixed graph edge coloring | 2009-12-09 | Paper |
| Euler Tour Lock-In Problem in the Rotor-Router Model | 2009-11-19 | Paper |
| What Can Be Observed Locally? | 2009-11-19 | Paper |
| Graph Decomposition for Improving Memoryless Periodic Exploration | 2009-10-16 | Paper |
| Cost minimization in wireless networks with a bounded and unbounded number of interfaces | 2009-07-28 | Paper |
| Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies | 2009-07-14 | Paper |
| The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree | 2009-06-23 | Paper |
| Universal augmentation schemes for network navigability | 2009-05-28 | Paper |
| Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph | 2009-04-29 | Paper |
| Cost Minimisation in Multi-interface Networks | 2009-03-17 | Paper |
| Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs | 2009-03-12 | Paper |
| Forwarding and optical indices of a graph | 2009-03-04 | Paper |
| An Efficient Algorithm for Mobile Guarded Guards in Simple Grids | 2009-01-27 | Paper |
| Fault Tolerant Guarding of Grids | 2009-01-27 | Paper |
| On the Complexity of Distributed Greedy Coloring | 2008-09-02 | Paper |
| The maximum edge-disjoint paths problem in complete graphs | 2008-06-24 | Paper |
| Packing \([1, \Delta ]\)-factors in graphs of small degree | 2007-11-14 | Paper |
| Parallel Processing and Applied Mathematics | 2007-05-02 | Paper |
| Parallel Processing and Applied Mathematics | 2007-05-02 | Paper |
| Cooperative mobile guards in grids | 2007-04-18 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
