| Publication | Date of Publication | Type |
|---|
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 |
Parameterized complexity for iterated type partitions and modular-width
Discrete Applied Mathematics | 2024-04-10 | Paper |
SimpleHypergraphs.jl -- novel software framework for modelling and analysis of hypergraphs
Lecture Notes in Computer Science | 2024-02-16 | 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 |
| Speeding up networks mining via neighborhood diversity | 2023-02-07 | Paper |
Space-optimal proportion consensus with population protocols
Lecture Notes in Computer Science | 2022-11-04 | 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 |
| Social Influence Maximization in Hypergraphs - Data set | 2021-06-08 | Dataset |
On evaluating graph partitioning algorithms for distributed agent based models on networks
Euro-Par 2015: Parallel Processing Workshops | 2021-04-14 | Paper |
Parameterized Complexity of Immunization in the Threshold Model
(available as arXiv preprint) | 2021-02-06 | 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 |
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 |
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 |
Discovering small target sets in social networks: a fast and effective algorithm
Algorithmica | 2018-06-01 | Paper |
Brief Announcement
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Multi-level dynamo and opinion spreading
Mathematical Structures in Computer Science | 2017-04-04 | 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 |
Spread of influence in weighted networks under time and budget constraints
Theoretical Computer Science | 2015-05-26 | Paper |
On scheduling series-parallel DAGs to maximize area
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
Latency-bounded target set selection in social networks
Theoretical Computer Science | 2014-04-29 | Paper |
Latency-bounded target set selection in social networks
Lecture Notes in Computer Science | 2013-08-05 | Paper |
| The effects of induced emotional states on emotional experience: a research agenda | 2013-08-01 | Paper |
On clustering \textsc{Dag}s for task-hungry computing platforms
Central European Journal of Computer Science | 2012-12-06 | Paper |
Minimum Weight Dynamo and Fast Opinion Spreading
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules
Journal of Parallel and Distributed Computing | 2012-10-23 | Paper |
Extending IC-scheduling via the sweep algorithm
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
Efficient on-line algorithms for Euler diagram region computation
Computational Geometry | 2010-10-15 | Paper |
Navigable small-world networks with few random bits
Theoretical Computer Science | 2009-11-06 | Paper |
Degree-optimal routing for P2P systems
Theory of Computing Systems | 2009-09-18 | Paper |
F-Chord: Improved uniform routing on Chord
Networks | 2008-12-17 | Paper |
How Much Independent Should Individual Contacts Be to Form a Small–World?
Algorithms and Computation | 2008-04-24 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
