Skip to content
Log in

Author

Thomas Erlebach

View on Semantic Scholar

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

2026

Robust Temporal Cut

This paper shows for both strict and non-strict temporal paths that RTC is NP-complete for any combination of k ≥ 1 and δ ≥ 1 and W [1]-hard for parameter solution size or vertex interval membership width plus pathwidth of the underlying graph.

Jessica A. Enright, Thomas Erlebach, Kitty Meeks et al. · 0 citations