1. Dynamic variable ordering in CSPs
2. Constructing simple nonograms of varying difficulty;Batenburg;Pure Math. Appl.,2009
3. Solving nonograms by combining relaxations;Batenburg;Pattern Recognition,2009
4. Biere, A., Heule, M., Van Maaren, H. & Walsh, T. (2009). Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications (Vol. 185).
5. Chen, L.-P. & Hung, C.-Y. (2017). A new simplified line solver for nonogram puzzle games. In 2017 TCGA Computer Game, National Penhu University, Taiwan, May 5–8.