114 citations · 385 across the 36 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2026
Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
Joshua Brakensiek, Venkatesan Guruswami, Bart M. P. Jansen +2
We say that an instance of a constraint satisfaction problem (CSP) is non-redundant if the satisfaction of each clause cannot be implied by the satisfaction of the other clauses in…
cs.DM2016★ 10 cited
Independent Set Reconfiguration Thresholds of Hereditary Graph Classes
Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee
Traditionally, reconfiguration problems ask the question whether a given solution of an optimization problem can be transformed to a target solution in a sequence of small steps th…