( en | de | ru )

 

Disambiguation of "Lokshtanov, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
Balanced Judicious Bipartition is Fixed-Parameter Tractable.

, , , and . FSTTCS, volume 93 of LIPIcs, page 40:40-40:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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 Wied

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

Daniel Dirkmann

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

Other publications of authors with the same name

Even Faster Algorithm for Set Splitting!, and . IWPEC, volume 5917 of Lecture Notes in Computer Science, page 288-299. Springer, (2009)Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time., and . WG, volume 3787 of Lecture Notes in Computer Science, page 187-198. Springer, (2005)Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs., , , , , and . Algorithmica, 81 (2): 421-438 (2019)Algorithmic Lower Bounds for Problems on Decomposable Graphs.. MFCS, volume 6281 of Lecture Notes in Computer Science, page 37. Springer, (2010)On the Complexity of Computing Treelength.. MFCS, volume 4708 of Lecture Notes in Computer Science, page 276-287. Springer, (2007)Reducing CMSO Model Checking to Highly Connected Graphs., , , and . ICALP, volume 107 of LIPIcs, page 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Lower Bounds for Approximation Schemes for Closest String., , , , and . SWAT, volume 53 of LIPIcs, page 12:1-12:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Shortest Cycles with Monotone Submodular Costs., , , , and . ACM Trans. Algorithms, 20 (1): 2:1-2:16 (January 2024)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , and . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)On the Hardness of Losing Width., , , , and . Theory Comput. Syst., 54 (1): 73-82 (2014)