| 2008 |
| 28 | EE | Stefan Porschen,
Ewald Speckenmeyer:
A CNF Class Generalizing Exact Linear Formulas.
SAT 2008: 231-245 |
| 27 | EE | Ewald Speckenmeyer,
Armando Tacchella,
Vasco Manquinho,
Chu Min Li:
Guest Editors Conclusion.
JSAT 4(2-4): (2008) |
| 2007 |
| 26 | EE | Stefan Porschen,
Ewald Speckenmeyer:
Algorithms for Variable-Weighted 2-SAT and Dual Problems.
SAT 2007: 173-186 |
| 25 | EE | Stefan Porschen,
Ewald Speckenmeyer:
Satisfiability of mixed Horn formulas.
Discrete Applied Mathematics 155(11): 1408-1419 (2007) |
| 2006 |
| 24 | EE | Stefan Porschen,
Ewald Speckenmeyer,
Bert Randerath:
On Linear CNF Formulas.
SAT 2006: 212-225 |
| 2005 |
| 23 | 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 |
| 22 | EE | Stefan Porschen,
Ewald Speckenmeyer:
Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems.
SAT 2004 |
| 21 | EE | Stefan Porschen,
Ewald Speckenmeyer:
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.
SAT (Selected Papers 2004: 251-262 |
| 2003 |
| 20 | EE | Stefan Porschen,
Bert Randerath,
Ewald Speckenmeyer:
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems.
SAT 2003: 172-187 |
| 19 | 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) |
| 2002 |
| 18 | | Benno Schwikowski,
Ewald Speckenmeyer:
On enumerating all minimal solutions of feedback problems.
Discrete Applied Mathematics 117(1-3): 253-265 (2002) |
| 2001 |
| 17 | EE | Bert Randerath,
Ewald Speckenmeyer,
Endre Boros,
Peter L. Hammer,
Alexander Kogan,
Kazuhisa Makino,
Bruno Simeone,
Ondrej Cepek:
A Satisfiability Formulation of Problems on Level Graphs.
Electronic Notes in Discrete Mathematics 9: 269-277 (2001) |
| 1999 |
| 16 | EE | John V. Franco,
Judy Goldsmith,
John S. Schlipf,
Ewald Speckenmeyer,
Ramjee P. Swaminathan:
An Algorithm for the Class of Pure Implicational Formulas.
Discrete Applied Mathematics 96-97: 89-106 (1999) |
| 1996 |
| 15 | | Max Böhm,
Ewald Speckenmeyer:
A Fast Parallel SAT-Solver - Efficient Workload Balancing.
Ann. Math. Artif. Intell. 17(3-4): 381-400 (1996) |
| 1992 |
| 14 | | Max Böhm,
Ewald Speckenmeyer:
Ein paralleler SAT-Solver auf Transputern.
Transputer-Anwender-Treffen 1992: 235-244 |
| 13 | | Thomas Seifert,
Ewald Speckenmeyer:
Zur Simulation von shared-memory auf Transputernetzwerken.
Transputer-Anwender-Treffen 1992: 51-60 |
| 12 | | John W. Rosenthal,
Ewald Speckenmeyer,
Rainer Kemp:
Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior.
Ann. Math. Artif. Intell. 6(1-3): 185-200 (1992) |
| 1991 |
| 11 | | Peter Heusch,
Ewald Speckenmeyer:
Some Aspects of the Probabilistic Behavior of Variants of Resolution.
CSL 1991: 164-172 |
| 1990 |
| 10 | | Thomas Seifert,
Ewald Speckenmeyer:
Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM.
Transputer-Anwender-Treffen 1990: 103-110 |
| 9 | | Max Böhm,
Ewald Speckenmeyer:
Parallele dynamische Spielbaumauswertung auf Transputern.
Transputer-Anwender-Treffen 1990: 80-87 |
| 1989 |
| 8 | | Ewald Speckenmeyer,
Rainer Kemp:
On the Average Time Complexity of Set Partitioning.
CSL 1989: 369-381 |
| 7 | | Ewald Speckenmeyer:
On Feedback Problems in Diagraphs.
WG 1989: 218-231 |
| 1988 |
| 6 | | Ewald Speckenmeyer:
Is Average Superlinear Speedup Possible?
CSL 1988: 301-312 |
| 5 | | Ewald Speckenmeyer:
Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability.
MFCS 1988: 529-538 |
| 1987 |
| 4 | | Ewald Speckenmeyer:
On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem.
CSL 1987: 281-288 |
| 3 | | Ewald Speckenmeyer,
Burkhard Monien,
Oliver Vornberger:
Superlinear Speedup for Parallel Backtracking.
ICS 1987: 985-993 |
| 1985 |
| 2 | | Burkhard Monien,
Ewald Speckenmeyer:
Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem.
Acta Inf. 22(1): 115-123 (1985) |
| 1983 |
| 1 | | Burkhard Monien,
Ewald Speckenmeyer:
Some Further Approximation Algorithms for the Vertex Cover Problem.
CAAP 1983: 341-349 |