research
∙
03/21/2023
On the minimum number of inversions to make a digraph k-(arc-)strong
The inversion of a set X of vertices in a digraph D consists of reversin...
share
research
∙
01/27/2023
Decompositions into two linear forests of bounded lengths
For some k ∈ℤ_≥ 0∪∞, we call a linear forest k-bounded if each of its co...
research
∙
12/18/2022
Problems, proofs, and disproofs on the inversion number
The inversion of a set X of vertices in a digraph D consists in reversin...
research
∙
11/04/2022
Steiner connectivity problems in hypergraphs
We say that a tree T is an S-Steiner tree if S ⊆ V(T) and a hypergraph i...
research
∙
10/10/2022
Spanning trees of smallest maximum degree in subdivisions of graphs
Given a graph G and a positive integer k, we study the question wheth...
research
∙
02/28/2022
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
We show that the problem of deciding whether a given graph G has a well-...
research
∙
12/14/2021
A note on 2-vertex-connected orientations
We consider two possible extensions of a theorem of Thomassen characteri...
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/27/2021
Checking the admissibility of odd-vertex pairings is hard
Nash-Williams proved that every graph has a well-balanced orientation. A...
research
∙
12/27/2020
Packing of mixed hyperarborescences with flexible roots via matroid intersection
Given a mixed hypergraph ℱ=(V,𝒜∪ℰ), functions f,g:V→ℤ_+ and an integer k...
research
∙
12/06/2020