Dualizable but not Fully Dualizable Algebras. - Todd Niven (Int. J. Algebra Comput., 2007)

Graphs, polymorphisms and the complexity of homomorphism problems. - Libor Barto; Marcin Kozik; Todd Niven (STOC, 2008)

The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell). - Libor Barto; Marcin Kozik; Todd Niven (SIAM J. Comput., 2009)

Proving Symmetries by Model Transformation. - Christopher Mears; Todd Niven; Marcel Jackson; Mark Wallace 001 (CP, 2011)

On the Reduction of the CSP Dichotomy Conjecture to Digraphs. - Jakub Bulin; Dejan Delic; Marcel Jackson; Todd Niven (CP, 2013)

Digraph related constructions and the complexity of digraph homomorphism problems - Marcel Jackson; Tomasz Kowalski; Todd Niven (CoRR, 2013)

Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs. - Tim Dwyer; Christopher Mears; Kerri Morgan; Todd Niven; Kim Marriott; Mark Wallace 001 (PacificVis, 2014)

On Maltsev Digraphs. - Catarina Carvalho; László Egri; Marcel Jackson; Todd Niven (Electron. J. Comb., 2015)

A finer reduction of constraint problems to digraphs. - Jakub Bulin; Dejan Delic; Marcel Jackson; Todd Niven (Log. Methods Comput. Sci., 2015)

Algebraic foundations for qualitative calculi and networks. - Robin Hirsch; Marcel Jackson; Tomasz Kowalski; Todd Niven (CoRR, 2016)

Complexity and polymorphisms for digraph constraint problems under some basic constructions. - Marcel Jackson; Tomasz Kowalski; Todd Niven (Int. J. Algebra Comput., 2016)