| Partial immunization of trees | 0 | 0.34 | 2020 |
| The Hull Number in the Convexity of Induced Paths of Order 3. | 0 | 0.34 | 2019 |
| On the hardness of finding the geodetic number of a subcubic graph. | 0 | 0.34 | 2018 |
| Dynamic monopolies for interval graphs with bounded thresholds. | 1 | 0.36 | 2018 |
| The Geodetic Hull Number is Hard for Chordal Graphs. | 2 | 0.38 | 2017 |
| Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95]. | 0 | 0.34 | 2017 |
| Complexity properties of complementary prisms | 0 | 0.34 | 2017 |
| Geodetic convexity parameters for (q, q-4)-graphs. | 0 | 0.34 | 2017 |
| Slash and burn on graphs — Firefighting with general weights | 1 | 0.36 | 2016 |
| Geodetic Convexity Parameters for Graphs with Few Short Induced Paths. | 0 | 0.34 | 2016 |
| Extremal values and bounds for the zero forcing number. | 8 | 1.03 | 2016 |
| Brush your trees! | 1 | 0.37 | 2015 |
| Robust recoverable perfect matchings | 2 | 0.41 | 2015 |
| Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4. | 0 | 0.34 | 2015 |
| The P3-Convexity in the Complementary Prism of a Graph. | 0 | 0.34 | 2015 |
| Complexity analysis of P-convexity problems on bounded-degree and planar graphs. | 1 | 0.36 | 2015 |
| On Graphs with Induced Matching Number Almost Equal to Matching Number | 0 | 0.34 | 2015 |
| Maximum induced matchings close to maximum matchings | 3 | 0.39 | 2015 |
| On P 3-Convexity of Graphs with Bounded Degree. | 0 | 0.34 | 2014 |
| Recognizing some complementary products | 3 | 0.50 | 2014 |
| Geodetic Number versus Hull Number in P3-Convexity. | 0 | 0.34 | 2013 |
| More fires and more fighters | 16 | 0.74 | 2013 |
| Immediate versus Eventual Conversion: Comparing Geodetic and Hull Numbers in P 3-Convexity. | 1 | 0.37 | 2012 |
| Reversible iterative graph processes | 4 | 0.57 | 2012 |
| Irreversible conversion of graphs | 49 | 1.95 | 2011 |
| Connectivity and diameter in distance graphs | 6 | 0.46 | 2011 |
| Brief announcement: on reversible and irreversible conversions | 2 | 0.41 | 2010 |
| Long cycles and paths in distance graphs | 4 | 0.49 | 2010 |
| Threshold protocols in survivor set systems | 3 | 0.42 | 2010 |
| Cycles, Paths, Connectivity and Diameter in Distance Graphs | 2 | 0.37 | 2009 |
| On termination detection in crash-prone distributed systems with failure detectors | 1 | 0.35 | 2008 |
| Optimizing Threshold Protocols in Adversarial Structures | 0 | 0.34 | 2008 |
| Relating stabilizing timing assumptions to stabilizing failure detectors regarding solvability and efficiency | 4 | 0.38 | 2007 |
| Secure failure detection in TrustedPals | 3 | 0.42 | 2007 |
| From crash-stop to permanent omission: automatic transformation and weakest failure detectors | 3 | 0.40 | 2007 |
| TrustedPals: secure multiparty computation implemented with smart cards | 21 | 0.85 | 2006 |
| Safety, Liveness, and Information Flow: Dependability Revisited | 1 | 0.35 | 2006 |
| Optimal randomized fair exchange with secret shared coins | 7 | 0.55 | 2005 |
| Transformations in Secure and Fault-Tolerant Distributed Computation | 0 | 0.34 | 2005 |
| Efficient reduction for wait-free termination detection in a crash-prone distributed system | 9 | 0.57 | 2005 |
| Tight bounds for k-set agreement with limited-scope failure detectors | 23 | 0.83 | 2005 |
| A distributed algorithm to find k-dominating sets | 15 | 0.77 | 2003 |
| A distributed algorithm for k-dominating sets | 0 | 0.34 | 2001 |
