1. Anandkumar, A., Hsu, D., Javanmard, A., and Kakade, S. M. 2013. Learning Linear Bayesian Networks with Latent Variables. In Proc. ICML (Atlanta, GA, USA, June 16 - 21, 2013). ICML '13. JMLR.org, 28, 249--257.
2. Bernardo, J. M., Bayarri, M. J., Berger, J. O., Dawid, A. P., Heckerman, D., Smith, A. F. M., and West, M. 2003. The variational Bayesian EM algorithm for incomplete data: with application to scoring graphical model structures. Bayesian statistics, 2003, 7: 453--464.
3. Binder, J., Koller, D., Russell, S., and Kanazawa, K. 1997. Adaptive probabilistic networks with hidden variables. Machine Learning, Springer, 1997, 29 (2--3): 213--244. DOI= http://dx.doi.org/10.1023/A:1007421730016.
4. Bomze, I. M., Budinich, M., Pardalos, P. M., and Pelillo, M. 1999. The maximum clique problem. Handbook of combinatorial optimization. Springer, 1999, 1--74.
5. Chades, I., Carwardine, J., Martin, T. G., Nicol, S., Sabbadin, R., and Buffet, O. 2012. MOMDPs: A Solution for Modelling Adaptive Management Problems. In Proc. AAAI (Toronto, Ontario, Canada, July 22 - 26, 2012). AAAI '12. AAAI Press, 267--273.