Dekel Tsur

most citedl-path vertex cover is easier than l-hitting set for small l

2 citations · 2 across the 1 of their papers we have counts for

collaborators

3 papers

cs.DS2019

An FPT algorithm for orthogonal buttons and scissors

Dekel Tsur

We study the puzzle game Buttons and Scissors in which the goal is to remove all buttons from an $n \times m$ grid by a series of horizontal and vertical cuts. We show that the corr…

cs.DS2019

Cluster deletion revisited

Dekel Tsur

In the Cluster Deletion problem the input is a graph $G$ and an integer $k$ , and the goal is to decide whether there is a set of at most $k$ edges whose removal from $G$ results a…

cs.DS2019★ 2 cited

l-path vertex cover is easier than l-hitting set for small l

Dekel Tsur

In the $l$ -path vertex cover problem the input is an undirected graph $G$ and an integer $k$ . The goal is to decide whether there is a set of vertices $S$ of size at most $k$ such…