( en | de | ru )

 

Disambiguation of "Ordyniak, Sebastian"

Author of the publication

copydeleteadd this publication to your clipboard
Upper and Lower Bounds for Weak Backdoor Set Detection

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

The Power of Cut-Based Parameters for Computing Edge Disjoint Paths., and . CoRR, (2018)Parameterized Complexity and Kernel Bounds for Hard Planning Problems., , , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 13-24. Springer, (2013)Parameterized Pre-coloring Extension and List Coloring Problems., , , and . CoRR, (2019)On Structural Parameterizations of the Edge Disjoint Paths Problem., , and . CoRR, (2017)Backdoors into heterogeneous classes of SAT and CSP., , , , and . J. Comput. Syst. Sci., (2017)Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics., , and . J. Artif. Intell. Res., (2021)Tree-depth and vertex-minors., , , and . Eur. J. Comb., (2016)CSP beyond tractable constraint languages., , and . Constraints An Int. J., 28 (3): 450-471 (September 2023)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)Algorithms and Complexity Results for Persuasive Argumentation., , and . COMMA, volume 216 of Frontiers in Artificial Intelligence and Applications, page 311-322. IOS Press, (2010)