In the Split to Block Vertex Deletion and Threshold problems input is a split graph G an integer k, goal decide whether there set S of vertices size at most k such that G?S block threshold graph, respectively. this paper we give algorithms for these whose running times are O?(2.076k) O?(1.619k),