2. R. Backofen and S. Will. A constraint-based approach to fast and exact structure prediction in 3D protein models. Constraints**, 11(1):5–30, 2006.**
3. R. J. Bayardo Jr. and J. D. Pehoushek. Counting models using connected components. In Proc. of the 7th National Conference on AI**, pages 157–162, 2000.**
4. C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, C.-G. Quimper, and T. Walsh.

Reformulating global constraints: the SLIDE and REGULAR constraints. In Proc. of SARA-2007**, pages 80–92, 2007.**
5. A. Biere and C. Sinz. Decomposing SAT problems into connected components.

Satisfiability, Boolean Modeling and Computation**, 2:191–198, 2006.**
6. Boost graph library, 2007. Available as an open-source library from www.boost.org.

7. CPSP: Tools for constraint-based protein structure prediction, 2006. Available as an open-source library from www.bioinf.uni-freiburg.de/sw/cpsp.

8. R. Dechter and R. Mateescu. The impact of AND/OR search spaces on constraint satisfaction and counting. In Proc. of 10th CP**, pages 731–736, 2004.**
9. C. Flamm, I. L. Hofacker, P. F. Stadler, and M. T. Wolfinger. **Barrier trees of**
degenerate landscapes. Z.Phys.Chem**, 216:155–173, 2002.**
10. E. C. Freuder and M. J. Quinn. Taking advantage of stable sets of variables in constraint satisfaction problems. In Proc. of 9th IJCAI**, pages 1076–1078, 1985.**
11. Gecode: Generic constraint development environment, 2007. Available as an opensource library from www.gecode.org.

12. GTgraph: A suite of synthetic graph generators, 2006. Available as an open-source library from www-static.cc.gatech.edu/~kamesh/GTgraph.

13. K. F. Lau and K. A. Dill. A lattice statistical mechanics model of the conformational and sequence spaces of proteins. ACS**, 22:3986 - 3997, 1989.**
14. W. Li and P. van Beek. Guiding real-world SAT solving with **dynamic hypergraph**
separator decomposition. In Proc. of 16th IEEE ICTAI**, pages 542–548, 2004.**
15. R. Marinescu and R. Dechter. AND/OR branch-and-bound for graphical models.

In Proc. of 19th IJCAI**, pages 224–229, 2005.**
16. R. Marinescu and R. Dechter. Dynamic orderings for and/or branch-and-bound search in graphical models. In ECAI**, pages 138–142, 2006.**
17. L. Narayanan and S. M. Shende. Static frequency assignment in cellular networks.

Algorithmica**, 29(3):396–409, 2001.**
18. G. Pesant. A regular language membership constraint for **finite sequences of variables. In** Proc. of 10th CP**, pages 482–495, 2004.**
19. G. Pesant. Counting solutions of CSPs: A structural approach. In Proc. of 19th IJCAI**, pages 260–265, 2005.**
20. A. Renner and E. Bornberg-Bauer. Exploring the fitness landscapes of lattice proteins. In 2nd. Pacif. Symp. Biocomp. **Singapore, 1997.**
21. D. Roth. On the hardness of approximate reasoning. Artif. Intelligence**, 82(1-**
2):273–302, 1996.

22. J.-C. R´egin. A filtering algorithm for constraints of difference in CSPs. In Proc.

of 12th National Conference on AI**, pages 362–367, 1994.**
23. Y.-T. Tsai, Y.-L. Lin, and F. R. Hsu. The on-line first-fit algorithm for radio frequency assignment problems. Inf. Process. Lett.**, 84(4):195–199, 2002.**
24. L. G. Valiant. The complexity of computing the permanent. Theoretical Computer Science**, 8(2):189–201, 1979.**
25. M. Wolfinger, S. Will, I. Hofacker, R. Backofen, and P. Stadler. Exploring the lower part of discrete polymer model energy landscapes. EPL**, 74:725–732, 2006.**
26. H.-G. Yeh and X. Zhu. Resource-sharing system scheduling and circular chromatic number. Theor. Comput. Sci.**, 332(1-3):447–460, 2005.**