Florian Hörsch

Orcid: 0000-0002-5410-613X

According to our database1, Florian Hörsch authored at least 27 papers between 2020 and 2024.

Collaborative distances:

Timeline

2020
2021
2022
2023
2024
0
5
10
7
6
4
5
1
3
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Steiner connectivity problems in hypergraphs.
Inf. Process. Lett., January, 2024

Rainbow Bases in Matroids.
SIAM J. Discret. Math., 2024

Decompositions into two linear forests of bounded lengths.
Discret. Math., 2024

FPT algorithms for packing k-safe spanning rooted sub(di)graphs.
Discret. Appl. Math., 2024

Diameter of the inversion graph.
CoRR, 2024

Matroid-reachability-based decomposition into arborescences.
CoRR, 2024

Complexity Results on the Decomposition of a Digraph into Directed Linear Forests and Out-Stars.
Electron. J. Comb., 2024

From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Problems on Group-Labeled Matroid Bases.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
On orientations maximizing total arc-connectivity.
Theor. Comput. Sci., November, 2023

Complexity of (arc)-connectivity problems involving arc-reversals or deorientations.
Theor. Comput. Sci., September, 2023

The complexity of 2-vertex-connected orientation in mixed graphs.
Discret. Optim., May, 2023

On the complexity of finding well-balanced orientations with upper bounds on the out-degrees.
J. Comb. Optim., 2023

Globally balancing spanning trees.
Eur. J. Comb., 2023

On the minimum number of inversions to make a digraph k-(arc-)strong.
CoRR, 2023

2022
Reachability in arborescence packings.
Discret. Appl. Math., 2022

Checking the admissibility of odd-vertex pairings is hard.
Discret. Appl. Math., 2022

Problems, proofs, and disproofs on the inversion number.
CoRR, 2022

Spanning trees of smallest maximum degree in subdivisions of graphs.
CoRR, 2022

2021
Connectivity problems in graph theory: structures, algorithms and complexity. (Problèmes de connexité en théorie de graphes: structures, algorithmes et complexité).
PhD thesis, 2021

Connectivity of orientations of 3-edge-connected graphs.
Eur. J. Comb., 2021

Eulerian orientations and vertex-connectivity.
Discret. Appl. Math., 2021

A note on 2-vertex-connected orientations.
CoRR, 2021

Packing of Mixed Hyperarborescences with Flexible Roots via Matroid Intersection.
Electron. J. Comb., 2021

The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects.
Algorithmica, 2021

2020
Matroid fragility and relaxations of circuit hyperplanes.
J. Comb. Theory B, 2020


  Loading...