Blar i Bergen Open Research Archive på forfatter "Saurabh, Saket"

Viser treff 41-43 av 43

    • Resolute control: Forbidding candidates from winning an election is hard 

      Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav (Journal article; Peer reviewed, 2022)

    • Subexponential Algorithms for Partial Cover Problems 

      Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket (Peer reviewed; Journal article, 2009)
      Partial Cover problems are optimization versions of fundamental and well studied problems like {\sc Vertex Cover} and {\sc Dominating Set}. Here one is interested in covering (or dominating) the maximum number of edges (or ...

    • Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems 

      Fomin, Fedor; Le, Tien-Nam; Lokshtanov, Daniel; Saurabh, Saket; Thomasse, Stephan; Zehavi, Meirav (Peer reviewed; Journal article, 2019)
      We consider four well-studied NP-complete packing/covering problems on graphs: Feedback Vertex Set in Tournaments (FVST), Cluster Vertex Deletion (CVD), Triangle Packing in Tournaments (TPT) and Induced P3-Packing. For ...