Solving Graph Coloring Problems with Abstraction and Symmetry: the Ramsey Number R(4, 3, 3)=30. - Michael Codish; Michael Frank 002; Avraham Itzhakov; Alice Miller 001 (CoRR, 2014)

Breaking Symmetries in Graphs: The Nauty Way. - Michael Codish; Graeme Gange; Avraham Itzhakov; Peter J. Stuckey (CP, 2016)

Computing the Ramsey number R(4, 3, 3) using abstraction and symmetry breaking. - Michael Codish; Michael Frank 002; Avraham Itzhakov; Alice Miller 001 (Constraints An Int. J., 2016)

Breaking symmetries in graph search with canonizing sets. - Avraham Itzhakov; Michael Codish (Constraints An Int. J., 2016)

Breaking Symmetries with Lex Implications. - Michael Codish; Thorsten Ehlers; Graeme Gange; Avraham Itzhakov; Peter J. Stuckey (FLOPS, 2018)

Incremental Symmetry Breaking Constraints for Graph Search Problems. - Avraham Itzhakov; Michael Codish (AAAI, 2020)

Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs. - Avraham Itzhakov; Michael Codish (Constraints An Int. J., 2022)

Breaking Symmetries with High Dimensional Graph Invariants and Their Combination. - Avraham Itzhakov; Michael Codish (CPAIOR, 2023)