Stefan Porschen

Publication Activity (10 Years)

Years Active: 2001-2014
Publications (10 Years): 0

Top Topics

Propositional Satisfiability

Stochastic Local Search

Top Venues

Discret. Appl. Math.

Publications

Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer, Andreas Wotzlaw
XSAT and NAE-SAT of linear CNF classes. Discret. Appl. Math. 167 (2014)
Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen
Probabilistic Analysis of Random Mixed Horn Formulas. ISAIM (2014)
Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen
Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation. Discret. Appl. Math. 160 (16-17) (2012)
Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs. SAT (2011)
Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer
Complexity Results for Linear XSAT-Problems. SAT (2010)
Stefan Porschen, Tatjana Schmidt
On Some SAT-Variants over Linear Formulas. SOFSEM (2009)
Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer
On Some Aspects of Mixed Horn Formulas. SAT (2009)
Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao
Linear CNF formulas and satisfiability. Discret. Appl. Math. 157 (5) (2009)
Stefan Porschen
On Rectangular Covering Problems. Int. J. Comput. Geom. Appl. 19 (4) (2009)
Stefan Porschen, Ewald Speckenmeyer
A CNF Class Generalizing Exact Linear Formulas. SAT (2008)
Stefan Porschen
Optimal Parameterized Rectangular Coverings. ICCSA (1) (2007)
Stefan Porschen
On variable-weighted exact satisfiability problems. Ann. Math. Artif. Intell. 51 (1) (2007)
Stefan Porschen, Ewald Speckenmeyer
Satisfiability of mixed Horn formulas. Discret. Appl. Math. 155 (11) (2007)
Stefan Porschen, Ewald Speckenmeyer
Algorithms for Variable-Weighted 2-SAT and Dual Problems. SAT (2007)
Stefan Porschen
On generalizations of the shadow independent set problem. Discret. Math. 307 (11-12) (2007)
Stefan Porschen
A CNF Formula Hierarchy over the Hypercube. Australian Conference on Artificial Intelligence (2007)
Stefan Porschen
Algorithms for Rectangular Covering Problems. ICCSA (1) (2006)
Stefan Porschen, Ewald Speckenmeyer, Bert Randerath
On Linear CNF Formulas. SAT (2006)
Stefan Porschen
Counting All Solutions of Minimum Weight Exact Satisfiability. CIAC (2006)
Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
). Ann. Math. Artif. Intell. 43 (1) (2005)
Stefan Porschen
On the Rectangular Subset Closure of Point Sets. ICCSA (1) (2005)
Stefan Porschen
On Some Weighted Satisfiability and Graph Problems. SOFSEM (2005)
Stefan Porschen
). ISAAC (2005)
Stefan Porschen, Ewald Speckenmeyer
Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. SAT (2004)
Stefan Porschen, Ewald Speckenmeyer
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. SAT (Selected Papers (2004)
Stefan Porschen
On the Time Complexity of Rectangular Covering Problems in the Discrete Plane. ICCSA (3) (2004)
Peter Heusch, Stefan Porschen, Ewald Speckenmeyer
Improving a fixed parameter tractability time bound for the shadow problem. J. Comput. Syst. Sci. 67 (4) (2003)
Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. SAT (2003)
Stefan Porschen
On Covering Z-Grid Points by Rectangles. Electron. Notes Discret. Math. 8 (2001)