Saket Saurabh
Saket Saurabh
Professor at Institute of Mathematical Sciences
Geverifieerd e-mailadres voor imsc.res.in
Titel
Geciteerd door
Geciteerd door
Jaar
Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Springer 5 (4), 16, 2015
15292015
Lower bounds based on the exponential time hypothesis
D Lokshtanov, D Marx, S Saurabh
Bulletin of EATCS 3 (105), 2013
2992013
Kernelization lower bounds through colors and IDs
M Dom, D Lokshtanov, S Saurabh
ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014
261*2014
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), 1-60, 2016
204*2016
Bidimensionality and kernels
FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
2022010
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), 1-24, 2016
1772016
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
1692012
Faster parameterized algorithms using linear programming
D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ...
ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014
156*2014
(Meta) Kernelization
HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ...
Journal of the ACM (JACM) 63 (5), 44, 2016
1552016
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
1422011
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), 1-19, 2012
135*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
1292008
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
126*2011
Intractability of clique-width parameterizations
FV Fomin, PA Golovach, D Lokshtanov, S Saurabh
SIAM Journal on Computing 39 (5), 1941-1956, 2010
119*2010
On two techniques of combining branching and treewidth
FV Fomin, S Gaspers, S Saurabh, AA Stepanov
Algorithmica 54 (2), 181-207, 2009
118*2009
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
114*2006
Slightly superexponential parameterized problems
D Lokshtanov, D Marx, S Saurabh
SIAM Journal on Computing 47 (3), 675-702, 2018
113*2018
Fast fast
N Alon, D Lokshtanov, S Saurabh
International Colloquium on Automata, Languages, and Programming, 49-58, 2009
1082009
Parameterized algorithms for feedback set problems and their duals in tournaments
V Raman, S Saurabh
Theoretical Computer Science 351 (3), 446-458, 2006
108*2006
Kernelization: theory of parameterized preprocessing
FV Fomin, D Lokshtanov, S Saurabh, M Zehavi
Cambridge University Press, 2019
1052019
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20