Saket Saurabh
Saket Saurabh
Verified email at imsc.res.in
TitleCited byYear
Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Springer 4 (8), 2015
9462015
Lower bounds based on the exponential time hypothesis
D Lokshtanov, D Marx, S Saurabh
Bulletin of EATCS 3 (105), 2013
2482013
Kernelization lower bounds through colors and IDs
M Dom, D Lokshtanov, S Saurabh
ACM Transactions on Algorithms (TALG) 11 (2), 13, 2014
238*2014
Bidimensionality and kernels
FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
1822010
(Meta) Kernelization
HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ...
Journal of the ACM (JACM) 63 (5), 44, 2016
163*2016
Efficient computation of representative families with applications in parameterized and exact algorithms
FV Fomin, D Lokshtanov, F Panolan, S Saurabh
Journal of the ACM (JACM) 63 (4), 29, 2016
151*2016
Planar F-deletion: Approximation, kernelization and optimal FPT algorithms
FV Fomin, D Lokshtanov, N Misra, S Saurabh
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 470-479, 2012
1422012
On problems as hard as CNF-SAT
M Cygan, H Dell, D Lokshtanov, D Marx, J Nederlof, Y Okamoto, R Paturi, ...
ACM Transactions on Algorithms (TALG) 12 (3), 41, 2016
1392016
Faster parameterized algorithms using linear programming
D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ...
ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014
132*2014
Known algorithms on graphs of bounded treewidth are probably optimal
D Lokshtanov, D Marx, S Saurabh
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
1312011
Kernel (s) for problems with no kernel: On out-trees with many leaves
D Binkele-Raible, H Fernau, FV Fomin, D Lokshtanov, S Saurabh, ...
ACM Transactions on Algorithms (TALG) 8 (4), 38, 2012
127*2012
Graph layout problems parameterized by vertex cover
MR Fellows, D Lokshtanov, N Misra, FA Rosamond, S Saurabh
International Symposium on Algorithms and Computation, 294-305, 2008
1162008
On the complexity of some colorful problems parameterized by treewidth
MR Fellows, FV Fomin, D Lokshtanov, F Rosamond, S Saurabh, ...
Information and Computation 209 (2), 143-153, 2011
112*2011
On two techniques of combining branching and treewidth
FV Fomin, S Gaspers, S Saurabh, AA Stepanov
Algorithmica 54 (2), 181-207, 2009
108*2009
Parameterized algorithms for feedback set problems and their duals in tournaments
V Raman, S Saurabh
Theoretical Computer Science 351 (3), 446-458, 2006
102*2006
Faster fixed parameter tractable algorithms for finding feedback vertex sets
V Raman, S Saurabh, CR Subramanian
ACM Transactions on Algorithms (TALG) 2 (3), 403-415, 2006
99*2006
Intractability of clique-width parameterizations
FV Fomin, PA Golovach, D Lokshtanov, S Saurabh
SIAM Journal on Computing 39 (5), 1941-1956, 2010
98*2010
Fast fast
N Alon, D Lokshtanov, S Saurabh
International Colloquium on Automata, Languages, and Programming, 49-58, 2009
982009
Slightly superexponential parameterized problems
D Lokshtanov, D Marx, S Saurabh
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
832011
Bidimensionality and EPTAS
FV Fomin, D Lokshtanov, V Raman, S Saurabh
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
792011
The system can't perform the operation now. Try again later.
Articles 1–20