2 papers
math.CO2026
Finding Minimum Matching Cuts in -free Graphs
Felicia Lucke, Joseph Marchand, Jannik Olbrich
A matching cut is a matching that is also an edge cut. In the problem Minimum Matching Cut, we ask for a matching cut with the minimum number of edges in the matching. We investiga…
cs.DS2024
Hardness Results on Characteristics for Elastic-Degenerated Strings
Dominik Köppl, Jannik Olbrich
Generalizations of plain strings have been proposed as a compact way to represent a collection of nearly identical sequences or to express uncertainty at specific text positions by…