9 citations · 72 across the 25 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 6 cited
Finding small separators in linear time via treewidth reduction
Dániel Marx, Barry O'Sullivan, Igor Razgon
We present a method for reducing the treewidth of a graph while preserving all of its minimal separators up to a certain fixed size . This technique allows us to solve $s-…
cs.DM2011★ 8 cited
Large Isolating Cuts Shrink the Multiway Cut
Igor Razgon
We propose a preprocessing algorithm for the multiway cut problem that establishes its polynomial kernelizability when the difference between the parameter and the size of the…