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:
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 OtherLinks
On csauthors.net:
Bibliography
2024
Discret. Appl. Math., 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
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
Theor. Comput. Sci., November, 2023
Theor. Comput. Sci., September, 2023
Discret. Optim., May, 2023
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees.
J. Comb. Optim., 2023
2022
Discret. Appl. Math., 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
Electron. J. Comb., 2021
Algorithmica, 2021
2020