The following pages link to Ewald Speckenmeyer (Q714018):
Displayed 37 items.
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation (Q714020) (← links)
- Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496) (← links)
- Satisfiability of mixed Horn formulas (Q997066) (← links)
- Linear CNF formulas and satisfiability (Q1028433) (← links)
- (Q1082829) (redirect page) (← links)
- Solving satisfiability in less than \(2^ n\) steps (Q1082830) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- Exact satisfiability, a natural extension of set partition, and its average case behavior (Q1353993) (← links)
- A fast parallel SAT-solver -- efficient workload balancing (Q1380435) (← links)
- Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) (Q1777401) (← links)
- Improving a fixed parameter tractability time bound for the shadow problem (Q1877708) (← links)
- An algorithm for the class of pure implicational formulas (Q1961448) (← links)
- XSAT and NAE-SAT of linear CNF classes (Q2440094) (← links)
- (Q2741531) (← links)
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (Q3007679) (← links)
- (Q3201761) (← links)
- (Q3318125) (← links)
- (Q3322143) (← links)
- (Q3489817) (← links)
- A CNF Class Generalizing Exact Linear Formulas (Q3502711) (← links)
- Algorithms for Variable-Weighted 2-SAT and Dual Problems (Q3612465) (← links)
- On Some Aspects of Mixed Horn Formulas (Q3637161) (← links)
- (Q3728033) (← links)
- (Q3739144) (← links)
- (Q3795286) (← links)
- On feedback vertex sets and nonseparating independent sets in cubic graphs (Q3804730) (← links)
- (Q3811764) (← links)
- (Q4202940) (← links)
- (Q4268473) (← links)
- (Q4375778) (← links)
- A disjunctive program formulation to generate regular public transit timetables adhering to prioritized planning requirements (Q4686677) (← links)
- (Q4694754) (← links)
- (Q4747916) (← links)
- Complexity Results for Linear XSAT-Problems (Q4930593) (← links)
- Theory and Applications of Satisfiability Testing (Q5325860) (← links)
- Theory and Applications of Satisfiability Testing (Q5714756) (← links)
- On Linear CNF Formulas (Q5756579) (← links)