Author

Martin Schirneck

h-index 12 View on Semantic Scholar

We have 3 of 39 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

Implicit Hitting Set Enumeration for Power Dominating Sets

The Transversal Hypergraph problem asks to enumerate (list) all inclusion-minimal hitting sets of a hypergraph. It usually assumes that the input is completely known and does not change over the course of the enumeration. In many applications, the underlying hypergraph is too large or expensive to compute. This motivat...

Thomas Bläsius, Max Göttlicher, Martin Schirneck · 0 citations

Preprint Aug 2026

Near-Optimal Replacement Path Coverings

Let $L$ and $f$ be positive integers. An $(L,f)$-replacement path covering (RPC) for a graph $G$ is a family $\mathcal{G}$ of subgraphs such that, for every set $F$ of at most $f$ edges, there is a subfamily $\mathcal{G}_F \subseteq \mathcal{G}$ with the following properties. (1) No subgraph in $\mathcal{G}_F$ contains...

Davide Bilò, Keerti Choudhary, S. Cohen et al. · 0 citations

Preprint Aug 2026

Minimal-to-Maximal Conversion Search Is Not Output-Polynomial

It is proved that Minimal-to-Maximal Conversion Search is in fact not output-polynomial and the lower bound construction motivates a more detailed analysis of how certain heuristic choices in the algorithm design affect the running time.

Bennet Hörmann, Martin Schirneck · 0 citations