( 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 . CoRR, (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

Parameterized Low-distortion Embeddings - Graph metrics into lines and trees, , , , , and . CoRR, (2008)Bidimensionality and EPTAS, , , and . CoRR, (2010)Below all subsets for Minimal Connected Dominating Set., , and . CoRR, (2016)Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs, , , and . CoRR, (2012)A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments., , , , , and . CoRR, (2018)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)Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms., , , and . J. ACM, 63 (4): 29:1-29:60 (2016)Representative Families of Product Families., , , and . ACM Trans. Algorithms, 13 (3): 36:1-36:29 (2017)On the Complexity of Computing Treelength.. MFCS, volume 4708 of Lecture Notes in Computer Science, page 276-287. Springer, (2007)