David G. Mitchell

	2009
20		Eugenia Ternovska, David G. Mitchell: Declarative Programming of Search Problems with Built-in Arithmetic. IJCAI 2009: 942-947
	2008
19		David G. Mitchell, Eugenia Ternovska: Expressive power and abstraction in Essence. Constraints 13(3): 343-384 (2008)
	2007
18		David G. Mitchell, Faraz Hach, Raheleh Mohebali: Faster Phylogenetic Inference with MXG. LPAR 2007: 423-437
17		Joshua Buresh-Oppenheim, David G. Mitchell: Minimum 2CNF Resolution Refutations in Polynomial Time. SAT 2007: 300-313
	2006
16		Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta: Constructing Camin-Sokal Phylogenies Via Answer Set Programming. LPAR 2006: 452-466
15		Joshua Buresh-Oppenheim, David G. Mitchell: Minimum Witnesses for Unsatisfiable 2CNFs. SAT 2006: 42-47
	2005
14		Holger H. Hoos, David G. Mitchell: Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers Springer 2005
13		David G. Mitchell, Eugenia Ternovska: A Framework for Representing and Solving NP Search Problems. AAAI 2005: 430-435
12		Joey Hwang, David G. Mitchell: 2-Way vs. d-Way Branching for CSP. CP 2005: 343-357
11		David G. Mitchell: A SAT Solver Primer. Bulletin of the EATCS 85: 112-132 (2005)
10		Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore: The resolution complexity of random graph k-colorability. Discrete Applied Mathematics 153(1-3): 25-47 (2005)
	2004
9		Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore: The Resolution Complexity of Random Graph k-Colorability Electronic Colloquium on Computational Complexity (ECCC)(012): (2004)
	2003
8		David G. Mitchell: Resolution and Constraint Satisfaction. CP 2003: 555-569
	2002
7		David G. Mitchell: Resolution Complexity of Random Constraints. CP 2002: 295-309
	2001
6		Josh Buresh-Oppenheim, David G. Mitchell, Toniann Pitassi: Linear and Negative Resolution are Weaker than Resolution Electronic Colloquium on Computational Complexity (ECCC) 8(074): (2001)
	1998
5		David G. Mitchell: Hard Problems for CSP Algorithms. AAAI/IAAI 1998: 398-405
	1996
4		David G. Mitchell, Hector J. Levesque: Some Pitfalls for Experimenters with Random SAT. Artif. Intell. 81(1-2): 111-125 (1996)
3		Bart Selman, David G. Mitchell, Hector J. Levesque: Generating Hard Satisfiability Problems. Artif. Intell. 81(1-2): 17-29 (1996)
	1992
2		Bart Selman, Hector J. Levesque, David G. Mitchell: A New Method for Solving Hard Satisfiability Problems. AAAI 1992: 440-446
1		David G. Mitchell, Bart Selman, Hector J. Levesque: Hard and Easy Distributions of SAT Problems. AAAI 1992: 459-465

Coauthor Index

1	Paul Beame	[9] [10]
2	Joshua Buresh-Oppenheim (Josh Buresh-Oppenheim)	[6] [15] [17]
3	Joseph C. Culberson	[9] [10]
4	Arvind Gupta	[16]
5	Faraz Hach	[18]
6	Holger H. Hoos (Holger Hoos)	[14]
7	Joey Hwang	[12]
8	Jonathan Kavanagh	[16]
9	Hector J. Levesque	[1] [2] [3] [4]
10	Ján Manuch	[16]
11	Raheleh Mohebali	[18]
12	Cristopher Moore	[9] [10]
13	Toniann Pitassi	[6]
14	Bart Selman	[1] [2] [3]
15	Eugenia Ternovska (Eugenia Ternovskaia)	[13] [16] [19] [20]
16	Xiaohong Zhao	[16]

Colors in the list of coauthors