Some Further Approximation Algorithms for the Vertex Cover Problem. - Burkhard Monien; Ewald Speckenmeyer (CAAP, 1983)

Untersuchungen zum Feedback-vertex-set-Problem in ungerichteten Graphen. - Ewald Speckenmeyer (1983)

Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. - Burkhard Monien; Ewald Speckenmeyer (Acta Informatica, 1985)

Solving satisfiability in less than 2n steps. - Burkhard Monien; Ewald Speckenmeyer (Discret. Appl. Math., 1985)

On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem. - Ewald Speckenmeyer (CSL, 1987)

Superlinear Speedup for Parallel Backtracking. - Ewald Speckenmeyer; Burkhard Monien; Oliver Vornberger (ICS, 1987)

Is Average Superlinear Speedup Possible? - Ewald Speckenmeyer (CSL, 1988)

Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability. - Ewald Speckenmeyer (MFCS, 1988)

On feedback vertex sets and nonseparating independent sets in cubic graphs. - Ewald Speckenmeyer (J. Graph Theory, 1988)

On the Average Time Complexity of Set Partitioning. - Ewald Speckenmeyer; Rainer Kemp (CSL, 1989)

On Feedback Problems in Diagraphs. - Ewald Speckenmeyer (WG, 1989)

Parallele dynamische Spielbaumauswertung auf Transputern. - Max Böhm; Ewald Speckenmeyer (Transputer-Anwender-Treffen, 1990)

Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM. - Thomas Seifert; Ewald Speckenmeyer (Transputer-Anwender-Treffen, 1990)

Some Aspects of the Probabilistic Behavior of Variants of Resolution. - Peter Heusch; Ewald Speckenmeyer (CSL, 1991)

Ein paralleler SAT-Solver auf Transputern. - Max Böhm; Ewald Speckenmeyer (Transputer-Anwender-Treffen, 1992)

Zur Simulation von shared-memory auf Transputernetzwerken. - Thomas Seifert; Ewald Speckenmeyer (Transputer-Anwender-Treffen, 1992)

Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior. - John W. Rosenthal; Ewald Speckenmeyer; Rainer Kemp (Ann. Math. Artif. Intell., 1992)

On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solvers. - Ewald Speckenmeyer; Max Böhm; Peter Heusch (Satisfiability Problem: Theory and Applications, 1996)

A Fast Parallel SAT-Solver - Efficient Workload Balancing. - Max Böhm; Ewald Speckenmeyer (Ann. Math. Artif. Intell., 1996)

An Algorithm for the Class of Pure Implicational Formulas. - John V. Franco; Judy Goldsmith; John S. Schlipf; Ewald Speckenmeyer; Ramjee P. Swaminathan (Discret. Appl. Math., 1999)

A Satisfiability Formulation of Problems on Level Graphs. - Bert Randerath; Ewald Speckenmeyer; Endre Boros; Peter L. Hammer; Alexander Kogan; Kazuhisa Makino; Bruno Simeone; Ondrej Cepek (Electron. Notes Discret. Math., 2001)

On enumerating all minimal solutions of feedback problems. - Benno Schwikowski; Ewald Speckenmeyer (Discret. Appl. Math., 2002)

Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. - Stefan Porschen; Bert Randerath; Ewald Speckenmeyer (SAT, 2003)

