The quadratic cycle cover problem: special cases and efficient bounds. - Frank de Meijer; Renata Sotirov (J. Comb. Optim., 2020)

SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning. - Frank de Meijer; Renata Sotirov (INFORMS J. Comput., 2021)

Partitioning through projections: Strong SDP bounds for large graph partition problems. - Frank de Meijer; Renata Sotirov; Angelika Wiegele; Shudian Zhao (Comput. Oper. Res., 2023)

Automorphism Groups of Cayley Graphs Generated by General Transposition Sets. - Dion Gijswijt; Frank de Meijer (Electron. J. Comb., 2024)

On Integrality in Semidefinite Programming for Discrete Optimization. - Frank de Meijer; Renata Sotirov (SIAM J. Optim., 2024)

The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization. - Frank de Meijer; Renata Sotirov (Math. Program., 2025)