Daniel Lokshtanov

Cituota

	Visi	Nuo 2020
Šaltiniai	13628	7394
h-rodyklė	54	36
i10-rodyklė	166	132

1600

800

400

1200

2009201020112012201320142015201620172018201920202021202220232024202592 171 274 320 447 460 541 692 897 994 1083 1356 1198 1363 1456 1571 448

Viešas pasiekiamumas

Peržiūrėti viską

121 straipsnis

3 straipsniai

pasiekiami

nepasiekiami

Pagal finansavimo įpareigojimus

Bendraautoriai

Saket SaurabhProfessor at Institute of Mathematical SciencesPatvirtintas el. paštas imsc.res.in
Fedor V. FominProfessor of Computer Science, University of BergenPatvirtintas el. paštas uib.no
Meirav ZehaviBen-Gurion University of the NegevPatvirtintas el. paštas bgu.ac.il
Michał PilipczukUniversity of WarsawPatvirtintas el. paštas mimuw.edu.pl
Fahad PanolanSchool of Computing, University of LeedsPatvirtintas el. paštas leeds.ac.uk
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiPatvirtintas el. paštas mimuw.edu.pl
Ramanujan M. S.University of Warwick, UKPatvirtintas el. paštas warwick.ac.uk
Dániel MarxCISPA Helmholtz Center for Information SecurityPatvirtintas el. paštas cispa.saarland
Marek CyganUniversity of WarsawPatvirtintas el. paštas mimuw.edu.pl
Petr GolovachUniversity of BergenPatvirtintas el. paštas ii.uib.no
Pranabendu MisraAssistant Professor at Chennai Mathematical InstitutePatvirtintas el. paštas cmi.ac.in
Neeldhara MisraIndian Institute of Technology, GandhinagarPatvirtintas el. paštas iitgn.ac.in
Akanksha AgrawalIndian Institute of Technology MadrasPatvirtintas el. paštas cse.iitm.ac.in
Pinar HeggernesProfessor of computer science, University of BergenPatvirtintas el. paštas ii.uib.no
Venkatesh RamanProfessor, IMSc ChennaiPatvirtintas el. paštas imsc.res.in
Dimitrios M. ThilikosNational and Kapodistrian University of AthensPatvirtintas el. paštas thilikos.info
Michael FellowsResearch Professor LAU Beirut and NYC; Emeritus Prof. Univ. Bergen; Adjunct Prof. WSU AustraliaPatvirtintas el. paštas lau.edu.lb
Frances RosamondLebanese American University, Beirut and Western Sydney University, AustraliaPatvirtintas el. paštas lau.edu.lb
Yngve VillangerUniversity of BergenPatvirtintas el. paštas uib.no
Amer MouawadAmerican University of BeirutPatvirtintas el. paštas aub.edu.lb

Stebėti

Daniel Lokshtanov

Professor of Computer Science, UCSB

Patvirtintas el. paštas ucsb.edu - Pagrindinis puslapis

Algorithms Computational Complexity Graph Theory


Pavadinimas Rūšiuoti pagal šaltinius Rūšiuoti pagal metus Rūšiuoti pagal pavadinimą	Cituota Cituota	Metai
Parameterized algorithms M Cygan, FV Fomin, Ł Kowalik, D Lokshtanov, D Marx, M Pilipczuk, ... Springer 5 (4), 16, 2015	3164	2015
Lower bounds based on the Exponential Time Hypothesis. D Lokshtanov, D Marx, S Saurabh Bulletin of the EATCS no 105, 41-71, 2011	417*	2011
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	389	2016
Kernelization: theory of parameterized preprocessing FV Fomin, D Lokshtanov, S Saurabh, M Zehavi Cambridge University Press, 2019	366	2019
Kernelization lower bounds through colors and IDs M Dom, D Lokshtanov, S Saurabh ACM Transactions on Algorithms (TALG) 11 (2), 1-20, 2014	337*	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	318*	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	263	2016
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	261*	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	240	2012
Bidimensionality and kernels FV Fomin, D Lokshtanov, S Saurabh, DM Thilikos Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010	235	2010
Faster parameterized algorithms using linear programming D Lokshtanov, NS Narayanaswamy, V Raman, MS Ramanujan, ... ACM Transactions on Algorithms (TALG) 11 (2), 1-31, 2014	204	2014
(Meta) kernelization HL Bodlaender, FV Fomin, D Lokshtanov, E Penninkx, S Saurabh, ... Journal of the ACM (JACM) 63 (5), 1-69, 2016	186	2016
Treewidth governs the complexity of target set selection O Ben-Zwi, D Hermelin, D Lokshtanov, I Newman Discrete Optimization 8 (1), 87-96, 2011	182*	2011
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	179	2008
Slightly superexponential parameterized problems D Lokshtanov, D Marx, S Saurabh SIAM Journal on Computing 47 (3), 675-702, 2018	173	2018
On the complexity of some colorful problems parameterized by treewidth MR Fellows, FV Fomin, D Lokshtanov, F Rosamond, S Saurabh, ... Information and Computation, 2010	169	2010
Independent Set in P₅-Free Graphs in Polynomial Time D Lokshantov, M Vatshelle, Y Villanger Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete …, 2014	166	2014
Intractability of clique-width parameterizations FV Fomin, PA Golovach, D Lokshtanov, S Saurabh SIAM Journal on Computing 39 (5), 1941-1956, 2010	159*	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	155*	2012
Fast FAST N Alon, D Lokshtanov, S Saurabh International colloquium on automata, languages, and programming, 49-58, 2009	131	2009

Sistema negali atlikti operacijos. Bandykite vėliau dar kartą.

Straipsniai 1–20

Šaltinių per metus

Dubliuoti šaltiniai

Sujungti šaltiniai

Pridėti bendraautoriusBendraautoriai

Stebėti

Cituota

Bendraautoriai