| Publication | Date of Publication | Type |
|---|
| Graph burning in community-based networks | 2024-11-12 | Paper |
| Getting linear time in graphs of bounded neighborhood diversity | 2024-09-05 | Paper |
| Parameterized complexity for iterated type partitions and modular-width | 2024-04-10 | Paper |
| SimpleHypergraphs.jl -- novel software framework for modelling and analysis of hypergraphs | 2024-02-16 | 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 |
| Speeding up networks mining via neighborhood diversity | 2023-02-07 | Paper |
| Space-Optimal Proportion Consensus with Population Protocols | 2022-11-04 | 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 |
| Social Influence Maximization in Hypergraphs - Data set | 2021-06-08 | Dataset |
| On Evaluating Graph Partitioning Algorithms for Distributed Agent Based Models on Networks | 2021-04-14 | Paper |
| Parameterized Complexity of Immunization in the Threshold Model | 2021-02-06 | 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 |
| Active influence spreading in social networks | 2019-03-13 | Paper |
| Time-bounded influence diffusion with incentives | 2019-01-30 | Paper |
| Evangelism in social networks: Algorithms and complexity | 2018-09-04 | Paper |
| Time-Bounded Influence Diffusion with Incentives | 2018-07-18 | Paper |
| Discovering small target sets in social networks: a fast and effective algorithm | 2018-06-01 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Multi-level dynamo and opinion spreading | 2017-04-04 | 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 |
| Spread of influence in weighted networks under time and budget constraints | 2015-05-26 | Paper |
| On scheduling series-parallel DAGs to maximize area | 2014-11-14 | Paper |
| Latency-bounded target set selection in social networks | 2014-04-29 | Paper |
| Latency-Bounded Target Set Selection in Social Networks | 2013-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5327004 | 2013-08-01 | Paper |
| On clustering \textsc{Dag}s for task-hungry computing platforms | 2012-12-06 | Paper |
| Minimum Weight Dynamo and Fast Opinion Spreading | 2012-11-06 | Paper |
| On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules | 2012-10-23 | Paper |
| Extending IC-scheduling via the sweep algorithm | 2012-03-07 | Paper |
| Efficient on-line algorithms for Euler diagram region computation | 2010-10-15 | Paper |
| Navigable small-world networks with few random bits | 2009-11-06 | Paper |
| Degree-optimal routing for P2P systems | 2009-09-18 | Paper |
| F-Chord: Improved uniform routing on Chord | 2008-12-17 | Paper |
| How Much Independent Should Individual Contacts Be to Form a Small–World? | 2008-04-24 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
