research
∙
07/15/2023
Minimum Separator Reconfiguration
We study the problem of reconfiguring one minimum s-t-separator A into a...
share
research
∙
02/09/2022
Weighted Connected Matchings
A matching M is a 𝒫-matching if the subgraph induced by the endpoints of...
research
∙
12/16/2021
Disconnected Matchings
In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgrap...
research
∙
11/30/2020
Parameterized algorithms for locating-dominating sets
A locating-dominating set D of a graph G is a dominating set of G where ...
research
∙
11/30/2020
On structural parameterizations of the selective coloring problem
In the Selective Coloring problem, we are given an integer k, a graph G,...
research
∙
07/08/2020
FPT and kernelization algorithms for the k-in-a-tree problem
The three-in-a-tree problem asks for an induced tree of the input graph ...
research
∙
04/23/2020
Coloring Problems on Bipartite Graphs of Small Diameter
We investigate a number of coloring problems restricted to bipartite gra...
research
∙
04/22/2020
Some results on Vertex Separator Reconfiguration
We present the first results on the complexity of the reconfiguration of...
research
∙
11/24/2019
Intersection graph of maximal stars
A biclique of a graph G is an induced complete bipartite subgraph of G s...
research
∙
11/08/2019
Structural Parameterizations for Equitable Coloring
An n-vertex graph is equitably k-colorable if there is a proper coloring...
research
∙
05/08/2019