Michael Frank

According to our database, Michael Frank authored at least 10 papers between 2014 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2017

The DNA Word Design Problem: A New Constraint Model and New Results.

Michael Codish, Michael Frank, Vitaly Lagoon

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description).

Michael Codish, Michael Frank, Amit Metodi, Morad Muslimany

Proceedings of the Technical Communications of the 33rd International Conference on Logic Programming, 2017

2016

Logic Programming with Graph Automorphism: Integrating nauty with Prolog (Tool Description).

Michael Frank, Michael Codish

Theory Pract. Log. Program., 2016

Sorting nine inputs requires twenty-five comparisons.

Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp

J. Comput. Syst. Sci., 2016

Logic Programming with Graph Automorphism: Integrating naut with Prolog (a Tool Paper).

Michael Frank, Michael Codish

CoRR, 2016

Computing the Ramsey number R(4, 3, 3) using abstraction and symmetry breaking.

Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller

Constraints An Int. J., 2016

Methods for Solving Extremal Problems in Practice.

Michael Frank

Proceedings of the Technical Communications of the 32nd International Conference on Logic Programming, 2016

2015

When Six Gates are Not Enough.

Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp

CoRR, 2015

2014

Solving Graph Coloring Problems with Abstraction and Symmetry: the Ramsey Number R(4, 3, 3)=30.

Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller

CoRR, 2014

Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten).

Michael Codish, Luís Cruz-Filipe, Michael Frank, Peter Schneider-Kamp

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014