| Publication | Date of Publication | Type |
|---|
| Molecular pattern formation on grids in the \textsc{Moblot} model | 2024-04-04 | Paper |
| A structured methodology for designing distributed algorithms for mobile entities | 2023-12-11 | Paper |
| Variety of mutual-visibility problems in graphs | 2023-09-18 | Paper |
| Mutual visibility in hypercube-like graphs | 2023-08-28 | 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 |
| Mutual-visibility in distance-hereditary graphs: a linear-time algorithm | 2023-07-20 | Paper |
| Arbitrary pattern formation on infinite regular tessellation graphs | 2022-12-21 | Paper |
| On the mutual visibility in Cartesian products and triangle-free graphs | 2022-11-16 | Paper |
| Mutual-visibility in strong products of graphs via total mutual-visibility | 2022-10-14 | Paper |
| On the Vertex Position Number of Graphs | 2022-09-01 | Paper |
| A graph theoretical approach to the firebreak locating problem | 2022-04-19 | Paper |
| Mutual visibility in graphs | 2022-03-03 | Paper |
| On the mutual visibility in Cartesian products and triangle-free graphs | 2021-12-24 | Paper |
| On the effectiveness of the genetic paradigm for polygonization | 2021-06-16 | Paper |
| Mutual Visibility in Graphs | 2021-05-06 | Paper |
| On monophonic position sets in graphs | 2020-12-18 | Paper |
| Gathering robots in graphs: the central role of synchronicity | 2020-12-15 | 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 |
| Approximation algorithms for decomposing octilinear polygons | 2019-06-06 | Paper |
| Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane | 2018-12-03 | 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 |
| 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 |
| Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model | 2017-02-20 | 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 |
| MinMax-Distance Gathering on Given Meeting Points | 2015-09-21 | Paper |
| Decomposing Octilinear Polygons into Triangles and Rectangles | 2015-09-14 | Paper |
| Computing on rings by oblivious robots: a unified approach for different tasks | 2015-09-02 | Paper |
| Gathering on rings under the look-compute-move model | 2015-02-23 | Paper |
| Gathering six oblivious robots on anonymous symmetric rings | 2014-04-28 | 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/Q2847382 | 2013-09-09 | Paper |
| Distance-Hereditary Comparability Graphs | 2013-07-19 | Paper |
| Engineering a new algorithm for distributed shortest paths on dynamic networks | 2013-05-16 | Paper |
| How to Gather Asynchronous Oblivious Robots on Anonymous Rings | 2013-03-13 | Paper |
| Distance-hereditary comparability graphs | 2012-11-22 | Paper |
| Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances | 2012-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2917363 | 2012-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2917368 | 2012-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2917373 | 2012-09-28 | Paper |
| On the online track assignment problem | 2012-05-30 | Paper |
| Minimize the maximum duty in multi-interface networks | 2012-04-26 | 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 |
| Partially dynamic efficient algorithms for distributed shortest paths | 2010-03-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 |
| Recoverable Robust Timetables on Trees | 2009-07-07 | Paper |
| Treelike comparability graphs | 2009-06-24 | Paper |
| On minimum \(k\)-modal partitions of permutations | 2009-05-13 | Paper |
| Delay Management Problem: Complexity Results and Robust Algorithms | 2009-01-27 | Paper |
| On Minimum k-Modal Partitions of Permutations | 2008-09-18 | Paper |
| Dynamic multi-level overlay graphs for shortest paths | 2008-09-08 | Paper |
| Online Bounded Coloring of Permutation and Overlap Graphs | 2008-06-05 | Paper |
| Track assignment | 2007-10-30 | Paper |
| Networks with small stretch number | 2007-04-26 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Self-spanner graphs | 2005-09-28 | Paper |
| (\(k,+\))-distance-hereditary graphs | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448748 | 2004-02-18 | Paper |
| A fully dynamic algorithm for distributed shortest paths. | 2003-08-17 | Paper |
| Compact-port routing models and applications to distance-hereditary graphs | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766673 | 2002-07-22 | Paper |
| Static and dynamic low-congested interval routing schemes | 2002-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511227 | 2001-07-24 | Paper |
| Graphs with bounded induced distance | 2001-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520243 | 2000-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508381 | 2000-10-03 | Paper |
| On the extension of bipartite to parity graphs | 2000-04-04 | Paper |
| Graph classes between parity and distance-hereditary graphs | 2000-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217589 | 1999-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232787 | 1999-03-15 | Paper |
