( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.

, , и . STACS, том 96 из LIPIcs, стр. 33:1-33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

Raimund Ordyniak

Karin Ordyniak

Sebastian Baum

Optimierung der Pharmakotherapie von geriatrischen Patienten im stationären Bereich durch pharmazeutische Betreuung. Uni Münster, (2009)

Sebastian Birk

Intercalibration of national methods to assess the ecological quality of rivers in Europe using benthic invertebrates and aquatic flora. Uni Duisburg-Essen, (2009)

Sebastian Stange

Market liquidity risk. TU München, (2009)
 

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

Parameterized Complexity and Kernel Bounds for Hard Planning Problems., , , и . CIAC, том 7878 из Lecture Notes in Computer Science, стр. 13-24. Springer, (2013)Parameterized Complexity of Small Decision Tree Learning., и . AAAI, стр. 6454-6462. AAAI Press, (2021)The Parameterized Complexity of Clustering Incomplete Data., , , , и . AAAI, стр. 7296-7304. AAAI Press, (2021)Variable-Deletion Backdoors to Planning., , и . AAAI, стр. 3305-3312. AAAI Press, (2015)The Complexity of Object Association in Multiple Object Tracking., , и . AAAI, стр. 1388-1396. AAAI Press, (2021)Don't Be Strict in Local Search!, , , , и . AAAI, стр. 486-492. AAAI Press, (2012)Going Beyond Primal Treewidth for (M)ILP., , и . AAAI, стр. 815-821. AAAI Press, (2017)Algorithms and Complexity Results for Persuasive Argumentation., , и . COMMA, том 216 из Frontiers in Artificial Intelligence and Applications, стр. 311-322. IOS Press, (2010)An Algorithmic Framework for Locally Constrained Homomorphisms., , , , и . WG, том 13453 из Lecture Notes in Computer Science, стр. 114-128. Springer, (2022)Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors., , и . CP, том 210 из LIPIcs, стр. 32:1-32:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)