Florian Hoersch

Available identifiers

zbMath Open horsch.florianMaRDI QIDQ1985442

List of research outcomes

Publication	Date of Publication	Type
FPT algorithms for packing $k$-safe spanning rooted sub(di)graphs	2024-02-14	Paper
On orientations maximizing total arc-connectivity	2023-10-12	Paper
Steiner connectivity problems in hypergraphs	2023-10-12	Paper
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations	2023-09-07	Paper
The complexity of 2-vertex-connected orientation in mixed graphs	2023-06-30	Paper
On the minimum number of inversions to make a digraph $k$-(arc-)strong	2023-03-21	Paper
Decompositions into two linear forests of bounded lengths	2023-01-27	Paper
Globally balancing spanning trees	2022-12-28	Paper
Problems, proofs, and disproofs on the inversion number	2022-12-18	Paper
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees	2022-12-16	Paper
Spanning trees of smallest maximum degree in subdivisions of graphs	2022-10-10	Paper
Reachability in arborescence packings	2022-08-24	Paper
Rainbow bases in matroids	2022-06-21	Paper
Checking the admissibility of odd-vertex pairings is hard	2022-05-27	Paper
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees	2022-02-28	Paper
Packing of mixed hyperarborescences with flexible roots via matroid intersection	2021-08-09	Paper
The $(2, k)$-connectivity augmentation problem: algorithmic aspects	2021-07-26	Paper
Connectivity of orientations of 3-edge-connected graphs	2021-04-14	Paper
Checking the admissibility of odd-vertex pairings is hard	2021-02-27	Paper
Eulerian orientations and vertex-connectivity	2020-12-29	Paper
The $(2,k)$-connectivity augmentation problem: Algorithmic aspects	2020-04-18	Paper
Matroid fragility and relaxations of circuit hyperplanes	2020-04-07	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Florian Hoersch

Publication	Date of Publication	Type
FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs	2024-02-14	Paper
On orientations maximizing total arc-connectivity	2023-10-12	Paper
Steiner connectivity problems in hypergraphs	2023-10-12	Paper
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations	2023-09-07	Paper
The complexity of 2-vertex-connected orientation in mixed graphs	2023-06-30	Paper
On the minimum number of inversions to make a digraph $k$-(arc-)strong	2023-03-21	Paper
Decompositions into two linear forests of bounded lengths	2023-01-27	Paper
Globally balancing spanning trees	2022-12-28	Paper
Problems, proofs, and disproofs on the inversion number	2022-12-18	Paper
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees	2022-12-16	Paper
Spanning trees of smallest maximum degree in subdivisions of graphs	2022-10-10	Paper
Reachability in arborescence packings	2022-08-24	Paper
Rainbow bases in matroids	2022-06-21	Paper
Checking the admissibility of odd-vertex pairings is hard	2022-05-27	Paper
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees	2022-02-28	Paper
Packing of mixed hyperarborescences with flexible roots via matroid intersection	2021-08-09	Paper
The \((2, k)\)-connectivity augmentation problem: algorithmic aspects	2021-07-26	Paper
Connectivity of orientations of 3-edge-connected graphs	2021-04-14	Paper
Checking the admissibility of odd-vertex pairings is hard	2021-02-27	Paper
Eulerian orientations and vertex-connectivity	2020-12-29	Paper
The $(2,k)$-connectivity augmentation problem: Algorithmic aspects	2020-04-18	Paper
Matroid fragility and relaxations of circuit hyperplanes	2020-04-07	Paper