( en | de | ru )

 

Disambiguation of "Ordyniak, Sebastian"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity Landscape of Connected f-Factor Problems.

, , , , and . Algorithmica, 81 (6): 2606-2632 (2019)

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

On Structural Parameterizations of the Edge Disjoint Paths Problem., , and . CoRR, (2017)The Power of Cut-Based Parameters for Computing Edge Disjoint Paths., and . CoRR, (2018)CSP beyond tractable constraint languages., , and . Constraints An Int. J., 28 (3): 450-471 (September 2023)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)Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics., , and . J. Artif. Intell. Res., (2021)Tree-depth and vertex-minors., , , and . Eur. J. Comb., (2016)Backdoors into heterogeneous classes of SAT and CSP., , , , and . J. Comput. Syst. Sci., (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)An Algorithmic Framework for Locally Constrained Homomorphisms., , , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 114-128. Springer, (2022)