On time versus size for monotone dynamic monopolies in regular topologies
Journal of Discrete Algorithms
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Theoretical Computer Science
Note: Combinatorial model and bounds for target set selection
Theoretical Computer Science
Irreversible conversion of graphs
Theoretical Computer Science
Dynamic monopolies with randomized starting configuration
Theoretical Computer Science
Dynamic monopolies and feedback vertex sets in hexagonal grids
Computers & Mathematics with Applications
Variants of spreading messages
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Bounding the number of tolerable faults in majority-based systems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Stable sets of threshold-based cascades on the erdős-rényi random graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Discrete Applied Mathematics
On the non-progressive spread of influence through social networks
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Triggering cascades on undirected connected graphs
Information Processing Letters
Reversible iterative graph processes
Theoretical Computer Science
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
Theoretical Computer Science
| Hi-index | 0.01 |