Florian Hörsch
Scholar

Florian Hörsch

Google Scholar ID: R1QE17YAAAAJ
CISPA, Saarbrücken
graph theorycomplexity theory
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
80
 
H-index
5
 
i10-index
2
 
Publications
20
 
Co-authors
0
 
Contact
No contact links provided.
Publications
5 items
Making an oriented graph acyclic using inversions of bounded or prescribed size
2025
Cited
0
Odd and Even Harder Problems on Cycle-Factors
2025
Cited
0
From Chinese Postman to Salesman and Beyond: Shortest Tour δ-Covering All Points on All Edges
International Symposium on Algorithms and Computation · 2024
Cited
0
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
International Symposium on Computational Geometry · 2023
Cited
0
On the minimum number of inversions to make a digraph k-(arc-)strong
European Conference on Combinatorics, Graph Theory and Applications · 2023
Cited
2
Resume (English only)
Co-authors
0 total
Co-authors: 0 (list not available)