Achlioptas D. & Friedgut E. 1999. A sharp threshold for k-colorability. Random Structures and Algorithms 14(1), 63–70.

Achlioptas D. & Moore C. 2003. Almost all graphs with average degree 4 are 3-colorable. Journal of Computer and System Sciences 67(2), 441–471.

Babbush R., O’Gorman B. & Aspuru-Guzik A. 2013. Resource efficient gadgets for compiling adiabatic quantum optimization problems. Annalen der Physik 525(10–11), 877–888.

Blum A. & Furst M. 1997. Planning through planning graph analysis. Artificial Intelligence Journal 90, 281–330.

Boros E. & Hammer P. L. 2002. Pseudo-boolean optimization. Discrete Applied Mathematics 123(1), 155–225.

Cai J., Macready B. & Roy A. 2014. A practical heuristic for finding graph minors. arXiv:1406:2741.

Chien S., Johnston M., Frank J., Giuliano M., Kavelaars A., Lenzen C., Policella N. & Verfailie G. 2012. A generalized timeline representation, services, and interface for automating space mission operations. In 12th International Conference on Space Operations.

Coja-Oghlan A. 2013. Upper-bounding the k-colorability threshold by counting covers. arXiv:1305.0177.

Culberson J., Beacham A. & Papp D. 1995. Hiding our colors. In Proceedings of the CP95 Workshop on Studying and Solving Really Hard Problems. 31–42.

Das A. & Chakrabarti B. K. 2008. Colloquium: quantum annealing and analog quantum computation. Reviews of Modern Physics 80, 1061–1081.

Do M. B. & Kambhampati S. 2001. Planning as constraint satisfaction: solving the planning graph by compiling it into CSP. Artificial Intelligence Journal 132(2), 151–1182.

Dubois O. & Mandler J. 2002. On the non-3-colourability of random graphs. arXiv:math/0209087.

Farhi E., Goldstone J., Gutmann S. & Sipser M. 2000. Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106.

Fikes R. E. & Nilsson N. J. 1972. STRIPS: a new approach to the application of theorem proving to problem solving. Artificial Intelligence 2(3), 189–208.

Ghallab M., Nau D. & Traverso P. 2004. Automated Planning: Theory & Practice. Elsevier.

International Planning Competition 2004. The International Planning Competition Website. http://icaps-conference.org/index.php/Main/Competitions.

Kautz H. 2004. SATPLAN04: planning as satisfiability. Working Notes on the Fourth International Planning Competition (IPC-2004), 44–45.

Kautz H. A. & Selman B. 1999. Unifying SAT-based and graph-based planning. In Proceedings of IJCAI'1999.

Nielsen M. & Chuang I. L. 2001. Quantum Computing and Quantum Information, Cambridge, Cambridge University Press.

Perdomo-Ortiz A., Fluegemann J., Biswas R. & Smelyanskiy V. N. 2015. A performance estimator for quantum annealers: gauge selection and parameter setting. arXiv preprint arXiv:1503.01083.

Rieffel E. G. & Polak W. 2011. A Gentle Introduction to Quantum Computing, Cambridge, MA, MIT Press.

Rieffel E. G., Venturelli D., Hen I., Do M. & Frank J. 2014. Parametrized families of hard planning problems from phase transitions. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI-14). 2337–2343.

Rieffel E. G., Venturelli D., O’Gorman B., Do M. B., Prystay E. M. & Smelyanskiy V. N. 2015. A case study in programming a quantum annealer for hard operational planning problems. Quantum Information Processing 14(1), 1–36.

Smelyanskiy V. N, Rieffel E. G, Knysh S. I, Williams C. P, Johnson M. W., Thom M. C., Macready W. G. & Pudenz K. L. 2012. A near-term quantum computing approach for hard computational problems in space exploration. arXiv:1204.2821.