Florian Hörsch

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Steiner connectivity problems in hypergraphs.

Florian Hörsch, Zoltán Szigeti

Inf. Process. Lett., January, 2024

Problems on Group-labeled Matroid Bases.

Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz

CoRR, 2024

Complexity results on the decomposition of a digraph into directed linear forests and out-stars.

Florian Hörsch, Lucas Picasarri-Arrieta

CoRR, 2024

2023

On orientations maximizing total arc-connectivity.

Florian Hörsch

Theor. Comput. Sci., November, 2023

Complexity of (arc)-connectivity problems involving arc-reversals or deorientations.

Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell

Theor. Comput. Sci., September, 2023

The complexity of 2-vertex-connected orientation in mixed graphs.

Florian Hörsch, Zoltán Szigeti

Discret. Optim., May, 2023

On the complexity of finding well-balanced orientations with upper bounds on the out-degrees.

Florian Hörsch, Zoltán Szigeti

J. Comb. Optim., 2023

Globally balancing spanning trees.

Florian Hörsch

Eur. J. Comb., 2023

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern.

Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx

CoRR, 2023

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

Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud

CoRR, 2023

Decompositions into two linear forests of bounded lengths.

Rutger Campbell, Florian Hörsch, Benjamin R. Moore

CoRR, 2023

2022

Reachability in arborescence packings.

Florian Hörsch, Zoltán Szigeti

Discret. Appl. Math., 2022

Checking the admissibility of odd-vertex pairings is hard.

Florian Hörsch

Discret. Appl. Math., 2022

Problems, proofs, and disproofs on the inversion number.

Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande

CoRR, 2022

Spanning trees of smallest maximum degree in subdivisions of graphs.

Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr

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é).

Florian Hoersch

PhD thesis, 2021

Connectivity of orientations of 3-edge-connected graphs.

Florian Hörsch, Zoltán Szigeti

Eur. J. Comb., 2021

Eulerian orientations and vertex-connectivity.

Florian Hoersch, Zoltán Szigeti

Discret. Appl. Math., 2021

A note on 2-vertex-connected orientations.

Florian Hörsch, Zoltán Szigeti

CoRR, 2021

FPT algorithms for packing k-safe spanning rooted sub(di)graphs.

Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau

CoRR, 2021

Packing of Mixed Hyperarborescences with Flexible Roots via Matroid Intersection.

Florian Hörsch, Zoltán Szigeti

Electron. J. Comb., 2021

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

Florian Hörsch, Zoltán Szigeti

Algorithmica, 2021

2020

Matroid fragility and relaxations of circuit hyperplanes.

Jim Geelen, Florian Hoersch

J. Comb. Theory, Ser. B, 2020