research
∙
07/14/2023
Turán's Theorem Through Algorithmic Lens
The fundamental theorem of Turán from Extremal Graph Theory determines t...
share
research
∙
05/03/2023
Approximating Long Cycle Above Dirac's Guarantee
Parameterization above (or below) a guarantee is a successful concept in...
research
∙
02/07/2022
Longest Cycle above Erdős-Gallai Bound
In 1959, Erdős and Gallai proved that every graph G with average vertex ...
research
∙
01/10/2022
Detours in Directed Graphs
We study two "above guarantee" versions of the classical Longest Path pr...
research
∙
11/06/2020
Algorithmic Extensions of Dirac's Theorem
In 1952, Dirac proved the following theorem about long cycles in graphs ...
research
∙
09/09/2020
Diverse Pairs of Matchings
We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matching...
research
∙
03/10/2020
Maximizing Happiness in Graphs of Bounded Clique-Width
Clique-width is one of the most important parameters that describes stru...
research
∙
02/18/2020
Building large k-cores from sparse graphs
A popular model to measure network stability is the k-core, that is the ...
research
∙
07/14/2019
On Happy Colorings, Cuts, and Structural Parameterizations
We study the Maximum Happy Vertices and Maximum Happy Edges problems. Th...
research
∙
06/12/2019
Lower Bounds for the Happy Coloring Problems
In this paper, we study the Maximum Happy Vertices and the Maximum Happy...
research
∙
07/27/2018
