( en | de | ru )

 

Disambiguation of "Ordyniak, Sebastian"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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 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)
 

Other publications of authors with the same name

Parameterized Complexity and Kernel Bounds for Hard Planning Problems., , , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 13-24. Springer, (2013)Integer Programming and Incidence Treedepth., , , , , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 194-204. Springer, (2019)Towards a Polynomial Kernel for Directed Feedback Vertex Set., , , , and . MFCS, volume 83 of LIPIcs, page 36:1-36:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)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)Going Beyond Primal Treewidth for (M)ILP., , and . AAAI, page 815-821. AAAI Press, (2017)Variable-Deletion Backdoors to Planning., , and . AAAI, page 3305-3312. AAAI Press, (2015)Don't Be Strict in Local Search!, , , , and . AAAI, page 486-492. AAAI Press, (2012)Algorithms and Complexity Results for Persuasive Argumentation., , and . COMMA, volume 216 of Frontiers in Artificial Intelligence and Applications, page 311-322. IOS Press, (2010)An Algorithmic Framework for Locally Constrained Homomorphisms., , , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 114-128. Springer, (2022)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)