Stefan Porschen

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