( en | de | ru )

 

Disambiguation of "Lokshtanov, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints.

, , , , , and . ICALP, volume 297 of LIPIcs, page 88:1-88:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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

A 2ℓk Kernel for ℓ-Component Order Connectivity., and . CoRR, (2016)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)Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time., , , , and . STOC, page 330-341. ACM, (2021)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)Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems., , , , and . APPROX-RANDOM, volume 116 of LIPIcs, page 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number., , , and . LATIN, volume 12118 of Lecture Notes in Computer Science, page 600-612. Springer, (2020)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)