14 citations · 22 across the 11 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015★ 14 cited
A structural approach to kernels for ILPs: Treewidth and Total Unimodularity
Bart M. P. Jansen, Stefan Kratsch
Kernelization is a theoretical formalization of efficient preprocessing for NP-hard problems. Empirically, preprocessing is highly successful in practice, for example in state-of-t…
cs.DS2015★ 8 cited
Uniform Kernelization Complexity of Hitting Forbidden Minors
Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov +1
The F-Minor-Free Deletion problem asks, for a fixed set F and an input consisting of a graph G and integer k, whether k vertices can be removed from G such that the resulting graph…