The dissemination of information on networks involves many important practical issues, such as the spread and containment of rumors in social networks, the spread of infectious diseases among the population, commercial propaganda and promotion, the expansion of political influence and so on.One of the most important problems is the influence-maximi

Problem.Social networks are increasingly becoming an environment for threats, insults, profanity and other destructive manifestations of human communication.Today, a huge number of people are involved in online platforms, and the amount of content created and reactions to it is constantly breaking records.Therefore, there is a need to automate the

Given two integers $ell$ and $p$ as well as $ell$ graph classes $mathcal{H}_1,ldots,mathcal{H}_ell$, the problems $mathsf{GraphPart}(mathcal{H}_1, ldots, mathcal{H}_ell,p)$, reak $mathsf{VertPart}(mathcal{H}_1, ldots, mathcal{H}_ell)$, and $mathsf{EdgePart}(mathcal{H}_1, ldots, mathcal{H}_ell)$ ask, given graph $G$ as input, whether $V(G)$, Skate

Metal additive manufacturing (AM) has been growing remarkably in the past few years.Thanks to the advantages of unmatched flexibility and zero material waste, this clean technology opens the door for new design solutions with greater material efficiency, which are not possible through conventional machining techniques.In this paper, we provide a te