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 covering Z-grid points by rectangles | 2016-07-01 | Paper |
| XSAT and NAE-SAT of linear CNF classes Discrete Applied Mathematics | 2014-03-27 | Paper |
| Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation Discrete Applied Mathematics | 2012-10-19 | Paper |
| A satisfiability-based approach for embedding generalized tanglegrams on level graphs Theory and Applications of Satisfiability Testing - SAT 2011 | 2011-06-17 | Paper |
| Complexity Results for Linear XSAT-Problems Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
| On rectangular covering problems International Journal of Computational Geometry & Applications | 2010-02-01 | Paper |
| Theory and Applications of Satisfiability Testing Lecture Notes in Computer Science | 2009-07-24 | Paper |
| On Some Aspects of Mixed Horn Formulas Lecture Notes in Computer Science | 2009-07-07 | Paper |
| Linear CNF formulas and satisfiability Discrete Applied Mathematics | 2009-06-30 | Paper |
| Algorithms for Variable-Weighted 2-SAT and Dual Problems Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
| On Some SAT-Variants over Linear Formulas Lecture Notes in Computer Science | 2009-02-03 | Paper |
| Algorithms for Rectangular Covering Problems Computational Science and Its Applications - ICCSA 2006 | 2009-01-27 | Paper |
| A CNF Class Generalizing Exact Linear Formulas Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
| A CNF Formula Hierarchy over the Hypercube AI 2007: Advances in Artificial Intelligence | 2008-05-06 | Paper |
| On variable-weighted exact satisfiability problems Annals of Mathematics and Artificial Intelligence | 2007-12-03 | Paper |
| On Linear CNF Formulas Lecture Notes in Computer Science | 2007-09-04 | Paper |
| Computational Science and Its Applications – ICCSA 2004 Lecture Notes in Computer Science | 2007-07-19 | Paper |
| Satisfiability of mixed Horn formulas Discrete Applied Mathematics | 2007-07-19 | Paper |
| Counting All Solutions of Minimum Weight Exact Satisfiability Lecture Notes in Computer Science | 2007-05-02 | Paper |
| On generalizations of the shadow independent set problem Discrete Mathematics | 2007-04-26 | Paper |
| Algorithms and Computation Lecture Notes in Computer Science | 2006-11-14 | Paper |
| Theory and Applications of Satisfiability Testing Lecture Notes in Computer Science | 2005-12-16 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science Lecture Notes in Computer Science | 2005-12-07 | Paper |
| Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) Annals of Mathematics and Artificial Intelligence | 2005-05-13 | Paper |
| Improving a fixed parameter tractability time bound for the shadow problem Journal of Computer and System Sciences | 2004-08-19 | Paper |
Research outcomes over time
This page was built for person: Stefan Porschen
