The fundamental theorem of Turán from Extremal Graph Theory determines
t...
Parameterization above (or below) a guarantee is a successful concept in...
In 1959, Erdős and Gallai proved that every graph G with average vertex
...
We study two "above guarantee" versions of the classical Longest Path pr...
In 1952, Dirac proved the following theorem about long cycles in graphs ...
We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matching...
Clique-width is one of the most important parameters that describes
stru...
A popular model to measure network stability is the k-core, that is the
...
We study the Maximum Happy Vertices and Maximum Happy Edges problems. Th...
In this paper, we study the Maximum Happy Vertices and the Maximum Happy...
In this paper we consider the Target Set Selection problem. The problem
...