research
∙
07/15/2023
Minimum Separator Reconfiguration
We study the problem of reconfiguring one minimum s-t-separator A into a...
share
research
∙
09/02/2022
On the arboreal jump number of a poset
A jump is a pair of consecutive elements in an extension of a poset whic...
research
∙
08/03/2022
On the Computational Complexity of the Strong Geodetic Recognition Problem
A strong geodetic set of a graph G=(V,E) is a vertex set S ⊆ V(G) in whi...
research
∙
02/09/2022
Weighted Connected Matchings
A matching M is a 𝒫-matching if the subgraph induced by the endpoints of...
research
∙
02/07/2022
Reducing the Vertex Cover Number via Edge Contractions
The CONTRACTION(vc) problem takes as input a graph G on n vertices and t...
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
∙
11/30/2020
On the proper orientation number of chordal graphs
An orientation D of a graph G=(V,E) is a digraph obtained from G by repl...
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
∙
05/04/2020
Reducing graph transversals via edge contractions
For a graph parameter π, the Contraction(π) problem consists in, given a...
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
∙
07/02/2019
Covering graphs with convex sets and partitioning graphs into convex sets
We present some complexity results concerning the problems of covering a...
research
∙
10/30/2018
Parameterized Complexity of Equitable Coloring
A graph on n vertices is equitably k-colorable if it is k-colorable and ...
research
∙
03/20/2018
