( en | de | ru )

 

Disambiguation of "Szeider, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
On finding optimal polytrees.

, , , , and . Theor. Comput. Sci., (2015)

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

Model Checking Existential Logic on Partially Ordered Sets., , and . ACM Trans. Comput. Log., 17 (2): 10 (2016)A SAT Approach to Branchwidth., , and . ACM Trans. Comput. Log., 20 (3): 15:1-15:24 (2019)Algorithms and complexity results for persuasive argumentation., , and . Artif. Intell., 175 (9-10): 1722-1736 (2011)Preface., , , and . J. Discrete Algorithms, 6 (4): 539 (2008)On finding short resolution refutations and small unsatisfiable subsets., , and . Theor. Comput. Sci., 351 (3): 351-359 (2006)Computing unsatisfiable k-SAT instances with few occurrences per variable., and . Theor. Comput. Sci., 337 (1-3): 347-359 (2005)On the parameterized complexity of clustering problems for incomplete data., , , , and . J. Comput. Syst. Sci., (June 2023)Model Counting for CNF Formulas of Bounded Modular Treewidth., , and . Algorithmica, 76 (1): 168-194 (2016)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)