Ewald Speckenmeyer

From MaRDI portal
(Redirected from Ewald Speckenmeyer)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A disjunctive program formulation to generate regular public transit timetables adhering to prioritized planning requirements
Networks
2018-10-04Paper
XSAT and NAE-SAT of linear CNF classes
Discrete Applied Mathematics
2014-03-27Paper
Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
Discrete Applied Mathematics
2012-10-19Paper
A satisfiability-based approach for embedding generalized tanglegrams on level graphs
Theory and Applications of Satisfiability Testing - SAT 2011
2011-06-17Paper
Complexity Results for Linear XSAT-Problems
Theory and Applications of Satisfiability Testing – SAT 2010
2010-09-29Paper
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science
2009-07-24Paper
On Some Aspects of Mixed Horn Formulas
Lecture Notes in Computer Science
2009-07-07Paper
Linear CNF formulas and satisfiability
Discrete Applied Mathematics
2009-06-30Paper
Algorithms for Variable-Weighted 2-SAT and Dual Problems
Theory and Applications of Satisfiability Testing – SAT 2007
2009-03-10Paper
A CNF Class Generalizing Exact Linear Formulas
Theory and Applications of Satisfiability Testing – SAT 2008
2008-05-27Paper
On Linear CNF Formulas
Lecture Notes in Computer Science
2007-09-04Paper
Satisfiability of mixed Horn formulas
Discrete Applied Mathematics
2007-07-19Paper
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science
2005-12-16Paper
Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\)
Annals of Mathematics and Artificial Intelligence
2005-05-13Paper
Improving a fixed parameter tractability time bound for the shadow problem
Journal of Computer and System Sciences
2004-08-19Paper
On enumerating all minimal solutions of feedback problems
Discrete Applied Mathematics
2002-05-15Paper
A satisfiability formulation of problems on level graphs2001-09-24Paper
An algorithm for the class of pure implicational formulas
Discrete Applied Mathematics
2000-01-17Paper
scientific article; zbMATH DE number 1354158 (Why is no real title available?)1999-10-28Paper
scientific article; zbMATH DE number 1114010 (Why is no real title available?)1998-06-02Paper
A fast parallel SAT-solver -- efficient workload balancing
Annals of Mathematics and Artificial Intelligence
1998-03-04Paper
Exact satisfiability, a natural extension of set partition, and its average case behavior
Annals of Mathematics and Artificial Intelligence
1997-05-13Paper
scientific article; zbMATH DE number 408796 (Why is no real title available?)1993-09-06Paper
scientific article; zbMATH DE number 219267 (Why is no real title available?)1993-06-29Paper
scientific article; zbMATH DE number 4162692 (Why is no real title available?)1990-01-01Paper
scientific article; zbMATH DE number 4178775 (Why is no real title available?)1989-01-01Paper
scientific article; zbMATH DE number 4060775 (Why is no real title available?)1988-01-01Paper
On feedback vertex sets and nonseparating independent sets in cubic graphs
Journal of Graph Theory
1988-01-01Paper
scientific article; zbMATH DE number 4080977 (Why is no real title available?)1988-01-01Paper
scientific article; zbMATH DE number 3972888 (Why is no real title available?)1986-01-01Paper
Solving satisfiability in less than \(2^ n\) steps
Discrete Applied Mathematics
1985-01-01Paper
Ramsey numbers and an approximation algorithm for the vertex cover problem
Acta Informatica
1985-01-01Paper
scientific article; zbMATH DE number 3959477 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3848625 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3853131 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3803174 (Why is no real title available?)1981-01-01Paper


Research outcomes over time


This page was built for person: Ewald Speckenmeyer