1. [1] R. Belmonte and M. Vatshelle, “Graph classes with structured neighborhoods and algorithmic applications,” Theor. Comput. Sci., vol.511, pp.54-65, 2013.
2. [2] B.-M. Bui-Xuan, J.A. Telle, and M. Vatshelle, “Boolean-width of graphs,” Proc. 4th International Workshop on Parameterized and Exact Computation (IWPEC), Lecture Notes in Computer Science, vol.5917, pp.61-74, Springer, Berlin, Heidelberg, 2009.
3. [3] B.-M. Bui-Xuan, J.A. Telle, and M. Vatshelle, “Boolean-width of graphs,” Theor. Comput. Sci., vol.412, no.39, pp.5187-5204, 2011.
4. [4] B.-M. Bui-Xuan, J.A. Telle, and M. Vatshelle, “Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems,” Theor. Comput. Sci., vol.511, pp.66-76, 2013.
5. [5] A. Ershadi, List homomorphisms and bipartite co-circular arc graphs, Master's thesis, Simon Fraser University, 2012.