Memetic Algorithms (MAs) are computational intelligence structures combining multiple and
various operators in order to address optimization problems. The combination and …

Memetic Algorithms (MAs) are computational intelligence structures combining multiple and
various operators in order to address optimization problems. The diversity in the operator …

We study the NP-hard graph problem Collapsed k-Core where, given an undirected graph G
and integers b, x, and k, we are asked to remove b vertices such that the k-core of remaining …

We develop a new framework for generalizing approximation algorithms from the structural
graph algorithm literature so that they apply to graphs somewhat close to that class (a …

For any graph class HH, the H H-Contraction problem takes as input a graph GG and an
integer kk, and asks whether there exists a graph H ∈ HH∈ H such that GG can be modified …

The SETH is a hypothesis of fundamental importance to (fine-grained) parameterized
complexity theory and many important tight lower bounds are based on it. This situation is …

A graph is d-orientable if its edges can be oriented so that the maximum in-degree of the
resulting digraph is at most d. d-orientability is a well-studied concept with close connections …

Inspired by the famous Target Set Selection problem, we propose a new discrete model for
simultaneously spreading several opinions within a social network and perform an initial …

Dynamic systems are becoming steadily more important with the profusion of mobile and
distributed computing devices. Coincidentally incremental computation is a natural …

We study the following model of disease spread in a social network. In the beginning, all
individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the …