research
∙
03/20/2023
An Improved Exact Algorithm for Knot-Free Vertex Deletion
A knot K in a directed graph D is a strongly connected component of size...
share
research
∙
08/18/2020
Parameterized Complexity of Maximum Edge Colorable Subgraph
A graph H is p-edge colorable if there is a coloring ψ: E(H) →{1,2,…,p},...
research
∙
02/20/2018
