( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints.

, , , , , и . ICALP, том 297 из LIPIcs, стр. 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.

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)
 

Другие публикации лиц с тем же именем

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