Z. Szigeti

activity

20122023

most citedOn the complexity of finding well-balanced orientations with upper bounds on the out-degrees

2 citations · 5 across the 10 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.CO2022

Steiner connectivity problems in hypergraphs

Florian Hörsch, Zoltán Szigeti

We say that a tree $T$ is an $S$ -Steiner tree if $S \subseteq V (T)$ and a hypergraph is an $S$ -Steiner hypertree if it can be trimmed to an $S$ -Steiner tree. We prove that it is NP…

cs.DM2022

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…

math.CO2022★ 2 cited

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 $G$ has a well-balanced orientation $G$ such that $d_{G}^{+} (v) \leq ℓ (v)$ for all $v \in V (G)$ for a given f…