( en | de | ru )

 

Disambiguation of "Lokshtanov, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
2-Approximating Feedback Vertex Set in Tournaments.

, , , , , and . ACM Trans. Algorithms, 17 (2): 11:1-11:14 (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Daniel

Daniel

Daniel Stanze

Systematische Analyse von Rezeptoren und Effektormechanismen der pulmonalen angeborenen Immunität. Uni Marburg, (2009)

Daniel Dirkmann

In-vitro-Untersuchungen zum Effekt von Hypothermie und Azidose auf Variablen thrombelastometrischer Messungen der Blutgerinnung. Uni Duisburg-Essen, (2009)

Daniel Wied

Zivilprozessuale Qualifikationsprobleme im Spannungsfeld von Vertrag und Delikt: ein Beitrag zur Auslegung nationalen Zivilprozessrechts in europäischer Perspektive. Uni Regensburg, (2009)
 

Other publications of authors with the same name

A 2ℓk Kernel for ℓ-Component Order Connectivity., and . CoRR, (2016)Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs., , , , , and . Algorithmica, 81 (2): 421-438 (2019)On the Complexity of Computing Treelength.. MFCS, volume 4708 of Lecture Notes in Computer Science, page 276-287. Springer, (2007)Algorithmic Lower Bounds for Problems on Decomposable Graphs.. MFCS, volume 6281 of Lecture Notes in Computer Science, page 37. Springer, (2010)Picking Random Vertices (Invited Talk).. MFCS, volume 138 of LIPIcs, page 3:1-3:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time., and . WG, volume 3787 of Lecture Notes in Computer Science, page 187-198. Springer, (2005)A 2lk Kernel for l-Component Order Connectivity., and . IPEC, volume 63 of LIPIcs, page 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments., and . STACS, volume 47 of LIPIcs, page 49:1-49:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Hardness of Losing Width., , , , and . Theory Comput. Syst., 54 (1): 73-82 (2014)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , and . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)