Følg
Daniel Lokshtanov
Daniel Lokshtanov
Professor of Computer Science, UCSB
Verifisert e-postadresse på ucsb.edu - Startside
Tittel
Sitert av
Sitert av
År
Parameterized algorithms
M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ...
Springer 5 (4), 16, 2015
20992015
Lower bounds based on the Exponential Time Hypothesis.
D Lokshtanov, D Marx, S Saurabh
Bulletin of the EATCS no 105, 41-71, 2011
3422011
A 5-Approximation Algorithm for Treewidth
HL Bodlaender, PG Drange, MS Dregi, FV Fomin, D Lokshtanov, ...
SIAM Journal on Computing 45 (2), 317-378, 2016
3112016
Kernelization lower bounds through colors and IDs
M Dom, D Lokshtanov, S Saurabh
ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014
289*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
238*2016
Bidimensionality and kernels
FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
2112010
Kernelization: theory of parameterized preprocessing
FV Fomin, D Lokshtanov, S Saurabh, M Zehavi
Cambridge University Press, 2019
2102019
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
2062016
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
1982012
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
197*2018
(Meta) kernelization
HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ...
Journal of the ACM (JACM) 63 (5), 1-69, 2016
1672016
Faster parameterized algorithms using linear programming
D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ...
ACM Transactions on Algorithms (TALG) 11 (2), 1-31, 2014
1652014
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
1502008
On the complexity of some colorful problems parameterized by treewidth
MR Fellows, FV Fomin, D Lokshtanov, F Rosamond, S Saurabh, ...
Information and Computation, 2010
1492010
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
148*2012
Treewidth governs the complexity of target set selection
O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman
Discrete Optimization 8 (1), 87-96, 2011
148*2011
Slightly superexponential parameterized problems
D Lokshtanov, D Marx, S Saurabh
SIAM Journal on Computing 47 (3), 675-702, 2018
132*2018
Independent Set in P5-Free Graphs in Polynomial Time
D Lokshantov, M Vatshelle, Y Villanger
Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete …, 2014
1322014
Intractability of clique-width parameterizations
FV Fomin, PA Golovach, D Lokshtanov, S Saurabh
SIAM Journal on Computing 39 (5), 1941-1956, 2010
132*2010
Fast FAST
N Alon, D Lokshtanov, S Saurabh
International colloquium on automata, languages, and programming, 49-58, 2009
1172009
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20