1 citations · 6 across the 31 of their papers we have counts for
4 papers · 1 filter
Kirchberger's Theorem for Complexes of Oriented Matroids
Winfried Hochstättler, Sophia Keip, Kolja Knauer
The separation theorem of Kirchberger can be proven using a combination of Farkas' Lemma and Caratheodory's Theorem. Since those theorems are at the heart of oriented matroids, we…
Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
Kolja Knauer, Hoang La, Petru Valicov
We study the minimum size of a feedback vertex set in directed and undirected -vertex graphs of given degeneracy or treewidth. In the undirected setting the bound $\frac{k-1…
On monoid graphs
Kolja Knauer, Gil Puig i Surroca
We investigate Cayley graphs of finite semigroups and monoids. First, we look at semigroup digraphs, i.e., directed Cayley graphs of semigroups, and give a Sabidussi-type character…
Labeled sample compression schemes for complexes of oriented matroids
Victor Chepoi, Kolja Knauer, Manon Philibert
We show that the topes of a complex of oriented matroids (abbreviated COM) of VC-dimension admit a proper labeled sample compression scheme of size . This considerably exten…