( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Faster Exact Algorithms for Some Terminal Set Problems.

, , , , , и . IPEC, том 8246 из Lecture Notes in Computer Science, стр. 150-162. Springer, (2013)

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 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)
 

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

On the Complexity of Computing Treelength.. MFCS, том 4708 из Lecture Notes in Computer Science, стр. 276-287. Springer, (2007)Algorithmic Lower Bounds for Problems on Decomposable Graphs.. MFCS, том 6281 из Lecture Notes in Computer Science, стр. 37. Springer, (2010)Reducing CMSO Model Checking to Highly Connected Graphs., , , и . ICALP, том 107 из LIPIcs, стр. 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , и . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)Shortest Cycles with Monotone Submodular Costs., , , , и . ACM Trans. Algorithms, 20 (1): 2:1-2:16 (января 2024)Local search: Is brute-force avoidable?, , , , , и . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)A 2ℓk Kernel for ℓ-Component Order Connectivity., и . CoRR, (2016)Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time., и . WG, том 3787 из Lecture Notes in Computer Science, стр. 187-198. Springer, (2005)On the Hardness of Losing Width., , , , и . Theory Comput. Syst., 54 (1): 73-82 (2014)On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number., , , и . LATIN, том 12118 из Lecture Notes in Computer Science, стр. 600-612. Springer, (2020)