default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEwald Speckenmeyer
Person information
- affiliation: University of Cologne, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j25]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): 217-237 (2018)- [j24]Daniel Lückerath, Ewald Speckenmeyer, Oliver Ullrich, Naphtali Rishe:
A Mesoscopic Bus Transit Simulation Model based on Scarce Data. Simul. Notes Eur. 28(1): 1-10 (2018) - [j23]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): 19-26 (2018) - 2016
- [j22]Oliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer:
Do regular timetables help to reduce delays in tram networks? It depends! Public Transp. 8(1): 39-56 (2016) - 2015
- [j21]Oliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer:
A Robust Schedule for Montpellier's Tramway Network. Simul. Notes Eur. 25(1): 1-8 (2015) - 2014
- [j20]Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer, Andreas Wotzlaw:
XSAT and NAE-SAT of linear CNF classes. Discret. Appl. Math. 167: 1-14 (2014) - [j19]Oliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer:
Model-based Parallelization of Discrete Traffic Simulation Models. Simul. Notes Eur. 24(3-4): 115-122 (2014) - [c23]Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen:
Probabilistic Analysis of Random Mixed Horn Formulas. ISAIM 2014 - 2013
- [i1]Andreas Wotzlaw, Alexander van der Grinten, Ewald Speckenmeyer:
Effectiveness of pre- and inprocessing for CDCL-based SAT solving. CoRR abs/1310.4756 (2013) - 2012
- [j18]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): 2349-2363 (2012) - [j17]Daniel Lückerath, Oliver Ullrich, Ewald Speckenmeyer:
Modeling Time Table based Tram Traffic. Simul. Notes Eur. 22(2): 61-68 (2012) - [j16]Oliver Ullrich, Sebastian Franz, Ewald Speckenmeyer, Daniel Lückerath:
Simulation and Optimization of Cologne's Tram Schedule. Simul. Notes Eur. 22(2): 69-76 (2012) - 2011
- [j15]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): 147-152 (2011) - [j14]Martin Petzold, Oliver Ullrich, Ewald Speckenmeyer:
Dynamic Distributed Simulation of DEVS Models on the OSGi Service. Simul. Notes Eur. 21(3-4): 159-164 (2011) - [c22]Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen:
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs. SAT 2011: 134-144 - 2010
- [c21]Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer:
Complexity Results for Linear XSAT-Problems. SAT 2010: 251-263
2000 – 2009
- 2009
- [j13]Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao:
Linear CNF formulas and satisfiability. Discret. Appl. Math. 157(5): 1046-1068 (2009) - [c20]Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer:
On Some Aspects of Mixed Horn Formulas. SAT 2009: 86-100 - 2008
- [j12]Ewald Speckenmeyer, Armando Tacchella, Vasco Manquinho, Chu Min Li:
Guest Editors Conclusion. J. Satisf. Boolean Model. Comput. 4(2-4) (2008) - [c19]Stefan Porschen, Ewald Speckenmeyer:
A CNF Class Generalizing Exact Linear Formulas. SAT 2008: 231-245 - 2007
- [j11]Stefan Porschen, Ewald Speckenmeyer:
Satisfiability of mixed Horn formulas. Discret. Appl. Math. 155(11): 1408-1419 (2007) - [c18]Stefan Porschen, Ewald Speckenmeyer:
Algorithms for Variable-Weighted 2-SAT and Dual Problems. SAT 2007: 173-186 - 2006
- [c17]Stefan Porschen, Ewald Speckenmeyer, Bert Randerath:
On Linear CNF Formulas. SAT 2006: 212-225 - 2005
- [j10]Stefan Porschen, Bert Randerath, Ewald Speckenmeyer:
Exact 3-satisfiability is decidable in time O(20.16254n). Ann. Math. Artif. Intell. 43(1): 173-193 (2005) - 2004
- [c16]Stefan Porschen, Ewald Speckenmeyer:
Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. SAT 2004 - [c15]Stefan Porschen, Ewald Speckenmeyer:
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. SAT (Selected Papers 2004: 251-262 - 2003
- [j9]Peter Heusch, Stefan Porschen, Ewald Speckenmeyer:
Improving a fixed parameter tractability time bound for the shadow problem. J. Comput. Syst. Sci. 67(4): 772-788 (2003) - [c14]Stefan Porschen, Bert Randerath, Ewald Speckenmeyer:
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. SAT 2003: 172-187 - 2002
- [j8]Benno Schwikowski, Ewald Speckenmeyer:
On enumerating all minimal solutions of feedback problems. Discret. Appl. Math. 117(1-3): 253-265 (2002) - 2001
- [j7]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: 269-277 (2001)
1990 – 1999
- 1999
- [j6]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. 96-97: 89-106 (1999) - 1996
- [j5]Max Böhm, Ewald Speckenmeyer:
A Fast Parallel SAT-Solver - Efficient Workload Balancing. Ann. Math. Artif. Intell. 17(3-4): 381-400 (1996) - [c13]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: 669-676 - 1992
- [j4]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): 185-200 (1992) - [c12]Thomas Seifert, Ewald Speckenmeyer:
Zur Simulation von shared-memory auf Transputernetzwerken. Transputer-Anwender-Treffen 1992: 51-60 - [c11]Max Böhm, Ewald Speckenmeyer:
Ein paralleler SAT-Solver auf Transputern. Transputer-Anwender-Treffen 1992: 235-244 - 1991
- [c10]Peter Heusch, Ewald Speckenmeyer:
Some Aspects of the Probabilistic Behavior of Variants of Resolution. CSL 1991: 164-172 - 1990
- [c9]Max Böhm, Ewald Speckenmeyer:
Parallele dynamische Spielbaumauswertung auf Transputern. Transputer-Anwender-Treffen 1990: 80-87 - [c8]Thomas Seifert, Ewald Speckenmeyer:
Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM. Transputer-Anwender-Treffen 1990: 103-110
1980 – 1989
- 1989
- [c7]Ewald Speckenmeyer, Rainer Kemp:
On the Average Time Complexity of Set Partitioning. CSL 1989: 369-381 - [c6]Ewald Speckenmeyer:
On Feedback Problems in Diagraphs. WG 1989: 218-231 - 1988
- [j3]Ewald Speckenmeyer:
On feedback vertex sets and nonseparating independent sets in cubic graphs. J. Graph Theory 12(3): 405-412 (1988) - [c5]Ewald Speckenmeyer:
Is Average Superlinear Speedup Possible? CSL 1988: 301-312 - [c4]Ewald Speckenmeyer:
Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability. MFCS 1988: 529-538 - 1987
- [c3]Ewald Speckenmeyer:
On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem. CSL 1987: 281-288 - [c2]Ewald Speckenmeyer, Burkhard Monien, Oliver Vornberger:
Superlinear Speedup for Parallel Backtracking. ICS 1987: 985-993 - 1985
- [j2]Burkhard Monien, Ewald Speckenmeyer:
Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. Acta Informatica 22(1): 115-123 (1985) - [j1]Burkhard Monien, Ewald Speckenmeyer:
Solving satisfiability in less than 2n steps. Discret. Appl. Math. 10(3): 287-295 (1985) - 1983
- [b1]Ewald Speckenmeyer:
Untersuchungen zum Feedback-vertex-set-Problem in ungerichteten Graphen. University of Paderborn, Germany, 1983, pp. 1-61 - [c1]Burkhard Monien, Ewald Speckenmeyer:
Some Further Approximation Algorithms for the Vertex Cover Problem. CAAP 1983: 341-349
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
