zum Inhalt springen

Publikationen zwischen 1980 und 1989

1989

  • Speckenmeyer, Ewald: Is Average Superlinear Speedup Possible? In: Proceedings of Computer Science Logic 1988 (CSL '88), Springer Verlag (LNCS 385), 1989, pp. 301-312.
  • Speckenmeyer, Ewald: On Feedback Problems in Digraphs. In: Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science WG '89 (Castle Rolduc, The Netherlands, June 1989), Springer-Verlag, LNCS 411, Nagel, M. (Ed.), 1989, pp. 218-231.

1988

  • Speckenmeyer, Ewald: Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact Satisfiablity. In: Proceedings of 13th Conference of Mathematical Foundations of Computer Science 1988 (MFCS '88), Springer Verlag (LNCS 324), 1988, pp. 529-537.
  • Speckenmeyer, Ewald: On Feedback Vertex Sets and Nonseparating Independent Sets in Cubic Graphs. In: Journal of Graph Theory, Volume 12, Number 3, 1988, pp. 405-412.
  • Speckenmeyer, Ewald: On the Average Case Behavior of Backtracking for the Satisfiability and Exact Satisfiability Problem. Habilitationsschrift, Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 50, 1988.

1987

  • Speckenmeyer, E.; Monien, B.; Vornberger, O.: Superlinear Speedup for Parallel Backtracking. In: Proceedings of Supercomputing 1987 (ICS '87), Springer Verlag (LNCS 292), 1987, pp. 985-993.
  • Speckenmeyer, Ewald: On the Average Case Complexity of Backtracking for the Exact Satisfiability Problem. In: Proceedings of Computer Science Logic 1987 (CSL '87), Springer Verlag (LNCS 329), 1987, pp. 281-288, full version in: Forschungsbericht Nr. 244/1987, Abt. Informatik, Universität Dortmund.

1986

  • Speckenmeyer, Ewald: Bounds of Feedback Vertex Sets of Undirected Cubic Graphs. In: Colloquia Mathematica Societatis Janos Bolyai, 42. Algebra, Combinatorics and Logic in Computer Science 1983 in Györ (Hungary), pp. 719-729.

1985

  • Monien, B.; Speckenmeyer, E.: Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. In: Acta Informatica, Volume 22, Number 1, 1985, pp. 115-123.
  • Monien, B.; Speckenmeyer, E.: Solving Satisfiability in Less than 2^n. In: Discrete Applied Mathematics, North-Holland Publishing Company, Volume 10, Number 3, 1985, pp. 287-295.

1984

  • Monien, B.; Speckenmeyer, E.: Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. In: Proceedings of International Frege Conference 1984, Akademie-Verlag, 1984, pp. 345-353.

1983

  • Monien, B.; Speckenmeyer, E.: Some Further Approximation Algorithms for the Vertex Cover Problem. In: Proceedings of 8th Coll. on Trees in Algebra and Programming (CAAP '83),Springer Verlag (LNCS 159), Goos, G.; Hartmanis, J. (Ed.), 1983, pp. 341-349.
  • Speckenmeyer, Ewald: Untersuchungen zum Feedback Vertex Set Problem in ungerichteten Graphen. Doktorarbeit, Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 16, 1983.

1982

  • Monien, B.; Speckenmeyer, E.; Vornberger, O.: Upper Bounds for Covering Problems. In: Methods of Operations Research, Volume 43, 1982, pp. 341-349.

1980

  • Monien, B.; Speckenmeyer, E.; Vornberger, O.: Upper Bounds for Covering Problems (full version). Universität-GH Paderborn, Reihe Informatik, Bericht Nr. 7, 1980.