research
∙
06/27/2021
α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms
Lokshtanov et al. [STOC 2017] introduced lossy kernelization as a mathem...
share
research
∙
01/12/2021
Diverse Collections in Matroids and Graphs
We investigate the parameterized complexity of finding diverse sets of s...
research
∙
11/26/2020
Disjoint Stable Matchings in Linear Time
We show that given a SM instance G as input we can find a largest collec...
research
∙
09/09/2020
Diverse Pairs of Matchings
We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matching...
research
∙
05/10/2020
Structural Parameterizations of Clique Coloring
A clique coloring of a graph is an assignment of colors to its vertices ...
research
∙
12/04/2019
On Computing the Hamiltonian Index of Graphs
The r-th iterated line graph L^r(G) of a graph G is defined by: (i) L^0(...
research
∙
11/12/2019
FPT Algorithms for Diverse Collections of Hitting Sets
In this work, we study the d-Hitting Set and Feedback Vertex Set problem...
research
∙
03/18/2019
Diversity in Combinatorial Optimization
When modeling an application of practical relevance as an instance of a ...
research
∙
01/08/2019
Subset Feedback Vertex Set in Chordal and Split Graphs
In the Subset Feedback Vertex Set (Subset-FVS) problem the input is a gr...
research
∙
09/22/2018