Author

Simon Wietheger

h-index 5 View on Semantic Scholar

We have 2 of 22 papers

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.

Preprint Oct 2026

A Uniform Algorithm for Strict NP on Bounded-Treedepth Graphs

A classical well-quasi-ordering result guarantees the existence of non-uniform linear-time algorithms for all problems in Strict NP on relational structures of bounded treedepth; however, this provides neither a procedure for constructing these algorithms nor computable bounds on their parameter dependence. We turn thi...

Thomas Depian, Robert Ganian, Jakob Greilhuber et al. · 0 citations

Jul 2026

Improved Learning with Structure: Fine-Grained Complexity of Minimum Consistent Subset

A comprehensive fine-grained complexity map of MCS on both unweighted and weighted graphs is developed and the results strictly delineate the algorithmic boundaries of consistent subset selection across diverse metric structures.

R. Ganian, M. Vasilakis, Simon Wietheger · arXiv.org · 0 citations