Person:714018: Difference between revisions

From MaRDI portal
Person:714018
Created automatically from import230922100944
 
m AuthorDisambiguator moved page Ewald Speckenmeyer to Ewald Speckenmeyer: Duplicate
 
(No difference)

Latest revision as of 17:33, 12 December 2023

Available identifiers

zbMath Open speckenmeyer.ewaldWikidataQ102344535 ScholiaQ102344535MaRDI QIDQ714018

List of research outcomes

PublicationDate of PublicationType
A disjunctive program formulation to generate regular public transit timetables adhering to prioritized planning requirements2018-10-04Paper
XSAT and NAE-SAT of linear CNF classes2014-03-27Paper
Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation2012-10-19Paper
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs2011-06-17Paper
Complexity Results for Linear XSAT-Problems2010-09-29Paper
Theory and Applications of Satisfiability Testing2009-07-24Paper
On Some Aspects of Mixed Horn Formulas2009-07-07Paper
Linear CNF formulas and satisfiability2009-06-30Paper
Algorithms for Variable-Weighted 2-SAT and Dual Problems2009-03-10Paper
A CNF Class Generalizing Exact Linear Formulas2008-05-27Paper
On Linear CNF Formulas2007-09-04Paper
Satisfiability of mixed Horn formulas2007-07-19Paper
Theory and Applications of Satisfiability Testing2005-12-16Paper
Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\)2005-05-13Paper
Improving a fixed parameter tractability time bound for the shadow problem2004-08-19Paper
On enumerating all minimal solutions of feedback problems2002-05-15Paper
https://portal.mardi4nfdi.de/entity/Q27415312001-09-24Paper
An algorithm for the class of pure implicational formulas2000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q42684731999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q43757781998-06-02Paper
A fast parallel SAT-solver -- efficient workload balancing1998-03-04Paper
Exact satisfiability, a natural extension of set partition, and its average case behavior1997-05-13Paper
https://portal.mardi4nfdi.de/entity/Q42029401993-09-06Paper
https://portal.mardi4nfdi.de/entity/Q46947541993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q34898171990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32017611989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37952861988-01-01Paper
On feedback vertex sets and nonseparating independent sets in cubic graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38117641988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37391441986-01-01Paper
Ramsey numbers and an approximation algorithm for the vertex cover problem1985-01-01Paper
Solving satisfiability in less than \(2^ n\) steps1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37280331984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33181251983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33221431983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47479161981-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ewald Speckenmeyer