Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten). - Michael Codish; Luís Cruz-Filipe; Michael Frank 002; Peter Schneider-Kamp (ICTAI, 2014)

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)

When Six Gates are Not Enough. - Michael Codish; Luís Cruz-Filipe; Michael Frank 002; Peter Schneider-Kamp (CoRR, 2015)

Methods for Solving Extremal Problems in Practice. - Michael Frank 002 (ICLP (Technical Communications), 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)

Logic Programming with Graph Automorphism: Integrating naut with Prolog (a Tool Paper). - Michael Frank 002; Michael Codish (CoRR, 2016)

Sorting nine inputs requires twenty-five comparisons. - Michael Codish; Luís Cruz-Filipe; Michael Frank 002; Peter Schneider-Kamp (J. Comput. Syst. Sci., 2016)

Logic Programming with Graph Automorphism: Integrating nauty with Prolog (Tool Description). - Michael Frank 002; Michael Codish (Theory Pract. Log. Program., 2016)

Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description). - Michael Codish; Michael Frank 002; Amit Metodi; Morad Muslimany (ICLP (Technical Communications), 2017)

The DNA Word Design Problem: A New Constraint Model and New Results. - Michael Codish; Michael Frank 002; Vitaly Lagoon (IJCAI, 2017)