Computing the Ramsey number R (4, 3, 3) using abstraction and symmetry breaking M Codish, M Frank, A Itzhakov, A Miller Constraints 21 (3), 375-393, 2016 | 24 | 2016 |

Breaking symmetries in graph search with canonizing sets A Itzhakov, M Codish Constraints 21 (3), 357-374, 2016 | 12 | 2016 |

Breaking symmetries with lex implications M Codish, T Ehlers, G Gange, A Itzhakov, PJ Stuckey International Symposium on Functional and Logic Programming, 182-197, 2018 | 3 | 2018 |

Breaking symmetries in graphs: the nauty way M Codish, G Gange, A Itzhakov, PJ Stuckey International Conference on Principles and Practice of Constraint …, 2016 | 2 | 2016 |

Incremental symmetry breaking constraints for graph search problems A Itzhakov, M Codish Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1536-1543, 2020 | 1 | 2020 |

Solving graph coloring problems with abstraction and symmetry M Codish, M Frank, A Itzhakov, A Miller arXiv preprint arXiv:1409.5189, 2014 | 1 | 2014 |

Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs A Itzhakov, M Codish Constraints 27 (1), 8-28, 2022 | | 2022 |

Symmetry Breaking Constraints for Graph Search Problems A Itzhakov Ben-Gurion University of the Negev, 2017 | | 2017 |

Breaking Symmetries in Graph Coloring Problems with Degree Matrices: the Ramsey Number R (4, 3, 3)= 30 M Codish, M Frank, A Itzhakov, A Miller arXiv preprint arXiv:1409.5189, 2014 | | 2014 |