2 citations · 5 across the 10 of their papers we have counts for
14 papers
Packing mixed hyperarborescences
Zoltán Szigeti
The aim of this paper is twofold. We first provide a new orientation theorem which gives a natural and simple proof of a result of Gao, Yang \cite{GY} on matroid-reachability-based…
On reversing arcs to improve arc-connectivity
Pierre Hoppenot, Zoltán Szigeti
We show that if the arc-connectivity of a directed graph is at most and the reorientation of an arc set in results in a -arc-connected…
Directed hypergraph connectivity augmentation by hyperarc reorientations
Moritz Mühlenthaler, Benjamin Peyrille, Zoltán Szigeti
The orientation theorem of Nash-Williams states that an undirected graph admits a -arc-connected orientation if and only if it is -edge-connected. Recently, Ito et al. showe…
Steiner connectivity problems in hypergraphs
Florian Hörsch, Zoltán Szigeti
We say that a tree is an -Steiner tree if and a hypergraph is an -Steiner hypertree if it can be trimmed to an -Steiner tree. We prove that it is NP…
On packing time-respecting arborescences
Romain Chapoullié, Zoltán Szigeti
We present a slight generalization of the result of Kamiyama and Kawase \cite{kamkaw} on packing time-respecting arborescences in acyclic pre-flow temporal networks. Our main contr…
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
Florian Hörsch, Zoltán Szigeti
We show that the problem of deciding whether a given graph has a well-balanced orientation such that for all for a given f…