Improving a fixed parameter tractability time bound for the shadow problem. - Peter Heusch; Stefan Porschen; Ewald Speckenmeyer (J. Comput. Syst. Sci., 2003)

Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. - Stefan Porschen; Ewald Speckenmeyer (SAT (Selected Papers, 2004)

Exact 3-satisfiability is decidable in time O(20.16254n). - Stefan Porschen; Bert Randerath; Ewald Speckenmeyer (Ann. Math. Artif. Intell., 2005)

On Linear CNF Formulas. - Stefan Porschen; Ewald Speckenmeyer; Bert Randerath (SAT, 2006)

Algorithms for Variable-Weighted 2-SAT and Dual Problems. - Stefan Porschen; Ewald Speckenmeyer (SAT, 2007)

Satisfiability of mixed Horn formulas. - Stefan Porschen; Ewald Speckenmeyer (Discret. Appl. Math., 2007)

A CNF Class Generalizing Exact Linear Formulas. - Stefan Porschen; Ewald Speckenmeyer (SAT, 2008)

Guest Editors Conclusion. - Ewald Speckenmeyer; Armando Tacchella; Vasco Manquinho; Chu Min Li 001 (J. Satisf. Boolean Model. Comput., 2008)

On Some Aspects of Mixed Horn Formulas. - Stefan Porschen; Tatjana Schmidt; Ewald Speckenmeyer (SAT, 2009)

Linear CNF formulas and satisfiability. - Stefan Porschen; Ewald Speckenmeyer; Xishun Zhao (Discret. Appl. Math., 2009)

Complexity Results for Linear XSAT-Problems. - Stefan Porschen; Tatjana Schmidt; Ewald Speckenmeyer (SAT, 2010)

A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs. - Ewald Speckenmeyer; Andreas Wotzlaw; Stefan Porschen (SAT, 2011)

Agent-based Modeling and Simulation of a Pastoralnomadic Land Use System. - Patrick Kuckertz; Oliver Ullrich; Anja Linstädter; Ewald Speckenmeyer (Simul. Notes Eur., 2011)

Dynamic Distributed Simulation of DEVS Models on the OSGi Service. - Martin Petzold; Oliver Ullrich; Ewald Speckenmeyer (Simul. Notes Eur., 2011)

Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation. - Andreas Wotzlaw; Ewald Speckenmeyer; Stefan Porschen (Discret. Appl. Math., 2012)

Modeling Time Table based Tram Traffic. - Daniel Lückerath; Oliver Ullrich; Ewald Speckenmeyer (Simul. Notes Eur., 2012)

Simulation and Optimization of Cologne's Tram Schedule. - Oliver Ullrich; Sebastian Franz; Ewald Speckenmeyer; Daniel Lückerath (Simul. Notes Eur., 2012)

Effectiveness of pre- and inprocessing for CDCL-based SAT solving. - Andreas Wotzlaw; Alexander van der Grinten; Ewald Speckenmeyer (CoRR, 2013)

Probabilistic Analysis of Random Mixed Horn Formulas. - Andreas Wotzlaw; Ewald Speckenmeyer; Stefan Porschen (ISAIM, 2014)

XSAT and NAE-SAT of linear CNF classes. - Stefan Porschen; Tatjana Schmidt; Ewald Speckenmeyer; Andreas Wotzlaw (Discret. Appl. Math., 2014)

Model-based Parallelization of Discrete Traffic Simulation Models. - Oliver Ullrich; Daniel Lückerath; Ewald Speckenmeyer (Simul. Notes Eur., 2014)

A Robust Schedule for Montpellier's Tramway Network. - Oliver Ullrich; Daniel Lückerath; Ewald Speckenmeyer (Simul. Notes Eur., 2015)

Do regular timetables help to reduce delays in tram networks? It depends! - Oliver Ullrich; Daniel Lückerath; Ewald Speckenmeyer (Public Transp., 2016)

A disjunctive program formulation to generate regular public transit timetables adhering to prioritized planning requirements. - Daniel Lückerath; Oliver Ullrich; Naphtali Rishe; Ewald Speckenmeyer (Networks, 2018)

A Mesoscopic Bus Transit Simulation Model based on Scarce Data. - Daniel Lückerath; Ewald Speckenmeyer; Oliver Ullrich; Naphtali Rishe (Simul. Notes Eur., 2018)

Let's Build a Tunnel! - A Closer Look at Cologne's New Subway Routes. - Oliver Ullrich; Daniel Lückerath; Naphtali Rishe; Ewald Speckenmeyer (Simul. Notes Eur., 2018)