Florian Hörsch

49 papers A* 2A 2B 1Journal 44

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Maximum Reachability Orientation of Mixed Graphs. STACS Florian Hörsch
2026	J	`jnl`	Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. Discret. Comput. Geom. Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx
2026	J	`jnl`	On the Minimum Number of Inversions to Make a Digraph k -(Arc-)Strong. J. Graph Theory Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud
2025	J	`jnl`	Fixed-parameter tractability and hardness for Steiner rooted and locally connected orientations. CoRR Kristóf Bérczi, Florian Hörsch, András Imolay, Tamás Schwarcz
2025	J	`jnl`	From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity. CoRR Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx
2025	J	`jnl`	Making an oriented graph acyclic using inversions of bounded or prescribed size. CoRR Jørgen Bang-Jensen, Frédéric Havet, Florian Hörsch, Clément Rambaud, Amadeus Reinald, Caroline Silva
2025	J	`jnl`	Maximum Reachability Orientation of Mixed Graphs. CoRR Florian Hörsch
2025	J	`jnl`	Multicut Problems in Almost-Planar Graphs: The Dependency of Complexity on the Demand Pattern. CoRR Florian Hörsch, Dániel Marx
2025	A	`conf`	Multicut Problems in Almost-Planar Graphs: the Dependency of Complexity on the Demand Pattern. ESA Florian Hörsch, Dániel Marx
2025	J	`jnl`	Odd and Even Harder Problems on Cycle-Factors. CoRR Florian Hörsch, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Eszter Szabó, Yutaro Yamaguchi
2025	J	`jnl`	Problems, Proofs, and Disproofs on the Inversion Number. Electron. J. Comb. Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Kingelhoefer, Nicolas Nisse, Clément Rambaud, Quentin Vermande
2025	J	`jnl`	The 3-Dicritical Semi-Complete Digraphs. Electron. J. Comb. Frédéric Havet, Florian Hörsch, Lucas Picasarri-Arrieta
2024	J	`jnl`	Complexity Results on the Decomposition of a Digraph into Directed Linear Forests and Out-Stars. Electron. J. Comb. Florian Hörsch, Lucas Picasarri-Arrieta
2024	J	`jnl`	Complexity results on the decomposition of a digraph into directed linear forests and out-stars. CoRR Florian Hörsch, Lucas Picasarri-Arrieta
2024	J	`jnl`	Decompositions into two linear forests of bounded lengths. Discret. Math. Rutger Campbell, Florian Hörsch, Benjamin R. Moore
2024	J	`jnl`	Diameter of the inversion graph. CoRR Frédéric Havet, Florian Hörsch, Clément Rambaud
2024	J	`jnl`	FPT algorithms for packing k-safe spanning rooted sub(di)graphs. Discret. Appl. Math. Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
2024	B	`conf`	From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. ISAAC Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx
2024	J	`jnl`	From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges. CoRR Fabian Frei, Ahmed Ghazy, Tim A. Hartmann, Florian Hörsch, Dániel Marx
2024	J	`jnl`	Matroid-reachability-based decomposition into arborescences. CoRR Florian Hörsch, Benjamin Peyrille, Zoltán Szigeti
2024	A*	`conf`	Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. SoCG Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx
2024	A*	`conf`	Problems on Group-Labeled Matroid Bases. ICALP Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz
2024	J	`jnl`	Problems on Group-labeled Matroid Bases. CoRR Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki, Tamás Schwarcz
2024	J	`jnl`	Rainbow Bases in Matroids. SIAM J. Discret. Math. Florian Hörsch, Tomás Kaiser, Matthias Kriesell
2024	J	`jnl`	Steiner connectivity problems in hypergraphs. Inf. Process. Lett. Florian Hörsch, Zoltán Szigeti
2023	J	`jnl`	Complexity of (arc)-connectivity problems involving arc-reversals or deorientations. Theor. Comput. Sci. Jørgen Bang-Jensen, Florian Hörsch, Matthias Kriesell
2023	J	`jnl`	Decompositions into two linear forests of bounded lengths. CoRR Rutger Campbell, Florian Hörsch, Benjamin R. Moore
2023	J	`jnl`	Globally balancing spanning trees. Eur. J. Comb. Florian Hörsch
2023	J	`jnl`	Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. CoRR Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx
2023	J	`jnl`	On orientations maximizing total arc-connectivity. Theor. Comput. Sci. Florian Hörsch
2023	J	`jnl`	On the complexity of finding well-balanced orientations with upper bounds on the out-degrees. J. Comb. Optim. Florian Hörsch, Zoltán Szigeti
2023	J	`jnl`	On the minimum number of inversions to make a digraph k-(arc-)strong. CoRR Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud
2023	J	`jnl`	The complexity of 2-vertex-connected orientation in mixed graphs. Discret. Optim. Florian Hörsch, Zoltán Szigeti
2022	J	`jnl`	Checking the admissibility of odd-vertex pairings is hard. Discret. Appl. Math. Florian Hörsch
2022	J	`jnl`	On the complexity of finding well-balanced orientations with upper bounds on the out-degrees. CoRR Florian Hörsch, Zoltán Szigeti
2022	J	`jnl`	Problems, proofs, and disproofs on the inversion number. CoRR Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande
2022	J	`jnl`	Reachability in arborescence packings. Discret. Appl. Math. Florian Hörsch, Zoltán Szigeti
2022	J	`jnl`	Spanning trees of smallest maximum degree in subdivisions of graphs. CoRR Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr
2022	J	`jnl`	Steiner connectivity problems in hypergraphs. CoRR Florian Hörsch, Zoltán Szigeti
2021	J	`jnl`	A note on 2-vertex-connected orientations. CoRR Florian Hörsch, Zoltán Szigeti
2021	J	`jnl`	Checking the admissibility of odd-vertex pairings is hard. CoRR Florian Hörsch
2021	J	`jnl`	Connectivity of orientations of 3-edge-connected graphs. Eur. J. Comb. Florian Hörsch, Zoltán Szigeti
2021	J	`jnl`	FPT algorithms for packing k-safe spanning rooted sub(di)graphs. CoRR Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia, Dieter Rautenbach, Ignasi Sau
2021	J	`jnl`	Globally balancing spanning trees. CoRR Florian Hörsch
2021	J	`jnl`	Packing of Mixed Hyperarborescences with Flexible Roots via Matroid Intersection. Electron. J. Comb. Florian Hörsch, Zoltán Szigeti
2021	J	`jnl`	The (2, k)-Connectivity Augmentation Problem: Algorithmic Aspects. Algorithmica Florian Hörsch, Zoltán Szigeti
2020	J	`jnl`	Connectivity of orientations of 3-edge-connected graphs. CoRR Florian Hörsch, Zoltán Szigeti
2020	J	`jnl`	Packing of mixed hyperarborescences with flexible roots via matroid intersection. CoRR Florian Hörsch, Zoltán Szigeti
2020	J	`jnl`	Reachability in arborescence packings. CoRR Florian Hörsch, Zoltán Szigeti