research
∙
07/20/2023
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
In this work, we initiate the complexity study of Biclique Contraction a...
share
research
∙
06/15/2022
The Complexity of Contracting Bipartite Graphs into Small Cycles
For a positive integer ℓ≥ 3, the C_ℓ-Contractibility problem takes as in...
research
∙
03/17/2022
Parameterized and Exact Algorithms for Class Domination Coloring
A class domination coloring (also called cd-Coloring or dominated colori...
research
∙
02/17/2020
A Note on Arc-Disjoint Cycles in Bipartite Tournaments
We show that for each non-negative integer k, every bipartite tournament...
research
∙
02/20/2018
The Parameterized Complexity of Packing Arc-Disjoint Cycles in Tournaments
Given a directed graph D on n vertices and a positive integer k, the Arc...
research
∙
11/21/2017
