| Publication | Date of Publication | Type |
|---|
On the hull and interval numbers of oriented graphs (brief announcement)
Procedia Computer Science | 2025-12-11 | Paper |
A bound on the dissociation number
Journal of Graph Theory | 2023-10-10 | Paper |
Relating the independence number and the dissociation number
Journal of Graph Theory | 2023-10-09 | Paper |
Relating dissociation, independence, and matchings
Discrete Applied Mathematics | 2022-10-13 | Paper |
Identifying codes in the complementary prism of cycles
(available as arXiv preprint) | 2022-04-27 | Paper |
The hull number in the convexity of induced paths of order \(3\)
Theoretical Computer Science | 2022-02-21 | Paper |
Geodetic convexity parameters for \((q, q - 4)\)-graphs
Discrete Applied Mathematics | 2021-06-07 | Paper |
| The hull number in the convexity of induced paths of order 3 | 2020-02-25 | Paper |
Partial immunization of trees
Discrete Optimization | 2020-02-24 | Paper |
Dynamic monopolies for interval graphs with bounded thresholds
Discrete Applied Mathematics | 2019-05-03 | Paper |
Graphs in which some and every maximum matching is uniquely restricted
Journal of Graph Theory | 2018-10-31 | Paper |
Robust recoverable perfect matchings
Networks | 2018-05-23 | Paper |
The geodetic hull number is hard for chordal graphs
(available as arXiv preprint) | 2018-04-09 | Paper |
On the hardness of finding the geodetic number of a subcubic graph
Information Processing Letters | 2018-04-05 | Paper |
The geodetic hull number is hard for chordal graphs
SIAM Journal on Discrete Mathematics | 2018-03-05 | Paper |
Corrigendum to ``Complexity analysis of \(P_{3}\)-convexity problems on bounded-degree and planar graphs''
Theoretical Computer Science | 2017-11-16 | Paper |
Complexity properties of complementary prisms
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
Geodetic convexity parameters for graphs with few short induced paths
Graph-Theoretic Concepts in Computer Science | 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
Discrete Applied Mathematics | 2016-09-30 | Paper |
On the geodetic hull number of \(P_{k}\)-free graphs
Theoretical Computer Science | 2016-07-05 | Paper |
Slash and burn on graphs -- firefighting with general weights
Discrete Applied Mathematics | 2016-06-22 | Paper |
Complexity analysis of P₃-convexity problems on bounded-degree and planar graphs
Theoretical Computer Science | 2015-12-08 | Paper |
tight bounds for k-set agreement with limited-scope failure detectors
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Brush your trees!
Discrete Applied Mathematics | 2015-09-01 | Paper |
Identifying Codes in the Complementary Prism of Cycles
(available as arXiv preprint) | 2015-07-17 | Paper |
Maximum induced matchings close to maximum matchings
Theoretical Computer Science | 2015-06-11 | Paper |
On \(P_{3}\)-convexity of graphs with bounded degree
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
| scientific article; zbMATH DE number 6303056 (Why is no real title available?) | 2014-06-11 | Paper |
More fires and more fighters
Discrete Applied Mathematics | 2014-04-10 | Paper |
Recognizing some complementary products
Theoretical Computer Science | 2014-01-22 | Paper |
Geodetic number versus hull number in P₃-convexity
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Tight bounds for k-set agreement with limited-scope failure detectors
Distributed Computing | 2013-06-07 | Paper |
Reversible iterative graph processes
Theoretical Computer Science | 2012-11-27 | Paper |
Immediate versus eventual conversion: comparing geodetic and hull numbers in \(P _{3}\)-convexity
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
On termination detection in crash-prone distributed systems with failure detectors
Journal of Parallel and Distributed Computing | 2012-07-26 | Paper |
Threshold protocols in survivor set systems
Distributed Computing | 2012-02-06 | Paper |
Connectivity and diameter in distance graphs
Networks | 2011-08-16 | Paper |
Irreversible conversion of graphs
Theoretical Computer Science | 2011-07-14 | Paper |
Long cycles and paths in distance graphs
Discrete Mathematics | 2010-10-28 | Paper |
Tight bounds for \(k\)-set agreement with limited-scope failure detectors
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Cycles, Paths, Connectivity and Diameter in Distance Graphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Optimizing Threshold Protocols in Adversarial Structures
Lecture Notes in Computer Science | 2008-11-20 | Paper |
From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Distributed Computing
Lecture Notes in Computer Science | 2006-11-01 | Paper |
A distributed algorithm to find \(k\)-dominating sets
Discrete Applied Mathematics | 2004-08-06 | Paper |
| A distributed algorithm for k-dominating sets | 2001-10-24 | Paper |
On the hull and interval numbers of oriented graphs
(available as arXiv preprint) | N/A | Paper |
