List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| On the distributivity of LTL specifications ACM Transactions on Computational Logic | 2015-09-17 | Paper |
| A backtracking-based algorithm for hypertree decomposition ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
| Tractable cases of the extended global cardinality constraint Constraints | 2011-04-06 | Paper |
| Algorithms for propositional model counting Journal of Discrete Algorithms | 2010-02-26 | Paper |
| Constraint satisfaction with bounded treewidth revisited Journal of Computer and System Sciences | 2010-02-12 | Paper |
| Backdoor sets of quantified Boolean formulas Journal of Automated Reasoning | 2009-11-25 | Paper |
| Encoding Treewidth into SAT Lecture Notes in Computer Science | 2009-07-07 | Paper |
| Backdoor Sets of Quantified Boolean Formulas Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
| Variable Dependencies of Quantified CSPs Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
| Constraint Satisfaction with Bounded Treewidth Revisited Principles and Practice of Constraint Programming - CP 2006 | 2008-09-09 | Paper |
| On the Notion of Vacuous Truth Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
| Algorithms for Propositional Model Counting Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
| Computer Science Logic Lecture Notes in Computer Science | 2007-06-21 | Paper |
| Graph-Theoretic Concepts in Computer Science Lecture Notes in Computer Science | 2006-11-01 | Paper |
| Formal Methods in Computer-Aided Design Lecture Notes in Computer Science | 2006-10-20 | Paper |
| Automata, Languages and Programming Lecture Notes in Computer Science | 2005-08-24 | Paper |
Research outcomes over time
This page was built for person: Marko Samer