( 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 Dirkmann

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

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)
 

Other publications of authors with the same name

A 2ℓk Kernel for ℓ-Component Order Connectivity., and . CoRR, (2016)Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time., and . WG, volume 3787 of Lecture Notes in Computer Science, page 187-198. Springer, (2005)Even Faster Algorithm for Set Splitting!, and . IWPEC, volume 5917 of Lecture Notes in Computer Science, page 288-299. Springer, (2009)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)Subexponential-Time Algorithms for Maximum Independent Set in $$P_t$$ P t -Free and Broom-Free Graphs., , , , , and . Algorithmica, 81 (2): 421-438 (2019)Graph Classes with Few Minimal Separators. II. A Dichotomy., and . SODA, page 3098-3178. SIAM, (2023)FPT-approximation for FPT Problems., , , , and . SODA, page 199-218. SIAM, (2021)Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version)., , and . SODA, page 179-198. SIAM, (2021)Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract)., , , , and . SODA, page 2005-2031. SIAM, (2022)