1 citations · 1 across the 2 of their papers we have counts for
6 papers · 1 filter
Maximizing Happiness in Graphs of Bounded Clique-Width
Ivan Bliznets, Danil Sagunov
Clique-width is one of the most important parameters that describes structural complexity of a graph. Probably, only treewidth is more studied graph width parameter. In this paper…
On Happy Colorings, Cuts, and Structural Parameterizations
Ivan Bliznets, Danil Sagunov
We study the Maximum Happy Vertices and Maximum Happy Edges problems. The former problem is a variant of clusterization, where some vertices have already been assigned to clusters.…
Lower Bounds for the Happy Coloring Problems
Ivan Bliznets, Danil Sagunov
In this paper, we study the Maximum Happy Vertices and the Maximum Happy Edges problems (MHV and MHE for short). Very recently, the problems attracted a lot of attention and were s…
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…
Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
Ivan Bliznets, Nikolai Karpov
Clustering is a well-known and important problem with numerous applications. The graph-based model is one of the typical cluster models. In the graph model, clusters are generally…
Parameterized Complexity of Superstring Problems
Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach +3
In the Shortest Superstring problem we are given a set of strings and integer and the question is to decide whether there is a superstring of le…