Ewald Speckenmeyer

Publication Activity (10 Years)

Years Active: 1983-2018
Publications (10 Years): 4

Top Venues

Simul. Notes Eur.

Discret. Appl. Math.

CoRR

Public Transp.

University of Paderborn, Germany (PHD)

Education History

University of Paderborn, Germany

PHD

Publications

Oliver Ullrich, Daniel Lückerath, Naphtali Rishe, Ewald Speckenmeyer
Let's Build a Tunnel! - A Closer Look at Cologne's New Subway Routes. Simul. Notes Eur. 28 (1) (2018)
Daniel Lückerath, Ewald Speckenmeyer, Oliver Ullrich, Naphtali Rishe
A Mesoscopic Bus Transit Simulation Model based on Scarce Data. Simul. Notes Eur. 28 (1) (2018)
Daniel Lückerath, Oliver Ullrich, Naphtali Rishe, Ewald Speckenmeyer
A disjunctive program formulation to generate regular public transit timetables adhering to prioritized planning requirements. Networks 72 (2) (2018)
Oliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer
Do regular timetables help to reduce delays in tram networks? It depends! Public Transp. 8 (1) (2016)
Oliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer
A Robust Schedule for Montpellier's Tramway Network. Simul. Notes Eur. 25 (1) (2015)
Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer, Andreas Wotzlaw
XSAT and NAE-SAT of linear CNF classes. Discret. Appl. Math. 167 (2014)
Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen
Probabilistic Analysis of Random Mixed Horn Formulas. ISAIM (2014)
Oliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer
Model-based Parallelization of Discrete Traffic Simulation Models. Simul. Notes Eur. 24 (3-4) (2014)
Andreas Wotzlaw, Alexander van der Grinten, Ewald Speckenmeyer
Effectiveness of pre- and inprocessing for CDCL-based SAT solving. CoRR (2013)
Oliver Ullrich, Sebastian Franz, Ewald Speckenmeyer, Daniel Lückerath
Simulation and Optimization of Cologne's Tram Schedule. Simul. Notes Eur. 22 (2) (2012)
Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen
Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation. Discret. Appl. Math. 160 (16-17) (2012)
Daniel Lückerath, Oliver Ullrich, Ewald Speckenmeyer
Modeling Time Table based Tram Traffic. Simul. Notes Eur. 22 (2) (2012)
Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs. SAT (2011)
Patrick Kuckertz, Oliver Ullrich, Anja Linstädter, Ewald Speckenmeyer
Agent-based Modeling and Simulation of a Pastoralnomadic Land Use System. Simul. Notes Eur. 21 (3-4) (2011)
Martin Petzold, Oliver Ullrich, Ewald Speckenmeyer
Dynamic Distributed Simulation of DEVS Models on the OSGi Service. Simul. Notes Eur. 21 (3-4) (2011)
Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer
Complexity Results for Linear XSAT-Problems. SAT (2010)
Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer
On Some Aspects of Mixed Horn Formulas. SAT (2009)
Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao
Linear CNF formulas and satisfiability. Discret. Appl. Math. 157 (5) (2009)
Ewald Speckenmeyer, Armando Tacchella, Vasco M. Manquinho, Chu Min Li
Guest Editors Conclusion. J. Satisf. Boolean Model. Comput. 4 (2-4) (2008)
Stefan Porschen, Ewald Speckenmeyer
A CNF Class Generalizing Exact Linear Formulas. SAT (2008)
Stefan Porschen, Ewald Speckenmeyer
Satisfiability of mixed Horn formulas. Discret. Appl. Math. 155 (11) (2007)
Stefan Porschen, Ewald Speckenmeyer
Algorithms for Variable-Weighted 2-SAT and Dual Problems. SAT (2007)
Stefan Porschen, Ewald Speckenmeyer, Bert Randerath
On Linear CNF Formulas. SAT (2006)
Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
). Ann. Math. Artif. Intell. 43 (1) (2005)
Stefan Porschen, Ewald Speckenmeyer
Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. SAT (2004)
Stefan Porschen, Ewald Speckenmeyer
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. SAT (Selected Papers (2004)
Peter Heusch, Stefan Porschen, Ewald Speckenmeyer
Improving a fixed parameter tractability time bound for the shadow problem. J. Comput. Syst. Sci. 67 (4) (2003)
Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. SAT (2003)
Benno Schwikowski, Ewald Speckenmeyer
On enumerating all minimal solutions of feedback problems. Discret. Appl. Math. 117 (1-3) (2002)
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. Electron. Notes Discret. Math. 9 (2001)
John V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan
An Algorithm for the Class of Pure Implicational Formulas. Discret. Appl. Math. (1999)
Ewald Speckenmeyer, Max Böhm, Peter Heusch
On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solvers. Satisfiability Problem: Theory and Applications (1996)
Max Böhm, Ewald Speckenmeyer
A Fast Parallel SAT-Solver - Efficient Workload Balancing. Ann. Math. Artif. Intell. 17 (3-4) (1996)
Thomas Seifert, Ewald Speckenmeyer
Zur Simulation von shared-memory auf Transputernetzwerken. Transputer-Anwender-Treffen (1992)
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) (1992)
Max Böhm, Ewald Speckenmeyer
Ein paralleler SAT-Solver auf Transputern. Transputer-Anwender-Treffen (1992)
Peter Heusch, Ewald Speckenmeyer
Some Aspects of the Probabilistic Behavior of Variants of Resolution. CSL (1991)
Max Böhm, Ewald Speckenmeyer
Parallele dynamische Spielbaumauswertung auf Transputern. Transputer-Anwender-Treffen (1990)
Thomas Seifert, Ewald Speckenmeyer
Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM. Transputer-Anwender-Treffen (1990)
Ewald Speckenmeyer
On Feedback Problems in Diagraphs. WG (1989)
Ewald Speckenmeyer, Rainer Kemp
On the Average Time Complexity of Set Partitioning. CSL (1989)
Ewald Speckenmeyer
On feedback vertex sets and nonseparating independent sets in cubic graphs. J. Graph Theory 12 (3) (1988)
Ewald Speckenmeyer
Is Average Superlinear Speedup Possible? CSL (1988)
Ewald Speckenmeyer
Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability. MFCS (1988)
Ewald Speckenmeyer, Burkhard Monien, Oliver Vornberger
Superlinear Speedup for Parallel Backtracking. ICS (1987)
Ewald Speckenmeyer
On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem. CSL (1987)
Burkhard Monien, Ewald Speckenmeyer
Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. Acta Informatica 22 (1) (1985)
Burkhard Monien, Ewald Speckenmeyer
steps. Discret. Appl. Math. 10 (3) (1985)
Burkhard Monien, Ewald Speckenmeyer
Some Further Approximation Algorithms for the Vertex Cover Problem. CAAP (1983)

Ewald Speckenmeyer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ewald Speckenmeyer