| 2008 |
|---|
| 20 | EE | Oliver Kullmann:
Present and Future of Practical SAT Solving.
Complexity of Constraints 2008: 283-319 |
| 2007 |
|---|
| 19 | EE | Oliver Kullmann:
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices.
SAT 2007: 314-327 |
| 18 | EE | Oliver Kullmann:
Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability.
Electronic Colloquium on Computational Complexity (ECCC) 14(055): (2007) |
| 2006 |
|---|
| 17 | EE | Oliver Kullmann:
Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities.
Complexity of Constraints 2006 |
| 16 | EE | Oliver Kullmann,
Inês Lynce,
João Marques-Silva:
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel.
SAT 2006: 22-35 |
| 15 | EE | Oliver Kullmann:
The SAT 2005 Solver Competition on Random Instances.
JSAT 2(1-4): 61-102 (2006) |
| 2004 |
|---|
| 14 | EE | Nicola Galesi,
Oliver Kullmann:
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank.
SAT 2004 |
| 13 | EE | Nicola Galesi,
Oliver Kullmann:
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank.
SAT (Selected Papers 2004: 89-104 |
| 12 | EE | Oliver Kullmann:
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems.
Ann. Math. Artif. Intell. 40(3-4): 303-352 (2004) |
| 2003 |
|---|
| 11 | EE | Oliver Kullmann:
The Combinatorics of Conflicts between Clauses.
SAT 2003: 426-440 |
| 10 | EE | Oliver Kullmann:
Lean clause-sets: generalizations of minimally unsatisfiable clause-sets.
Discrete Applied Mathematics 130(2): 209-249 (2003) |
| 2002 |
|---|
| 9 | | Herbert Fleischner,
Oliver Kullmann,
Stefan Szeider:
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
Theor. Comput. Sci. 289(1): 503-516 (2002) |
| 2001 |
|---|
| 8 | EE | Oliver Kullmann:
On the use of autarkies for satisfiability decision.
Electronic Notes in Discrete Mathematics 9: 231-253 (2001) |
| 2000 |
|---|
| 7 | EE | Oliver Kullmann:
An improved version of width restricted resolution.
AMAI 2000 |
| 6 | EE | Oliver Kullmann:
An Application of Matroid Theory to the SAT Problem.
IEEE Conference on Computational Complexity 2000: 116- |
| 5 | | Oliver Kullmann:
Investigations on autark assignments.
Discrete Applied Mathematics 107(1-3): 99-137 (2000) |
| 4 | EE | Oliver Kullmann:
An application of matroid theory to the SAT problem
Electronic Colloquium on Computational Complexity (ECCC) 7(18): (2000) |
| 1999 |
|---|
| 3 | EE | Oliver Kullmann:
On a Generalization of Extended Resolution.
Discrete Applied Mathematics 96-97: 149-176 (1999) |
| 2 | EE | Oliver Kullmann:
Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs
Electronic Colloquium on Computational Complexity (ECCC)(41): (1999) |
| 1 | EE | Oliver Kullmann:
New Methods for 3-SAT Decision and Worst-case Analysis.
Theor. Comput. Sci. 223(1-2): 1-72 (1999) |
