( en | de | ru )

 

Disambiguation of "Szeider, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381).

, , , and . Dagstuhl Reports, 7 (9): 62-85 (2017)

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

Stefan Kutter

Molekularer Aufbau und Translokationsmechanismus des Cag-Typ-IV-Sekretionssystems von Helicobacter pylori. Uni München, (2009)
 

Other publications of authors with the same name

On Theorems Equivalent with Kotzig's Result on Graphs with Unique 1-Factors.. Ars Comb., (2004)Guarantees and limits of preprocessing in constraint satisfaction and reasoning., and . Artif. Intell., (2014)Circuit Treewidth, Sentential Decision, and Query Compilation., and . PODS, page 233-246. ACM, (2017)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)Matched Formulas and Backdoor Sets.. SAT, volume 4501 of Lecture Notes in Computer Science, page 94-99. Springer, (2007)Detecting Backdoor Sets with Respect to Horn and Binary Clauses., , and . SAT, (2004)Constraint Satisfaction with Bounded Treewidth Revisited., and . CP, volume 4204 of Lecture Notes in Computer Science, page 499-513. Springer, (2006)Short Q-Resolution Proofs with Homomorphisms., , and . SAT, volume 12178 of Lecture Notes in Computer Science, page 412-428. Springer, (2020)The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT.. SAT, volume 5584 of Lecture Notes in Computer Science, page 276-283. Springer, (2009)A SAT Approach to Clique-Width., and . SAT, volume 7962 of Lecture Notes in Computer Science, page 318-334. Springer, (2013)