research
∙
04/07/2023
Temporalizing digraphs via linear-size balanced bi-trees
In a directed graph D on vertex set v_1,… ,v_n, a forward arc is an arc ...
share
research
∙
07/14/2022
Kernelization for Graph Packing Problems via Rainbow Matching
We introduce a new kernelization tool, called rainbow matching technique...
research
∙
05/04/2021
FPT algorithms for packing k-safe spanning rooted sub(di)graphs
We study three problems introduced by Bang-Jensen and Yeo [Theor. Comput...
research
∙
02/08/2021
Complementary cycles of any length in regular bipartite tournaments
Let D be a k-regular bipartite tournament on n vertices. We show that, f...
research
∙
07/06/2020
Non-separating spanning trees and out-branchings in digraphsof independence number 2
A subgraph H= (V, F) of a graph G= (V,E) is non-separating if G-F, that ...
research
∙
10/04/2019
Width Parameterizations for Knot-free Vertex Deletion on Digraphs
A knot in a directed graph G is a strongly connected subgraph Q of G wit...
research
∙
05/07/2019
The structure of graphs with given number of blocks and the maximum Wiener index
The Wiener index (the distance) of a connected graph is the sum of dista...
research
∙
05/07/2019
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs
Wiener index, defined as the sum of distances between all unordered pair...
research
∙
02/19/2018
(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity
Given a tournament T, the problem MaxCT consists of finding a maximum (a...
research
∙
02/12/2018
Dynamic monopolies for interval graphs with bounded thresholds
For a graph G and an integer-valued threshold function τ on its vertex s...
research
∙
01/18/2018
