On Covering Z-Grid Points by Rectangles. - Stefan Porschen (Electron. Notes Discret. Math., 2001)

Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. - Stefan Porschen; Bert Randerath; Ewald Speckenmeyer (SAT, 2003)

Improving a fixed parameter tractability time bound for the shadow problem. - Peter Heusch; Stefan Porschen; Ewald Speckenmeyer (J. Comput. Syst. Sci., 2003)

On the Time Complexity of Rectangular Covering Problems in the Discrete Plane. - Stefan Porschen (ICCSA (3), 2004)

Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. - Stefan Porschen; Ewald Speckenmeyer (SAT (Selected Papers, 2004)

On the Rectangular Subset Closure of Point Sets. - Stefan Porschen (ICCSA (1), 2005)

Solving Minimum Weight Exact Satisfiability in Time O(20.2441n). - Stefan Porschen (ISAAC, 2005)

On Some Weighted Satisfiability and Graph Problems. - Stefan Porschen (SOFSEM, 2005)

Exact 3-satisfiability is decidable in time O(20.16254n). - Stefan Porschen; Bert Randerath; Ewald Speckenmeyer (Ann. Math. Artif. Intell., 2005)

Counting All Solutions of Minimum Weight Exact Satisfiability. - Stefan Porschen (CIAC, 2006)

Algorithms for Rectangular Covering Problems. - Stefan Porschen (ICCSA (1), 2006)

On Linear CNF Formulas. - Stefan Porschen; Ewald Speckenmeyer; Bert Randerath (SAT, 2006)

A CNF Formula Hierarchy over the Hypercube. - Stefan Porschen (Australian Conference on Artificial Intelligence, 2007)

Optimal Parameterized Rectangular Coverings. - Stefan Porschen (ICCSA (1), 2007)

Algorithms for Variable-Weighted 2-SAT and Dual Problems. - Stefan Porschen; Ewald Speckenmeyer (SAT, 2007)

On variable-weighted exact satisfiability problems. - Stefan Porschen (Ann. Math. Artif. Intell., 2007)

Satisfiability of mixed Horn formulas. - Stefan Porschen; Ewald Speckenmeyer (Discret. Appl. Math., 2007)

On generalizations of the shadow independent set problem. - Stefan Porschen (Discret. Math., 2007)

A CNF Class Generalizing Exact Linear Formulas. - Stefan Porschen; Ewald Speckenmeyer (SAT, 2008)

On Some Aspects of Mixed Horn Formulas. - Stefan Porschen; Tatjana Schmidt; Ewald Speckenmeyer (SAT, 2009)

On Some SAT-Variants over Linear Formulas. - Stefan Porschen; Tatjana Schmidt (SOFSEM, 2009)

Linear CNF formulas and satisfiability. - Stefan Porschen; Ewald Speckenmeyer; Xishun Zhao (Discret. Appl. Math., 2009)

On Rectangular Covering Problems. - Stefan Porschen (Int. J. Comput. Geom. Appl., 2009)

Complexity Results for Linear XSAT-Problems. - Stefan Porschen; Tatjana Schmidt; Ewald Speckenmeyer (SAT, 2010)

A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs. - Ewald Speckenmeyer; Andreas Wotzlaw; Stefan Porschen (SAT, 2011)

Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation. - Andreas Wotzlaw; Ewald Speckenmeyer; Stefan Porschen (Discret. Appl. Math., 2012)

Probabilistic Analysis of Random Mixed Horn Formulas. - Andreas Wotzlaw; Ewald Speckenmeyer; Stefan Porschen (ISAIM, 2014)

XSAT and NAE-SAT of linear CNF classes. - Stefan Porschen; Tatjana Schmidt; Ewald Speckenmeyer; Andreas Wotzlaw (Discret. Appl. Math., 2014)