| Publication | Date of Publication | Type |
|---|
| A bound on the dissociation number | 2023-10-10 | Paper |
| Relating the independence number and the dissociation number | 2023-10-09 | Paper |
| Relating dissociation, independence, and matchings | 2022-10-13 | Paper |
| Identifying codes in the complementary prism of cycles | 2022-04-27 | Paper |
| The hull number in the convexity of induced paths of order \(3\) | 2022-02-21 | Paper |
| Geodetic convexity parameters for \((q, q - 4)\)-graphs | 2021-06-07 | Paper |
| The hull number in the convexity of induced paths of order 3 | 2020-02-25 | Paper |
| Partial immunization of trees | 2020-02-24 | Paper |
| Dynamic monopolies for interval graphs with bounded thresholds | 2019-05-03 | Paper |
| Graphs in which some and every maximum matching is uniquely restricted | 2018-10-31 | Paper |
| Robust recoverable perfect matchings | 2018-05-23 | Paper |
| The geodetic hull number is hard for chordal graphs | 2018-04-09 | Paper |
| On the hardness of finding the geodetic number of a subcubic graph | 2018-04-05 | Paper |
| The Geodetic Hull Number is Hard for Chordal Graphs | 2018-03-05 | Paper |
| Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs | 2017-11-16 | Paper |
| Complexity properties of complementary prisms | 2017-02-22 | Paper |
| Geodetic Convexity Parameters for Graphs with Few Short Induced Paths | 2016-12-22 | Paper |
| On graphs with induced matching number almost equal to matching number | 2016-10-17 | Paper |
| Extremal values and bounds for the zero forcing number | 2016-09-30 | Paper |
| On the geodetic hull number of \(P_{k}\)-free graphs | 2016-07-05 | Paper |
| Slash and burn on graphs -- firefighting with general weights | 2016-06-22 | Paper |
| Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs | 2015-12-08 | Paper |
| tight bounds for k-set agreement with limited-scope failure detectors | 2015-09-04 | Paper |
| Brush your trees! | 2015-09-01 | Paper |
| Identifying Codes in the Complementary Prism of Cycles | 2015-07-17 | Paper |
| Maximum induced matchings close to maximum matchings | 2015-06-11 | Paper |
| On P 3-Convexity of Graphs with Bounded Degree | 2015-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5420034 | 2014-06-11 | Paper |
| More fires and more fighters | 2014-04-10 | Paper |
| Recognizing some complementary products | 2014-01-22 | Paper |
| Geodetic Number versus Hull Number in $P_3$-Convexity | 2013-09-26 | Paper |
| Tight bounds for \(k\)-set agreement with limited-scope failure detectors | 2013-06-07 | Paper |
| Reversible iterative graph processes | 2012-11-27 | Paper |
| Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity | 2012-11-06 | Paper |
| On termination detection in crash-prone distributed systems with failure detectors | 2012-07-26 | Paper |
| Threshold protocols in survivor set systems | 2012-02-06 | Paper |
| Connectivity and diameter in distance graphs | 2011-08-16 | Paper |
| Irreversible conversion of graphs | 2011-07-14 | Paper |
| Long cycles and paths in distance graphs | 2010-10-28 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| Cycles, Paths, Connectivity and Diameter in Distance Graphs | 2010-01-21 | Paper |
| Optimizing Threshold Protocols in Adversarial Structures | 2008-11-20 | Paper |
| From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors | 2008-09-02 | Paper |
| Distributed Computing | 2006-11-01 | Paper |
| A distributed algorithm to find \(k\)-dominating sets | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741487 | 2001-10-24 | Paper |
| On the hull and interval numbers of oriented graphs | 0001-01-03 | Paper |
