Ewald Speckenmeyer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 49 from 49

2018

2016

Do regular timetables help to reduce delays in tram networks? It depends!Oliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer. pubtrans, 8(1):39-56, 2016. [doi]

2015

A Robust Schedule for Montpellier's Tramway NetworkOliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer. simeuro, 25(1):1-8, 2015. [doi]

2014

XSAT and NAE-SAT of linear CNF classesStefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer, Andreas Wotzlaw. DAM, 167:1-14, 2014. [doi]

Model-based Parallelization of Discrete Traffic Simulation ModelsOliver Ullrich, Daniel Lückerath, Ewald Speckenmeyer. simeuro, 24(3-4):115-122, 2014. [doi]

Probabilistic Analysis of Random Mixed Horn FormulasAndreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen. isaim 2014: [doi]

2012

Modeling Time Table based Tram TrafficDaniel Lückerath, Oliver Ullrich, Ewald Speckenmeyer. simeuro, 22(2):61-68, 2012. [doi]

Simulation and Optimization of Cologne's Tram ScheduleOliver Ullrich, Sebastian Franz, Ewald Speckenmeyer, Daniel Lückerath. simeuro, 22(2):69-76, 2012. [doi]

Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluationAndreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen. DAM, 160(16-17):2349-2363, 2012. [doi]

2011

Agent-based Modeling and Simulation of a Pastoralnomadic Land Use SystemPatrick Kuckertz, Oliver Ullrich, Anja Linstädter, Ewald Speckenmeyer. simeuro, 21(3-4):147-152, 2011. [doi]

Dynamic Distributed Simulation of DEVS Models on the OSGi ServiceMartin Petzold, Oliver Ullrich, Ewald Speckenmeyer. simeuro, 21(3-4):159-164, 2011. [doi]

A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level GraphsEwald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen. sat 2011: 134-144 [doi]

2010

Complexity Results for Linear XSAT-ProblemsStefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer. sat 2010: 251-263 [doi]

2009

On Some Aspects of Mixed Horn FormulasStefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer. sat 2009: 86-100 [doi]

Linear CNF formulas and satisfiabilityStefan Porschen, Ewald Speckenmeyer, Xishun Zhao. DAM, 157(5):1046-1068, 2009. [doi]

2008

A CNF Class Generalizing Exact Linear FormulasStefan Porschen, Ewald Speckenmeyer. sat 2008: 231-245 [doi]

Guest Editors ConclusionEwald Speckenmeyer, Armando Tacchella, Vasco M. Manquinho, Chu Min Li. jsat, 4(2-4), 2008. [doi]

2007

Satisfiability of mixed Horn formulasStefan Porschen, Ewald Speckenmeyer. DAM, 155(11):1408-1419, 2007. [doi]

Algorithms for Variable-Weighted 2-SAT and Dual ProblemsStefan Porschen, Ewald Speckenmeyer. sat 2007: 173-186 [doi]

2006

On Linear CNF FormulasStefan Porschen, Ewald Speckenmeyer, Bert Randerath. sat 2006: 212-225 [doi]

2005

Exact 3-satisfiability is decidable in time O(2:::0.16254::::n:::::::)Stefan Porschen, Bert Randerath, Ewald Speckenmeyer. AMAI, 43(1):173-193, 2005. [doi]

2004

Worst Case Bounds for some NP-Complete Modified Horn-SAT ProblemsStefan Porschen, Ewald Speckenmeyer. sat 2004: [doi]

Worst Case Bounds for Some NP-Complete Modified Horn-SAT ProblemsStefan Porschen, Ewald Speckenmeyer. sat 2005: 251-262 [doi]

2003

Improving a fixed parameter tractability time bound for the shadow problemPeter Heusch, Stefan Porschen, Ewald Speckenmeyer. jcss, 67(4):772-788, 2003. [doi]

Linear Time Algorithms for Some Not-All-Equal Satisfiability ProblemsStefan Porschen, Bert Randerath, Ewald Speckenmeyer. sat 2004: 172-187 [doi]

2002

On enumerating all minimal solutions of feedback problemsBenno Schwikowski, Ewald Speckenmeyer. DAM, 117(1-3):253-265, 2002.

2001

A Satisfiability Formulation of Problems on Level GraphsBert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek. endm, 9:269-277, 2001. [doi]

1999

An Algorithm for the Class of Pure Implicational FormulasJohn V. Franco, Judy Goldsmith, John S. Schlipf, Ewald Speckenmeyer, Ramjee P. Swaminathan. DAM, 96-97:89-106, 1999. [doi]

1996

A Fast Parallel SAT-Solver - Efficient Workload BalancingMax Böhm, Ewald Speckenmeyer. AMAI, 17(3-4):381-400, 1996.

On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solversEwald Speckenmeyer, Max Böhm, Peter Heusch. dimacs 1997: 669-676

1992

Ein paralleler SAT-Solver auf TransputernMax Böhm, Ewald Speckenmeyer. tat 1993: 235-244

Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case BehaviorJohn W. Rosenthal, Ewald Speckenmeyer, Rainer Kemp. AMAI, 6(1-3):185-200, 1992.

Zur Simulation von shared-memory auf TransputernetzwerkenThomas Seifert, Ewald Speckenmeyer. tat 1993: 51-60

1991

Some Aspects of the Probabilistic Behavior of Variants of ResolutionPeter Heusch, Ewald Speckenmeyer. csl 1992: 164-172

1990

Parallele dynamische Spielbaumauswertung auf TransputernMax Böhm, Ewald Speckenmeyer. tat 1991: 80-87

Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAMThomas Seifert, Ewald Speckenmeyer. tat 1991: 103-110

1989

On Feedback Problems in DiagraphsEwald Speckenmeyer. criwg 1990: 218-231

On the Average Time Complexity of Set PartitioningEwald Speckenmeyer, Rainer Kemp. csl 1990: 369-381

1988

Is Average Superlinear Speedup Possible?Ewald Speckenmeyer. csl 1989: 301-312

Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-SatisfiabilityEwald Speckenmeyer. mfcs 1988: 529-538

On feedback vertex sets and nonseparating independent sets in cubic graphsEwald Speckenmeyer. jgt, 12(3):405-412, 1988. [doi]

1987

On the Average Case Complexity of Backtracking for the Exact-Satisfiability ProblemEwald Speckenmeyer. csl 1988: 281-288

Superlinear Speedup for Parallel BacktrackingEwald Speckenmeyer, Burkhard Monien, Oliver Vornberger. ics 1988: 985-993

1985

Ramsey Numbers and an Approximation Algorithm for the Vertex Cover ProblemBurkhard Monien, Ewald Speckenmeyer. ACTA, 22(1):115-123, 1985.

n stepsBurkhard Monien, Ewald Speckenmeyer. DAM, 10(3):287-295, 1985. [doi]

1983

Some Further Approximation Algorithms for the Vertex Cover ProblemBurkhard Monien, Ewald Speckenmeyer. caap 1983: 341-349

Untersuchungen zum Feedback-vertex-set-Problem in ungerichteten GraphenEwald Speckenmeyer. PhD thesis, University of Paderborn, Germany, 1983. [doi]

Sign in or sign up to see more results.

runs on WebDSL