( en | de | ru )

 

Disambiguation of "Ordyniak, Sebastian"

Author of the publication

copydeleteadd this publication to your clipboard
Backdoors to q-Horn.

, , , , and . STACS, volume 20 of LIPIcs, page 67-79. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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. You can also use the button next to the name to display some publications already assigned to the person.

Raimund Ordyniak

Karin Ordyniak

Sebastian Baum

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

Sebastian Reick

Internal and external dynamics of a strongly-coupled atom-cavity system. Uni Bonn, (2009)

Sebastian Korff

Untersuchung von Marker-Genen bei Mikrosatelliten-instabilen Tumoren und Entwicklung eines Computer-Verfahrens zur Hochdurchsatzanalyse von Fragmentanalysen aus humanen Mikrosatelliten-instabilen Tumoren. Uni Heidelberg, (2009)
 

Other publications of authors with the same name

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