Ewald Speckenmeyer

According to our database1, Ewald Speckenmeyer
  • authored at least 41 papers between 1983 and 2016.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Do regular timetables help to reduce delays in tram networks? It depends!
Public Transport, 2016

2014
XSAT and NAE-SAT of linear CNF classes.
Discrete Applied Mathematics, 2014

Probabilistic Analysis of Random Mixed Horn Formulas.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

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

2012
Generalized k-ary tanglegrams on level graphs: A satisfiability-based approach and its evaluation.
Discrete Applied Mathematics, 2012

2011
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

2010
Complexity Results for Linear XSAT-Problems.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

2009
Linear CNF formulas and satisfiability.
Discrete Applied Mathematics, 2009

On Some Aspects of Mixed Horn Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008
Guest Editors Conclusion.
JSAT, 2008

A CNF Class Generalizing Exact Linear Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

2007
Satisfiability of mixed Horn formulas.
Discrete Applied Mathematics, 2007

Algorithms for Variable-Weighted 2-SAT and Dual Problems.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006
On Linear CNF Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

2005
Exact 3-satisfiability is decidable in time O(20.16254n).
Ann. Math. Artif. Intell., 2005

2004
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems.
Proceedings of the SAT 2004, 2004

2003
Improving a fixed parameter tractability time bound for the shadow problem.
J. Comput. Syst. Sci., 2003

Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002
On enumerating all minimal solutions of feedback problems.
Discrete Applied Mathematics, 2002

2001
A Satisfiability Formulation of Problems on Level Graphs.
Electronic Notes in Discrete Mathematics, 2001

1999
An Algorithm for the Class of Pure Implicational Formulas.
Discrete Applied Mathematics, 1999

1996
A Fast Parallel SAT-Solver - Efficient Workload Balancing.
Ann. Math. Artif. Intell., 1996

On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solvers.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1992
Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior.
Ann. Math. Artif. Intell., 1992

Zur Simulation von shared-memory auf Transputernetzwerken.
Proceedings of the Parallele Datenverarbeitung mit dem Transputer, 1992

Ein paralleler SAT-Solver auf Transputern.
Proceedings of the Parallele Datenverarbeitung mit dem Transputer, 1992

1991
Some Aspects of the Probabilistic Behavior of Variants of Resolution.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990
Spezifikation einer Sprache zur Simulation von PRAM-Modellen und ihre Übersetzung nach OCCAM.
Proceedings of the Parallele Datenverarbeitung mit dem Transputer, 1990

Parallele dynamische Spielbaumauswertung auf Transputern.
Proceedings of the Parallele Datenverarbeitung mit dem Transputer, 1990

1989
On Feedback Problems in Diagraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

On the Average Time Complexity of Set Partitioning.
Proceedings of the CSL '89, 1989

1988
On feedback vertex sets and nonseparating independent sets in cubic graphs.
Journal of Graph Theory, 1988

Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Is Average Superlinear Speedup Possible?
Proceedings of the CSL '88, 1988

1987
Superlinear Speedup for Parallel Backtracking.
Proceedings of the Supercomputing, 1987

On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem.
Proceedings of the CSL '87, 1987

1985
Solving satisfiability in less than 2n steps.
Discrete Applied Mathematics, 1985

Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem.
Acta Inf., 1985

1983
Untersuchungen zum Feedback-vertex-set-Problem in ungerichteten Graphen.
PhD thesis, 1983

Some Further Approximation Algorithms for the Vertex Cover Problem.
Proceedings of the CAAP'83, 1983


  Loading...