25 citations · 97 across the 22 of their papers we have counts for
Showing 2009 · cs.DSShow all
2 papers · 2 filters
cs.DS2009★ 17 cited
Generating All Partitions: A Comparison Of Two Encodings
Jerome Kelleher, Barry O'Sullivan
Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. Many algorithms exist to generate all descending composi…
cs.DS2009
Treewidth reduction for constrained separation and bipartization problems
Dániel Marx, Barry O'Sullivan, Igor Razgon
We present a method for reducing the treewidth of a graph while preserving all the minimal separators. This technique turns out to be very useful for establishing the fixed-p…