| Publication | Date of Publication | Type |
|---|
| Red-blue unshared dominators | 2026-02-26 | Paper |
(t, r)-broadcast domination in graphs
Discrete Applied Mathematics | 2026-02-11 | Paper |
Spanning trees minimizing branching costs
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-01-13 | Paper |
| Parameterized complexity of (d, r)-domination via modular decomposition | 2025-04-15 | Paper |
An efficient algorithm for group testing with runlength constraints
Discrete Applied Mathematics | 2024-12-04 | Paper |
| An FPT algorithm for spanning trees with few branch vertices parameterized by modular-width | 2024-12-03 | Paper |
Graph burning in community-based networks
Journal of Graph Algorithms and Applications | 2024-11-12 | Paper |
Getting linear time in graphs of bounded neighborhood diversity
Networks | 2024-09-05 | Paper |
Improved algorithms and bounds for list union-free families
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Parameterized complexity for iterated type partitions and modular-width
Discrete Applied Mathematics | 2024-04-10 | Paper |
Spanning trees with few branch vertices in graphs of bounded neighborhood diversity
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Groups burning: analyzing spreading processes in community-based networks
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Immunization in the threshold model: a parameterized complexity study
Algorithmica | 2023-11-17 | Paper |
Pervasive domination
Lecture Notes in Computer Science | 2023-08-03 | Paper |
Bounds and algorithms for generalized superimposed codes
Information Processing Letters | 2023-06-05 | Paper |
| Speeding up networks mining via neighborhood diversity | 2023-02-07 | Paper |
Communication complexity of gossiping by packets
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Iterated Type Partitions
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Parameterized complexity of immunization in the threshold model
(available as arXiv preprint) | 2022-07-13 | Paper |
Dual domination problems in graphs
Journal of Computer and System Sciences | 2022-05-16 | Paper |
Parameterized Complexity of Immunization in the Threshold Model
(available as arXiv preprint) | 2021-02-06 | Paper |
| Low-weight superimposed codes and their applications | 2020-07-07 | Paper |
| Dual Domination | 2020-02-25 | Paper |
Fast and frugal targeting with incentives
Theoretical Computer Science | 2020-02-20 | Paper |
Whom to befriend to influence people
Theoretical Computer Science | 2020-02-06 | Paper |
Low-weight superimposed codes and related combinatorial structures: bounds and applications
Theoretical Computer Science | 2020-01-16 | Paper |
Active influence spreading in social networks
Theoretical Computer Science | 2019-03-13 | Paper |
Time-bounded influence diffusion with incentives
(available as arXiv preprint) | 2019-01-30 | Paper |
Fast gossiping by short messages
Automata, Languages and Programming | 2019-01-10 | Paper |
Evangelism in social networks: algorithms and complexity
Networks | 2018-09-04 | Paper |
Time-Bounded Influence Diffusion with Incentives
(available as arXiv preprint) | 2018-07-18 | Paper |
Optimally balanced spanning tree of the star network
IEEE Transactions on Computers | 2018-07-09 | Paper |
Discovering small target sets in social networks: a fast and effective algorithm
Algorithmica | 2018-06-01 | Paper |
| On \(k\)-strong conflict-free multicoloring | 2018-03-26 | Paper |
Brief Announcement
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| On Finding Small Sets that Influence Large Networks | 2016-10-16 | Paper |
Evangelism in social networks
Lecture Notes in Computer Science | 2016-09-29 | Paper |
A fast and effective heuristic for discovering small target sets in social networks
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Optimizing spread of influence in social networks via partial incentives
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Strong conflict-free coloring for intervals
Algorithmica | 2015-01-19 | Paper |
Complexity of conflict-free colorings of graphs
Theoretical Computer Science | 2015-01-06 | Paper |
Optimal time data gathering in wireless networks with multidirectional antennas
Theoretical Computer Science | 2014-01-13 | Paper |
Strong conflict-free coloring for intervals
Algorithms and Computation | 2013-03-21 | Paper |
Collision-free path coloring with application to minimum-delay gathering in sensor networks
Discrete Applied Mathematics | 2009-06-24 | Paper |
Gathering with Minimum Delay in Tree Sensor Networks
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Optimally Fast Data Gathering in Sensor Networks
Lecture Notes in Computer Science | 2007-09-05 | Paper |
| scientific article; zbMATH DE number 2102779 (Why is no real title available?) | 2004-09-24 | Paper |
Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
Information Sciences | 2002-06-23 | Paper |
Efficient collective communciation in optical networks
Theoretical Computer Science | 2000-08-23 | Paper |
| Fast collective communication by packets in the postal model | 2000-06-21 | Paper |
Communication complexity of fault-tolerant information diffusion
Theoretical Computer Science | 1999-01-12 | Paper |
Minimum time broadcast in faulty star networks
Discrete Applied Mathematics | 1998-10-08 | Paper |
Fast Gossiping by Short Messages
SIAM Journal on Computing | 1998-09-20 | Paper |
Communication complexity of gossiping by packets
Journal of Parallel and Distributed Computing | 1997-12-17 | Paper |
On the communication complexity of polling
Information Processing Letters | 1997-02-27 | Paper |
Embedding graphs onto the Supercube
IEEE Transactions on Computers | 1995-01-01 | Paper |
Fault—tolerant hypercube broadcasting via information dispersal
Networks | 1993-08-23 | Paper |
