Florian Hörsch

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 34

Top Topics

Computationally Challenging

Problems Involving

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Publications

Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. SoCG (2024)
Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz
Problems on Group-labeled Matroid Bases. CoRR (2024)
Florian Hörsch, Tomás Kaiser, Matthias Kriesell
Rainbow Bases in Matroids. SIAM J. Discret. Math. 38 (2) (2024)
Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz
Problems on Group-Labeled Matroid Bases. ICALP (2024)
Florian Hörsch, Benjamin Peyrille, Zoltán Szigeti
Matroid-reachability-based decomposition into arborescences. CoRR (2024)
Frédéric Havet, Florian Hörsch, Clément Rambaud
Diameter of the inversion graph. CoRR (2024)
Florian Hörsch, Zoltán Szigeti
Steiner connectivity problems in hypergraphs. Inf. Process. Lett. 183 (2024)
Florian Hörsch, Lucas Picasarri-Arrieta
Complexity results on the decomposition of a digraph into directed linear forests and out-stars. CoRR (2024)
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discret. Appl. Math. 346 (2024)
Rutger Campbell, Florian Hörsch, Benjamin R. Moore
Decompositions into two linear forests of bounded lengths. Discret. Math. 347 (6) (2024)
Florian Hörsch
Globally balancing spanning trees. Eur. J. Comb. 109 (2023)
Rutger Campbell, Florian Hörsch, Benjamin Moore
Decompositions into two linear forests of bounded lengths. CoRR (2023)
Florian Hörsch, Zoltán Szigeti
The complexity of 2-vertex-connected orientation in mixed graphs. Discret. Optim. 48 (Part 1) (2023)
Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud
On the minimum number of inversions to make a digraph k-(arc-)strong. CoRR (2023)
Florian Hörsch, Zoltán Szigeti
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees. J. Comb. Optim. 45 (1) (2023)
Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. CoRR (2023)
Florian Hörsch
On orientations maximizing total arc-connectivity. Theor. Comput. Sci. 978 (2023)
Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell
Complexity of (arc)-connectivity problems involving arc-reversals or deorientations. Theor. Comput. Sci. 973 (2023)
Florian Hörsch, Zoltán Szigeti
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees. CoRR (2022)
Florian Hörsch, Zoltán Szigeti
Steiner connectivity problems in hypergraphs. CoRR (2022)
Florian Hörsch
Checking the admissibility of odd-vertex pairings is hard. Discret. Appl. Math. 317 (2022)
Florian Hörsch, Zoltán Szigeti
Reachability in arborescence packings. Discret. Appl. Math. 320 (2022)
Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr
Spanning trees of smallest maximum degree in subdivisions of graphs. CoRR (2022)
Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande
Problems, proofs, and disproofs on the inversion number. CoRR (2022)
Florian Hörsch, Zoltán Szigeti
Packing of Mixed Hyperarborescences with Flexible Roots via Matroid Intersection. Electron. J. Comb. 28 (3) (2021)
Florian Hörsch, Zoltán Szigeti
Connectivity of orientations of 3-edge-connected graphs. Eur. J. Comb. 94 (2021)
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
FPT algorithms for packing k-safe spanning rooted sub(di)graphs. CoRR (2021)
Florian Hörsch
Globally balancing spanning trees. CoRR (2021)
Florian Hörsch
Checking the admissibility of odd-vertex pairings is hard. CoRR (2021)
Florian Hörsch, Zoltán Szigeti
A note on 2-vertex-connected orientations. CoRR (2021)
Florian Hörsch, Zoltán Szigeti
The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects. Algorithmica 83 (8) (2021)
Florian Hörsch, Zoltán Szigeti
Packing of mixed hyperarborescences with flexible roots via matroid intersection. CoRR (2020)
Florian Hörsch, Zoltán Szigeti
Connectivity of orientations of 3-edge-connected graphs. CoRR (2020)
Florian Hörsch, Zoltán Szigeti
Reachability in arborescence packings. CoRR (2020)