8 citations · 66 across the 52 of their papers we have counts for
Showing 2026 · cs.CCShow all
2 papers · 2 filters
cs.CC2026
On the Parameterized Complexity of Coloring Discovery
Eric Decker, Sebastian Siebertz
Coloring Discovery asks whether a possibly improper initial coloring can be made proper within a prescribed number of allowed changes. We study the parameterized complexity of thre…
cs.CC2026
The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz
A theorem of Ding, Oporowski, Oxley, and Vertigan implies that any sufficiently large twin-free graph contains a large matching, a co-matching, or a half-graph as a semi-induced su…