PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Saurabh, Saket"

Author of the publication

copydeleteadd this publication to your clipboard
Covering Vectors by Spaces: Regular Matroids.

, , , and . SIAM J. Discrete Math., 32 (4): 2512-2565 (2018)

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

Intractability of Clique-Width Parameterizations., , , and . SIAM J. Comput., 39 (5): 1941-1956 (2010)Algorithmic Lower Bounds for Problems Parameterized with Clique-Width., , , and . SODA, page 493-502. SIAM, (2010)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)Sharp Separation and Applications to Exact and Parameterized Algorithms., , , and . Algorithmica, 63 (3): 692-706 (2012)Algorithms and Kernels for Feedback Set Problems in Generalizations of Tournaments., , and . Algorithmica, 76 (2): 320-343 (2016)$$(k, n-k)$$ ( k , n - k ) -Max-Cut: An $$O^*(2^p)$$ O ∗ ( 2 p ) -Time Algorithm and a Polynomial Kernel., and . Algorithmica, 80 (12): 3844-3860 (2018)Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs, , , and . CoRR, (2012)A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments., , , , , and . CoRR, (2018)Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes., , and . J. ACM, 65 (2): 10:1-10:44 (2018)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs, , , , and . CoRR, (2012)