Ewald Speckenmeyer

50 papers A 9B 6Misc 1Journal 26Unranked 7

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