Folgen
Saket Saurabh
Saket Saurabh
Professor at Institute of Mathematical Sciences
Bestätigte E-Mail-Adresse bei imsc.res.in
Titel
Zitiert von
Zitiert von
Jahr
Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Springer 5 (4), 16, 2015
31252015
Lower bounds based on the exponential-time hypothesis
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Parameterized Algorithms, 467-521, 2015
4132015
Kernelization: theory of parameterized preprocessing
FV Fomin, D Lokshtanov, S Saurabh, M Zehavi
Cambridge University Press, 2019
3612019
Kernelization lower bounds through colors and IDs
M Dom, D Lokshtanov, S Saurabh
ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014
329*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
308*2016
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
2572016
Known algorithms on graphs of bounded treewidth are probably optimal
D Lokshtanov, D Marx, S Saurabh
ACM Transactions on Algorithms (TALG) 14 (2), 1-30, 2018
256*2018
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
2392012
Bidimensionality and kernels
FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
2342010
Faster parameterized algorithms using linear programming
D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ...
ACM Transactions on Algorithms (TALG) 11 (2), 15, 2014
227*2014
(Meta) Kernelization
HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ...
Journal of the ACM (JACM) 63 (5), 44, 2016
1852016
Graph layout problems parameterized by vertex cover
MR Fellows, D Lokshtanov, N Misra, FA Rosamond, S Saurabh
Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold …, 2008
1762008
Slightly superexponential parameterized problems
D Lokshtanov, D Marx, S Saurabh
SIAM Journal on Computing 47 (3), 675-702, 2018
171*2018
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
166*2011
Intractability of clique-width parameterizations
FV Fomin, PA Golovach, D Lokshtanov, S Saurabh
SIAM Journal on Computing 39 (5), 1941-1956, 2010
156*2010
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
153*2012
On two techniques of combining branching and treewidth
FV Fomin, S Gaspers, S Saurabh, AA Stepanov
Algorithmica 54, 181-207, 2009
141*2009
Fast FAST
N Alon, D Lokshtanov, S Saurabh
International colloquium on automata, languages, and programming, 49-58, 2009
1292009
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
124*2006
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth
FV Fomin, D Lokshtanov, S Saurabh, M Pilipczuk, M Wrochna
ACM Transactions on Algorithms (TALG) 14 (3), 1-45, 2018
1202018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20