Twenty-five comparators is optimal when sorting nine inputs (and twenty-nine for ten) M Codish, L Cruz-Filipe, M Frank, P Schneider-Kamp Tools with Artificial Intelligence (ICTAI), 2014 IEEE 26th International …, 2014 | 46 | 2014 |

Logic Programming with Graph Automorphism: Integrating `nauty` with Prolog (Tool Description)*M Frank, M Codish Theory and Practice of Logic Programming 16 (5-6), 688-702, 2016 | 2 | 2016 |

When Six Gates are Not Enough M Codish, L Cruz-Filipe, M Frank, P Schneider-Kamp arXiv preprint arXiv:1508.05737, 2015 | 2 | 2015 |

Methods for Solving Extremal Problems in Practice M Frank OASIcs-OpenAccess Series in Informatics 52, 2016 | | 2016 |

Solving Graph Coloring Problems with Abstraction and Symmetry: the Ramsey Number R (4, 3, 3)= 30. M Codish, M Frank, A Itzhakov, A Miller CoRR, 2014 | | 2014 |

DNA Word Design: A New Constraint Model and New Results M Codish, M Frank, V Lagoon | | |

Proofs for Optimality of Sorting Networks by Logic Programming M Codish, L Cruz-Filipe, M Frank, P Schneider-Kamp Workshop on Implementation of Constraint and Logic Programming Systems and …, 0 | | |