Florian Hörsch

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

Collaborative distances:

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

2026

Increasing arc-connectivity by bounded- and fixed-size inversions.

Florian Hörsch, Lucas Picasarri-Arrieta

CoRR, April, 2026

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

J. Graph Theory, February, 2026

Diameter of the inversion graph.

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

Innov. Graph Theory, 2026

Maximum Reachability Orientation of Mixed Graphs.

Florian Hörsch

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025

Making an oriented graph acyclic using inversions of bounded or prescribed size.

Jørgen Bang-Jensen, Frédéric Havet, Florian Hörsch, Clément Rambaud, Amadeus Reinald, Caroline Silva

CoRR, November, 2025

Fixed-parameter tractability and hardness for Steiner rooted and locally connected orientations.

Kristóf Bérczi, Florian Hörsch, András Imolay, Tamás Schwarcz

CoRR, November, 2025

Odd and Even Harder Problems on Cycle-Factors.

Florian Hörsch, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Eszter Szabó, Yutaro Yamaguchi

CoRR, October, 2025

From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity.

Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx

CoRR, February, 2025

The 3-Dicritical Semi-Complete Digraphs.

Frédéric Havet, Florian Hörsch, Lucas Picasarri-Arrieta

Electron. J. Comb., 2025

Problems, Proofs, and Disproofs on the Inversion Number.

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

Electron. J. Comb., 2025

Multicut Problems in Almost-Planar Graphs: the Dependency of Complexity on the Demand Pattern.

Florian Hörsch, Dániel Marx

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Steiner connectivity problems in hypergraphs.

Florian Hörsch, Zoltán Szigeti

Inf. Process. Lett., January, 2024

Rainbow Bases in Matroids.

Florian Hörsch, Tomás Kaiser, Matthias Kriesell

SIAM J. Discret. Math., 2024

Decompositions into two linear forests of bounded lengths.

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

Discret. Math., 2024

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

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

Discret. Appl. Math., 2024

Matroid-reachability-based decomposition into arborescences.

Florian Hörsch, Benjamin Peyrille, Zoltán Szigeti

CoRR, 2024

Complexity Results on the Decomposition of a Digraph into Directed Linear Forests and Out-Stars.

Florian Hörsch, Lucas Picasarri-Arrieta

Electron. J. Comb., 2024

From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges.

Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Problems on Group-Labeled Matroid Bases.

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

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.

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

Proceedings of the 40th International Symposium on Computational Geometry, 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

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

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 B, 2020