Ewald Speckenmeyer

According to our database, Ewald Speckenmeyer authored at least 49 papers between 1983 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

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

A Mesoscopic Bus Transit Simulation Model based on Scarce Data.

Daniel Lückerath, Ewald Speckenmeyer, Oliver Ullrich, Naphtali Rishe

Simul. Notes Eur., 2018

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

2016

Do regular timetables help to reduce delays in tram networks? It depends!

Oliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer

Public Transp., 2016

2015

A Robust Schedule for Montpellier's Tramway Network.

Oliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer

Simul. Notes Eur., 2015

2014

Model-based Parallelization of Discrete Traffic Simulation Models.

Oliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer

Simul. Notes Eur., 2014

XSAT and NAE-SAT of linear CNF classes.

Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer, Andreas Wotzlaw

Discret. Appl. Math., 2014

Probabilistic Analysis of Random Mixed Horn Formulas.

Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

2013

Effectiveness of pre- and inprocessing for CDCL-based SAT solving.

Andreas Wotzlaw, Alexander van der Grinten, Ewald Speckenmeyer

CoRR, 2013

2012

Simulation and Optimization of Cologne's Tram Schedule.

Oliver Ullrich, Sebastian Franz, Ewald Speckenmeyer, Daniel Lückerath

Simul. Notes Eur., 2012

Modeling Time Table based Tram Traffic.

Daniel Lückerath, Oliver Ullrich, Ewald Speckenmeyer

Simul. Notes Eur., 2012

Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation.

Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen

Discret. Appl. Math., 2012

2011

Dynamic Distributed Simulation of DEVS Models on the OSGi Service.

Martin Petzold, Oliver Ullrich, Ewald Speckenmeyer

Simul. Notes Eur., 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

A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs.

Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

2010

Complexity Results for Linear XSAT-Problems.

Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

2009

Linear CNF formulas and satisfiability.

Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao

Discret. Appl. Math., 2009

On Some Aspects of Mixed Horn Formulas.

Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

Guest Editors Conclusion.

Ewald Speckenmeyer, Armando Tacchella, Vasco M. Manquinho, Chu Min Li

J. Satisf. Boolean Model. Comput., 2008

A CNF Class Generalizing Exact Linear Formulas.

Stefan Porschen, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

2007

Satisfiability of mixed Horn formulas.

Stefan Porschen, Ewald Speckenmeyer

Discret. Appl. Math., 2007

Algorithms for Variable-Weighted 2-SAT and Dual Problems.

Stefan Porschen, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006

On Linear CNF Formulas.

Stefan Porschen, Ewald Speckenmeyer, Bert Randerath

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

2005

Exact 3-satisfiability is decidable in time O(2^{0.16254<i>n</i>}).

Stefan Porschen, Bert Randerath, Ewald Speckenmeyer

Ann. Math. Artif. Intell., 2005

2004

Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.

Stefan Porschen, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2004

2003

Improving a fixed parameter tractability time bound for the shadow problem.

Peter Heusch, Stefan Porschen, Ewald Speckenmeyer

J. Comput. Syst. Sci., 2003

Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems.

Stefan Porschen, Bert Randerath, Ewald Speckenmeyer

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002

On enumerating all minimal solutions of feedback problems.

Benno Schwikowski, Ewald Speckenmeyer

Discret. Appl. Math., 2002

2001

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

1999

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

1996

A Fast Parallel SAT-Solver - Efficient Workload Balancing.

Max Böhm, Ewald Speckenmeyer

Ann. Math. Artif. Intell., 1996

On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solvers.

Ewald Speckenmeyer, Max Böhm, Peter Heusch

Proceedings of the Satisfiability Problem: Theory and Applications, 1996

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

Zur Simulation von shared-memory auf Transputernetzwerken.

Thomas Seifert, Ewald Speckenmeyer

Proceedings of the Parallele Datenverarbeitung mit dem Transputer, 1992

Ein paralleler SAT-Solver auf Transputern.

Max Böhm, Ewald Speckenmeyer

Proceedings of the Parallele Datenverarbeitung mit dem Transputer, 1992

1991

Some Aspects of the Probabilistic Behavior of Variants of Resolution.

Peter Heusch, Ewald Speckenmeyer

Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990

Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM.

Thomas Seifert, Ewald Speckenmeyer

Proceedings of the Parallele Datenverarbeitung mit dem Transputer, 1990

Parallele dynamische Spielbaumauswertung auf Transputern.

Max Böhm, Ewald Speckenmeyer

Proceedings of the Parallele Datenverarbeitung mit dem Transputer, 1990

1989

On Feedback Problems in Diagraphs.

Ewald Speckenmeyer

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

On the Average Time Complexity of Set Partitioning.

Ewald Speckenmeyer, Rainer Kemp

Proceedings of the CSL '89, 1989

1988

On feedback vertex sets and nonseparating independent sets in cubic graphs.

Ewald Speckenmeyer

J. Graph Theory, 1988

Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability.

Ewald Speckenmeyer

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Is Average Superlinear Speedup Possible?

Ewald Speckenmeyer

Proceedings of the CSL '88, 1988

1987

Superlinear Speedup for Parallel Backtracking.

Ewald Speckenmeyer, Burkhard Monien, Oliver Vornberger

Proceedings of the Supercomputing, 1987

On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem.

Ewald Speckenmeyer

Proceedings of the CSL '87, 1987

1985

Solving satisfiability in less than 2ⁿ steps.

Burkhard Monien, Ewald Speckenmeyer

Discret. Appl. Math., 1985

Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem.

Burkhard Monien, Ewald Speckenmeyer

Acta Informatica, 1985

1983

Untersuchungen zum Feedback-vertex-set-Problem in ungerichteten Graphen.

Ewald Speckenmeyer

PhD thesis, 1983

Some Further Approximation Algorithms for the Vertex Cover Problem.

Burkhard Monien, Ewald Speckenmeyer

Proceedings of the CAAP'83, 1983