Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Saurabh, Saket
add a person with the name Saurabh, Saket
 

Other publications of authors with the same name

Algorithmic Lower Bounds for Problems Parameterized with Clique-Width., , , and . SODA, page 493-502. SIAM, (2010)Intractability of Clique-Width Parameterizations., , , and . SIAM J. Comput., 39 (5): 1941-1956 (2010)FPT algorithms for Connected Feedback Vertex Set., , , , and . J. Comb. Optim., 24 (2): 131-146 (2012)On the directed Full Degree Spanning Tree problem., , , and . Discrete Optimization, 8 (1): 97-109 (2011)A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments., , , and . Theory Comput. Syst., 53 (4): 609-620 (2013)Parameterized complexity of MaxSat Above Average., , , , and . Theor. Comput. Sci., (2013)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , and . SIAM J. Discrete Math., 31 (2): 1294-1327 (2017)Covering Vectors by Spaces: Regular Matroids., , , and . SIAM J. Discrete Math., 32 (4): 2512-2565 (2018)Faster fixed parameter tractable algorithms for finding feedback vertex sets., , and . ACM Trans. Algorithms, 2 (3): 403-415 (2006)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)