Efficiently Finding Higher-Order Mutants, Chu-Pan Wong, Jens Meinicke, Leo Chen, João P Diniz, Christian Kästner, and Eduardo Figueiredo, in Proceedings of the 2020 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2020.
Pairwise compatibility graphs: complete characterization for wheels, Matthew Beaudouin-Lafon, Serena Chen, Nathaniel Karst, Denise Sakai Troxell, and Xudong Zheng, Involve, a Journal of Mathematics, vol. 12, no. 5, pp. 871–882, 2019.
On the zero blocking number of rectangular, cylindrical, and Möbius grids, Matthew Beaudouin-Lafon, Margaret Crawford, Serena Chen, Nathaniel Karst, Louise Nielsen, and Denise Sakai Troxell, Discrete Applied Mathematics, 2019.
Finding Higher Order Mutants Using Variational Execution, Serena Chen, arXiv, 1809.04563, 2018, (SPLASH Student Research Competition).
Labeling crossed prisms with a condition at distance two, Matthew Beaudouin-Lafon, Serena Chen, Nathaniel Karst, Jessica Oehrlein, and Denise Troxell, Involve, a Journal of Mathematics, vol. 11, no. 1, pp. 67–80, 2017.