| 2014 | ISAIM | Probabilistic Analysis of Random Mixed Horn Formulas. | Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen |
| 2011 | SAT | A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs. | Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen |
| 2010 | SAT | Complexity Results for Linear XSAT-Problems. | Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer |
| 2009 | SAT | On Some Aspects of Mixed Horn Formulas. | Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer |
| 2009 | SOFSEM | On Some SAT-Variants over Linear Formulas. | Stefan Porschen, Tatjana Schmidt |
| 2008 | SAT | A CNF Class Generalizing Exact Linear Formulas. | Stefan Porschen, Ewald Speckenmeyer |
| 2007 | ICCSA | Optimal Parameterized Rectangular Coverings. | Stefan Porschen |
| 2007 | SAT | Algorithms for Variable-Weighted 2-SAT and Dual Problems. | Stefan Porschen, Ewald Speckenmeyer |
| 2006 | CIAC | Counting All Solutions of Minimum Weight Exact Satisfiability. | Stefan Porschen |
| 2006 | ICCSA | Algorithms for Rectangular Covering Problems. | Stefan Porschen |
| 2006 | SAT | On Linear CNF Formulas. | Stefan Porschen, Ewald Speckenmeyer, Bert Randerath |
| 2005 | ICCSA | On the Rectangular Subset Closure of Point Sets. | Stefan Porschen |
| 2005 | ISAAC | Solving Minimum Weight Exact Satisfiability in Time | Stefan Porschen |
| 2005 | SOFSEM | On Some Weighted Satisfiability and Graph Problems. | Stefan Porschen |
| 2004 | ICCSA | On the Time Complexity of Rectangular Covering Problems in the Discrete Plane. | Stefan Porschen |
| 2004 | SAT | Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. | Stefan Porschen, Ewald Speckenmeyer |
| 2004 | SAT | Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. | Stefan Porschen, Ewald Speckenmeyer |
| 2003 | SAT | Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. | Stefan Porschen, Bert Randerath, Ewald Speckenmeyer |