| Publication | Date of Publication | Type |
|---|
| On the power of bounded asynchrony: convergence by autonomous robots with limited visibility | 2024-09-10 | Paper |
| On gathering of semi-synchronous robots in graphs | 2024-04-19 | Paper |
| Molecular pattern formation on grids in the \textsc{Moblot} model | 2024-04-04 | Paper |
| Separating Bounded and Unbounded Asynchrony for Autonomous Robots | 2024-03-26 | Paper |
| A structured methodology for designing distributed algorithms for mobile entities | 2023-12-11 | Paper |
| Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs | 2023-10-24 | Paper |
| Mutual visibility in hypercube-like graphs | 2023-08-28 | Paper |
| Optimal and heuristic algorithms for data collection by using an energy- and storage-constrained drone | 2023-08-04 | Paper |
| Molecular robots with chirality on grids | 2023-08-04 | Paper |
| Time-optimal geodesic mutual visibility of robots on grids within minimum area | 2023-08-03 | Paper |
| Arbitrary pattern formation on infinite regular tessellation graphs | 2022-12-21 | Paper |
| On the effectiveness of the genetic paradigm for polygonization | 2021-06-16 | Paper |
| Gathering robots in graphs: the central role of synchronicity | 2020-12-15 | Paper |
| On the curve complexity of 3-colored point-set embeddings | 2020-11-06 | Paper |
| Priority scheduling in the bamboo garden trimming problem | 2020-10-22 | Paper |
| Asynchronous rendezvous with different maps | 2020-03-03 | Paper |
| Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies | 2020-03-03 | Paper |
| Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements | 2020-02-06 | Paper |
| Embedded pattern formation by asynchronous robots without chirality | 2019-08-13 | Paper |
| Bamboo garden trimming problem: priority schedulings | 2019-07-08 | Paper |
| Asynchronous arbitrary pattern formation: the effects of a rigorous approach | 2019-06-20 | Paper |
| Colored Point-Set Embeddings of Acyclic Graphs | 2019-02-20 | Paper |
| Turning cliques into paths to achieve planarity | 2019-02-15 | Paper |
| Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane | 2018-12-03 | Paper |
| Approximation bounds for the minimum \(k\)-storage problem | 2018-10-17 | Paper |
| Asynchronous embedded pattern formation without orientation | 2018-08-16 | Paper |
| Gathering of robots on meeting-points: feasibility and optimal resolution algorithms | 2018-02-23 | Paper |
| Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings | 2017-10-06 | Paper |
| Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks | 2017-10-06 | Paper |
| Online knapsack of unknown capacity. How to optimize energy consumption in smartphones | 2017-09-28 | Paper |
| Recoverable Robust Timetables: An Algorithmic Approach on Trees | 2017-07-27 | Paper |
| Flow Problems in Multi-Interface Networks | 2017-06-20 | Paper |
| Gathering of oblivious robots on infinite grids with minimum traveled distance | 2017-05-12 | Paper |
| A unified approach for gathering and exclusive searching on rings under weak assumptions | 2017-03-29 | Paper |
| Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model | 2017-02-20 | Paper |
| Synchronous robots vs asynchronous lights-enhanced robots on graphs | 2016-08-05 | Paper |
| About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings | 2016-04-04 | Paper |
| Gathering of robots on anonymous grids and trees without multiplicity detection | 2015-12-10 | Paper |
| Explore and repair graphs with black holes using mobile entities | 2015-10-30 | Paper |
| MinMax-Distance Gathering on Given Meeting Points | 2015-09-21 | Paper |
| Computing on rings by oblivious robots: a unified approach for different tasks | 2015-09-02 | Paper |
| The minimum \(k\)-storage problem on directed graphs | 2015-07-24 | Paper |
| Gathering on rings under the look-compute-move model | 2015-02-23 | Paper |
| Balancing Energy Consumption for the Establishment of Multi-interface Networks | 2015-02-20 | Paper |
| Gathering six oblivious robots on anonymous symmetric rings | 2014-04-28 | Paper |
| Maximum matching in multi-interface networks | 2014-01-16 | Paper |
| Optimal Gathering of Oblivious Robots in Anonymous Graphs | 2013-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867368 | 2013-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2867370 | 2013-12-11 | Paper |
| How to Gather Asynchronous Oblivious Robots on Anonymous Rings | 2013-03-13 | Paper |
| Maximum Matching in Multi-Interface Networks | 2012-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2917368 | 2012-09-28 | Paper |
| Distributed colorings for collision-free routing in sink-centric sensor networks | 2012-09-13 | Paper |
| Localization and scheduling protocols for actor-centric sensor networks | 2012-06-29 | Paper |
| Graph decomposition for memoryless periodic exploration | 2012-04-26 | Paper |
| Minimize the maximum duty in multi-interface networks | 2012-04-26 | Paper |
| Synchronous black hole search in directed graphs | 2011-10-10 | Paper |
| Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates | 2011-05-19 | Paper |
| Dense, Concentric, and Non-uniform Multi-hop Sensor Networks | 2011-04-05 | Paper |
| Min-Max Coverage in Multi-interface Networks | 2011-02-15 | Paper |
| Bandwidth Constrained Multi-interface Networks | 2011-02-15 | Paper |
| Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks | 2011-01-10 | Paper |
| On the complexity of distributed graph coloring with local minimality constraints | 2010-11-24 | Paper |
| Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring | 2010-08-11 | Paper |
| Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks | 2010-02-09 | Paper |
| Topology Control and Routing in Ad Hoc Networks | 2010-02-09 | Paper |
| Evaluation of Recoverable-Robust Timetables on Tree Networks | 2009-12-11 | Paper |
| Recoverable Robustness in Shunting and Timetabling | 2009-12-03 | Paper |
| Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases | 2009-12-02 | 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 |
| Recoverable Robust Timetables on Trees | 2009-07-07 | Paper |
| Cost Minimisation in Multi-interface Networks | 2009-03-17 | Paper |
| 3-D Minimum Energy Broadcasting | 2009-03-12 | Paper |
| Layouts for mobility management in wireless ATM networks | 2009-03-04 | Paper |
| Delay Management Problem: Complexity Results and Robust Algorithms | 2009-01-27 | Paper |
| On the Complexity of Distributed Greedy Coloring | 2008-09-02 | Paper |
| Fast periodic graph exploration with constant memory | 2008-06-26 | Paper |
| The “real” approximation factor of the MST heuristic for the minimum energy broadcasting | 2008-06-20 | Paper |
| Asymptotically optimal solutions for small world graphs | 2008-06-06 | Paper |
| Improved approximation results for the minimum energy broadcasting problem | 2008-02-18 | Paper |
| Fast Periodic Graph Exploration with Constant Memory | 2007-11-15 | Paper |
| Sharing the cost of multicast transmissions in wireless networks | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications | 2006-10-31 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| On routing of wavebands for all-to-all communications in all-optical paths and cycles | 2005-04-06 | Paper |
