Stefan Porschen

Available identifiers

zbMath Open porschen.stefanMaRDI QIDQ714019

List of research outcomes

Publication	Date of Publication	Type
On covering \(\mathbb Z\)-grid points by rectangles	2016-07-01	Paper
XSAT and NAE-SAT of linear CNF classes	2014-03-27	Paper
Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation	2012-10-19	Paper
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs	2011-06-17	Paper
Complexity Results for Linear XSAT-Problems	2010-09-29	Paper
ON RECTANGULAR COVERING PROBLEMS	2010-02-01	Paper
Theory and Applications of Satisfiability Testing	2009-07-24	Paper
On Some Aspects of Mixed Horn Formulas	2009-07-07	Paper
Linear CNF formulas and satisfiability	2009-06-30	Paper
Algorithms for Variable-Weighted 2-SAT and Dual Problems	2009-03-10	Paper
On Some SAT-Variants over Linear Formulas	2009-02-03	Paper
Algorithms for Rectangular Covering Problems	2009-01-27	Paper
A CNF Class Generalizing Exact Linear Formulas	2008-05-27	Paper
A CNF Formula Hierarchy over the Hypercube	2008-05-06	Paper
On variable-weighted exact satisfiability problems	2007-12-03	Paper
On Linear CNF Formulas	2007-09-04	Paper
Satisfiability of mixed Horn formulas	2007-07-19	Paper
Computational Science and Its Applications – ICCSA 2004	2007-07-19	Paper
Counting All Solutions of Minimum Weight Exact Satisfiability	2007-05-02	Paper
On generalizations of the shadow independent set problem	2007-04-26	Paper
Algorithms and Computation	2006-11-14	Paper
Theory and Applications of Satisfiability Testing	2005-12-16	Paper
SOFSEM 2005: Theory and Practice of Computer Science	2005-12-07	Paper
Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\)	2005-05-13	Paper
Improving a fixed parameter tractability time bound for the shadow problem	2004-08-19	Paper

Research outcomes over time

This page was built for person: Stefan Porschen