activity
20152020
most citedParameterized Algorithms for Partitioning Graphs into Highly Connected Clusters

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing 2018Show all

1 paper · 1 filter

cs.DS2018

Solving Target Set Selection with Bounded Thresholds Faster than

Ivan Bliznets, Danil Sagunov

In this paper we consider the Target Set Selection problem. The problem naturally arises in many fields like economy, sociology, medicine. In the Target Set Selection problem one i…