( en | de | ru )

 

Disambiguation of "Szeider, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
Parameterized Complexity and Kernel Bounds for Hard Planning Problems.

, , , and . CIAC, volume 7878 of Lecture Notes in Computer Science, page 13-24. Springer, (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.

Stefan Schwärzler

Graphische Modelle im natürlichsprachlichen Mensch-Maschine-Dialog. TU München, (2010)

Stefan Weiß

Deformation quantization of principal fibre bundles and classical gauge theories. Uni Freiburg, (2009)

Stefan Reisbacher

Funktionelle Analyse von Cryptochrom 3 aus Arabidopsis thaliana. Uni Marburg, (2009)

Stefan Fröhlich

Modellbasierte Fehlererkennung und Diagnose in Echtzeit am Beispiel einer Brennstoffzelle. Uni Kassel, (2009)

Stefan Tripmaker

Verhältnis und Abgrenzung zwischen Steuerhinterziehung und Betrug. Bucerius Law School Hamburg, (2007)
 

Other publications of authors with the same name

Algorithms and complexity results for persuasive argumentation., , and . Artif. Intell., 175 (9-10): 1722-1736 (2011)Model Counting for CNF Formulas of Bounded Modular Treewidth., , and . Algorithmica, 76 (1): 168-194 (2016)Preface., , , and . J. Discrete Algorithms, 6 (4): 539 (2008)Solving MAX-r-SAT Above a Tight Lower Bound., , , , and . SODA, page 511-517. SIAM, (2010)On Existential MSO and its Relation to ETH., , , and . MFCS, volume 58 of LIPIcs, page 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Short Q-Resolution Proofs with Homomorphisms., , and . SAT, volume 12178 of Lecture Notes in Computer Science, page 412-428. Springer, (2020)Finding the Hardest Formulas for Resolution., and . CP, volume 12333 of Lecture Notes in Computer Science, page 514-530. Springer, (2020)Breaking Symmetries with RootClique and LexTopSort., , and . CP, volume 12333 of Lecture Notes in Computer Science, page 286-303. Springer, (2020)Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting., , and . CoRR, (2015)Guarantees and limits of preprocessing in constraint satisfaction and reasoning., and . Artif. Intell., (2014)