| 2008 |
|---|
| 19 | EE | Stefan Porschen,
Ewald Speckenmeyer:
A CNF Class Generalizing Exact Linear Formulas.
SAT 2008: 231-245 |
| 2007 |
|---|
| 18 | EE | Stefan Porschen:
A CNF Formula Hierarchy over the Hypercube.
Australian Conference on Artificial Intelligence 2007: 234-243 |
| 17 | EE | Stefan Porschen:
Optimal Parameterized Rectangular Coverings.
ICCSA (1) 2007: 96-109 |
| 16 | EE | Stefan Porschen,
Ewald Speckenmeyer:
Algorithms for Variable-Weighted 2-SAT and Dual Problems.
SAT 2007: 173-186 |
| 15 | EE | Stefan Porschen:
On variable-weighted exact satisfiability problems.
Ann. Math. Artif. Intell. 51(1): 27-54 (2007) |
| 14 | EE | Stefan Porschen,
Ewald Speckenmeyer:
Satisfiability of mixed Horn formulas.
Discrete Applied Mathematics 155(11): 1408-1419 (2007) |
| 13 | EE | Stefan Porschen:
On generalizations of the shadow independent set problem.
Discrete Mathematics 307(11-12): 1473-1485 (2007) |
| 2006 |
|---|
| 12 | EE | Stefan Porschen:
Counting All Solutions of Minimum Weight Exact Satisfiability.
CIAC 2006: 50-59 |
| 11 | EE | Stefan Porschen:
Algorithms for Rectangular Covering Problems.
ICCSA (1) 2006: 40-49 |
| 10 | EE | Stefan Porschen,
Ewald Speckenmeyer,
Bert Randerath:
On Linear CNF Formulas.
SAT 2006: 212-225 |
| 2005 |
|---|
| 9 | EE | Stefan Porschen:
On the Rectangular Subset Closure of Point Sets.
ICCSA (1) 2005: 796-805 |
| 8 | EE | Stefan Porschen:
Solving Minimum Weight Exact Satisfiability in Time O(20.2441n).
ISAAC 2005: 654-664 |
| 7 | EE | Stefan Porschen:
On Some Weighted Satisfiability and Graph Problems.
SOFSEM 2005: 278-287 |
| 6 | EE | Stefan Porschen,
Bert Randerath,
Ewald Speckenmeyer:
Exact 3-satisfiability is decidable in time O(20.16254n).
Ann. Math. Artif. Intell. 43(1): 173-193 (2005) |
| 2004 |
|---|
| 5 | EE | Stefan Porschen:
On the Time Complexity of Rectangular Covering Problems in the Discrete Plane.
ICCSA (3) 2004: 137-146 |
| 4 | EE | Stefan Porschen,
Ewald Speckenmeyer:
Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems.
SAT 2004 |
| 3 | EE | Stefan Porschen,
Ewald Speckenmeyer:
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.
SAT (Selected Papers 2004: 251-262 |
| 2003 |
|---|
| 2 | EE | Stefan Porschen,
Bert Randerath,
Ewald Speckenmeyer:
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems.
SAT 2003: 172-187 |
| 1 | EE | Peter Heusch,
Stefan Porschen,
Ewald Speckenmeyer:
Improving a fixed parameter tractability time bound for the shadow problem.
J. Comput. Syst. Sci. 67(4): 772-788 (2003) |
