Send email Copy Email Address
Placeholder
Postdoc

Florian Hörsch

Email

Address

Kaiserstraße 21
66386 St. Ingbert (Germany)

Member of Groups

Further Information

Publications by Florian Hörsch

Year 2026

2026-02

On the Minimum Number of Inversions to Make a Digraph k‐(Arc‐)Strong

Article

Journal of Graph Theory

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page

Year 2025

2025-06-25

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

Conference / Medium

European Symposium on Algorithms (ESA)

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page

Year 2024

2024-10-09

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

Conference / Medium

International Symposium on Algorithms and Computation (ISAAC)

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2024-07-02

Problems on Group-Labeled Matroid Bases

Conference / Medium

International Colloquium on Automata Languages and Programming (ICALP)

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2024-06-30

Rainbow Bases in Matroids

Article

SIAM Journal on Discrete Mathematics

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2024-06-06

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern

Conference / Medium

International Symposium on Computational Geometry (SoCG)

Tags
Authors
Full Paper Visit Detail Page
2024-06

Decompositions into two linear forests of bounded lengths

Article

Discrete Mathematics

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page

Year 2023

2023-11

On orientations maximizing total arc-connectivity

Article

Theoretical Computer Science

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2023-09-21

Complexity of (arc)-connectivity problems involving arc-reversals or deorientations

Article

Theoretical Computer Science

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page
2023-08-28

On the minimum number of inversions to make a digraph k-(arc-)strong

Conference / Medium

European Conference on Combinatorics Graph Theory and Applications (EUROCOMB)

Tags
Algorithmic Foundations and Cryptography
Authors
Full Paper Visit Detail Page