Oliver Kullmann

	2012
34		Oliver Kullmann, Xishun Zhao: On Davis-Putnam reductions for minimally unsatisfiable clause-sets CoRR abs/1202.2600: (2012)
33		Matthew Gwynne, Oliver Kullmann: Generalising unit-refutation completeness and SLUR via nested input resolution CoRR abs/1204.6529: (2012)
	2011
32		Oliver Kullmann, Xishun Zhao: On Variables with Few Occurrences in Conjunctive Normal Forms. SAT 2011: 33-46
31		Tanbir Ahmed, Oliver Kullmann, Hunter S. Snevily: On the van der Waerden numbers w(2;3,t) CoRR abs/1102.5433: (2011)
30		Oliver Kullmann: Constraint satisfaction problems in clausal form CoRR abs/1103.3693: (2011)
29		Oliver Kullmann: Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency. Fundam. Inform. 109(1): 27-81 (2011)
28		Oliver Kullmann: Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure. Fundam. Inform. 109(1): 83-119 (2011)
	2010
27		Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Inês Lynce: The Seventh QBF Solvers Evaluation (QBFEVAL'10). SAT 2010: 237-250
26		Oliver Kullmann: Green-Tao Numbers and SAT. SAT 2010: 352-362
25		Oliver Kullmann: Exact Ramsey Theory: Green-Tao numbers and SAT CoRR abs/1004.0653: (2010)
24		Oliver Kullmann, Xishun Zhao: On variables with few occurrences in conjunctive normal forms CoRR abs/1010.5756: (2010)
	2009
23		Oliver Kullmann: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings Springer 2009
22		Oliver Kullmann: Fundaments of Branching Heuristics. Handbook of Satisfiability 2009: 205-244
21		Hans Kleine Büning, Oliver Kullmann: Minimal Unsatisfiability and Autarkies. Handbook of Satisfiability 2009: 339-401
	2008
20		Oliver Kullmann: Present and Future of Practical SAT Solving. Complexity of Constraints 2008: 283-319
	2007
19		Oliver Kullmann: Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. SAT 2007: 314-327
18		Oliver Kullmann: Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability. Electronic Colloquium on Computational Complexity (ECCC) 14(055): (2007)
	2006
17		Oliver Kullmann: Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities. Complexity of Constraints 2006
16		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		Oliver Kullmann: The SAT 2005 Solver Competition on Random Instances. JSAT 2(1-4): 61-102 (2006)
	2004
14		Nicola Galesi, Oliver Kullmann: Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT 2004
13		Nicola Galesi, Oliver Kullmann: Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT (Selected Papers 2004: 89-104
12		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		Oliver Kullmann: The Combinatorics of Conflicts between Clauses. SAT 2003: 426-440
10		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		Oliver Kullmann: On the use of autarkies for satisfiability decision. Electronic Notes in Discrete Mathematics 9: 231-253 (2001)
	2000
7		Oliver Kullmann: An improved version of width restricted resolution. AMAI 2000
6		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		Oliver Kullmann: An application of matroid theory to the SAT problem Electronic Colloquium on Computational Complexity (ECCC) 7(18): (2000)
	1999
3		Oliver Kullmann: On a Generalization of Extended Resolution. Discrete Applied Mathematics 96-97: 149-176 (1999)
2		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		Oliver Kullmann: New Methods for 3-SAT Decision and Worst-case Analysis. Theor. Comput. Sci. 223(1-2): 1-72 (1999)

Coauthor Index

1	Tanbir Ahmed	[31]
2	Uwe Bubeck	[27]
3	Hans Kleine Büning	[21]
4	Herbert Fleischner	[9]
5	Nicola Galesi	[13] [14]
6	Matthew Gwynne	[33]
7	Inês Lynce	[16] [27]
8	Claudia Peschiera	[27]
9	Luca Pulina	[27]
10	João P. Marques Silva (João Marques-Silva)	[16]
11	Hunter S. Snevily	[31]
12	Stefan Szeider	[9]
13	Armando Tacchella	[27]
14	Xishun Zhao	[24] [32] [34]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page