2 citations · 8 across the 13 of their papers we have counts for
24 papers
Pathwidth-One Vertex Explosion and Co-Path Problems
Dekel Tsur
In the Bipartite One-sided Vertex Explosion problem (BOVE), the input is a bipartite graph and a nonnegative integer . The goal is to decide whether there is a s…
Faster parameterized algorithm for 3-Hitting Set
Dekel Tsur
In the 3-Hitting Set problem, the input is a hypergraph such that the size of every hyperedge of is at most 3, and an integers , and the goal is to decide whether there…
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 …