1. Efficient algorithms for combinatorial problems on graphs with bounded decomposability—A survey;Arnborg;BIT,1985
2. Dynamic variable ordering in CSPs;Bacchus,1995
3. The hazards of fancy backtracking;Baker,1994
4. Intelligent backtracking on constraint satisfaction problems: Experimental theoretical results, Ph.D. Thesis;Baker,1995
5. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem;Bayardo,1996