2 citations · 8 across the 13 of their papers we have counts for
10 papers · 1 filter
Faster parameterized algorithm for Bicluter Editing
Dekel Tsur
In the Bicluter Editing problem the input is a graph and an integer , and the goal is to decide whether can be transformed into a bicluster graph by adding and removing…
An algorithm for destroying claws and diamonds
Dekel Tsur
In the {Claw,Diamond}-Free Edge Deletion problem the input is a graph and an integer , and the goal is to decide whether there is a set of edges of size at most such tha…
Kernel for Kt-free edge deletion
Dekel Tsur
In the -free edge deletion problem, the input is a graph and an integer , and the goal is to decide whether there is a set of at most edges of whose removal res…
Faster algorithms for cograph edge modification problems
Dekel Tsur
In the Cograph Deletion (resp., Cograph Editing) problem the input is a graph and an integer , and the goal is to decide whether there is a set of edges of size at most …
Algorithms for deletion problems on split graphs
Dekel Tsur
In the Split to Block Vertex Deletion and Split to Threshold Vertex Deletion problems the input is a split graph and an integer , and the goal is to decide whether there is…
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 grid by a series of horizontal and vertical cuts. We show that the corr…