( en | de | ru )

 

Disambiguation of "Lokshtanov, Daniel"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Reconstructing H -free Graphs from Their Star Systems.

, , , , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 194-205. Springer, (2008)

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

Reducing CMSO Model Checking to Highly Connected Graphs., , , and . ICALP, volume 107 of LIPIcs, page 135:1-135:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Parameterized Complexity and Approximability of Directed Odd Cycle Transversal., , , and . CoRR, (2017)The Half-integral Erdös-Pósa Property for Non-null Cycles., , and . CoRR, (2017)Lossy Kernelization., , , and . CoRR, (2016)Kernelization, Bidimensionality and Kernels.. Encyclopedia of Algorithms, (2016)Sharp Separation and Applications to Exact and Parameterized Algorithms., , , and . Algorithmica, 63 (3): 692-706 (2012)Parameterized Complexity of Directed Steiner Tree on Sparse Graphs., , , , and . SIAM J. Discret. Math., 31 (2): 1294-1327 (2017)SeeSite: Characterizing Relationships between Splice Junctions and Splicing Enhancers., , , and . IEEE ACM Trans. Comput. Biol. Bioinform., 11 (4): 648-656 (2014)Shortest Cycles with Monotone Submodular Costs., , , , and . ACM Trans. Algorithms, 20 (1): 2:1-2:16 (January 2024)Local search: Is brute-force avoidable?, , , , , and . J. Comput. Syst. Sci., 78 (3): 707-719 (2012)