| Publication | Date of Publication | Type |
|---|
| An efficient algorithm for group testing with runlength constraints | 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 | 2024-11-12 | Paper |
| Getting linear time in graphs of bounded neighborhood diversity | 2024-09-05 | Paper |
| Improved algorithms and bounds for list union-free families | 2024-07-22 | Paper |
| Parameterized complexity for iterated type partitions and modular-width | 2024-04-10 | Paper |
| Spanning trees with few branch vertices in graphs of bounded neighborhood diversity | 2024-01-11 | Paper |
| Groups burning: analyzing spreading processes in community-based networks | 2023-11-24 | Paper |
| Immunization in the threshold model: a parameterized complexity study | 2023-11-17 | Paper |
| Pervasive domination | 2023-08-03 | Paper |
| Bounds and algorithms for generalized superimposed codes | 2023-06-05 | Paper |
| Speeding up networks mining via neighborhood diversity | 2023-02-07 | Paper |
| Communication complexity of gossiping by packets | 2022-12-09 | Paper |
| Iterated Type Partitions | 2022-10-13 | Paper |
| Parameterized complexity of immunization in the threshold model | 2022-07-13 | Paper |
| Dual domination problems in graphs | 2022-05-16 | Paper |
| Parameterized Complexity of Immunization in the Threshold Model | 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 | 2020-02-20 | Paper |
| Whom to befriend to influence people | 2020-02-06 | Paper |
| Low-weight superimposed codes and related combinatorial structures: bounds and applications | 2020-01-16 | Paper |
| Active influence spreading in social networks | 2019-03-13 | Paper |
| Time-bounded influence diffusion with incentives | 2019-01-30 | Paper |
| Fast gossiping by short messages | 2019-01-10 | Paper |
| Evangelism in social networks: Algorithms and complexity | 2018-09-04 | Paper |
| Time-Bounded Influence Diffusion with Incentives | 2018-07-18 | Paper |
| Optimally balanced spanning tree of the star network | 2018-07-09 | Paper |
| Discovering small target sets in social networks: a fast and effective algorithm | 2018-06-01 | Paper |
| On \(k\)-strong conflict-free multicoloring | 2018-03-26 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Whom to befriend to influence people | 2016-12-01 | Paper |
| On Finding Small Sets that Influence Large Networks | 2016-10-16 | Paper |
| Evangelism in Social Networks | 2016-09-29 | Paper |
| A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks | 2016-02-05 | Paper |
| Optimizing Spread of Influence in Social Networks via Partial Incentives | 2016-01-08 | Paper |
| Strong conflict-free coloring for intervals | 2015-01-19 | Paper |
| Complexity of conflict-free colorings of graphs | 2015-01-06 | Paper |
| Optimal time data gathering in wireless networks with multidirectional antennas | 2014-01-13 | Paper |
| Strong Conflict-Free Coloring for Intervals | 2013-03-21 | Paper |
| Collision-free path coloring with application to minimum-delay gathering in sensor networks | 2009-06-24 | Paper |
| Gathering with Minimum Delay in Tree Sensor Networks | 2008-07-10 | Paper |
| Optimally Fast Data Gathering in Sensor Networks | 2007-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818867 | 2004-09-24 | Paper |
| Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security | 2002-06-23 | Paper |
| Efficient collective communciation in optical networks | 2000-08-23 | Paper |
| Fast collective communication by packets in the postal model | 2000-06-21 | Paper |
| Communication complexity of fault-tolerant information diffusion | 1999-01-12 | Paper |
| Minimum time broadcast in faulty star networks | 1998-10-08 | Paper |
| Fast Gossiping by Short Messages | 1998-09-20 | Paper |
| Communication complexity of gossiping by packets | 1997-12-17 | Paper |
| On the communication complexity of polling | 1997-02-27 | Paper |
| Embedding graphs onto the Supercube | 1995-01-01 | Paper |
| Fault—tolerant hypercube broadcasting via information dispersal | 1993-08-23 | Paper |
