( en | de | ru )

 

Disambiguation of "Hermelin, Danny"

Author of the publication

copydeleteadd this publication to your clipboard
Scheduling Lower Bounds via AND Subset Sum.

, , , and . ICALP, volume 168 of LIPIcs, page 4:1-4:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Miia Hermelin

Danny Bachfeld

Analyse des Hygienestatus im Zentrum für Zahn-, Mund- und Kieferheilkunde der Universität Greifswald, ergänzt durch eine experimentelle Studie zur Wirkung von Guanidinthiocyanat auf Nickel-Titan-Instrumente. Uni Greifswald, (2009)

Danny Bot

Danny Schulze

Danny Bartholome

 

Other publications of authors with the same name

Restricted LCS., , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 250-257. Springer, (2010)On Computing Centroids According to the p-Norms of Hamming Distance Vectors., , and . ESA, volume 144 of LIPIcs, page 28:1-28:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)An exact almost optimal algorithm for target set selection in social networks., , , and . EC, page 355-362. ACM, (2009)Domination When the Stars Are Out, , , and . CoRR, (2010)Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs., , , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 340-351. Springer, (2007)Constrained LCS: Hardness and Approximation., , and . CPM, volume 5029 of Lecture Notes in Computer Science, page 255-262. Springer, (2008)Weak Compositions and Their Applications to Polynomial Lower-Bounds for Kernelization., and . Electron. Colloquium Comput. Complex., (2011)On the parameterized complexity of multiple-interval graph problems., , , and . Theor. Comput. Sci., 410 (1): 53-61 (2009)Faster Minimization of Tardy Processing Time on a Single Machine., , , , and . ICALP, volume 168 of LIPIcs, page 19:1-19:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Tight Kernel Bounds for Problems on Graphs with Small Degeneracy - (Extended Abstract)., , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 361-372. Springer, (2013)