14 citations · 22 across the 11 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016
Fine-Grained Complexity Analysis of Two Classic TSP Variants
Mark de Berg, Kevin Buchin, Bart M. P. Jansen +1
We analyze two classic variants of the Traveling Salesman Problem using the toolkit of fine-grained complexity. Our first set of results is motivated by the Bitonic TSP problem: gi…
cs.DS2016
Approximation and Kernelization for Chordal Vertex Deletion
Bart M. P. Jansen, Marcin Pilipczuk
The Chordal Vertex Deletion (ChVD) problem asks to delete a minimum number of vertices from an input graph to obtain a chordal graph. In this paper we develop a polynomial kernel f…