114 citations · 306 across the 50 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024★ 1 cited
On polynomial kernelization for Stable Cutset
Stefan Kratsch, Van Bang Le
A stable cutset in a graph is a set such that vertices of are pairwise non-adjacent and such that is disconnected, i.e., it is both stable (or indep…
cs.DS2024
Tight Algorithm for Connected Odd Cycle Transversal Parameterized by Clique-width
Narek Bojikian, Stefan Kratsch
Recently, Bojikian and Kratsch [2023] have presented a novel approach to tackle connectivity problems parameterized by clique-width (), based on counting small r…