Todd Niven

According to our database, Todd Niven authored at least 11 papers between 2007 and 2016.

Collaborative distances:

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

2016

Complexity and polymorphisms for digraph constraint problems under some basic constructions.

Marcel Jackson, Tomasz Kowalski, Todd Niven

Int. J. Algebra Comput., 2016

Algebraic foundations for qualitative calculi and networks.

Robin Hirsch, Marcel Jackson, Tomasz Kowalski, Todd Niven

CoRR, 2016

2015

A finer reduction of constraint problems to digraphs.

Jakub Bulin, Dejan Delic, Marcel Jackson, Todd Niven

Log. Methods Comput. Sci., 2015

On Maltsev Digraphs.

Catarina Carvalho, László Egri, Marcel Jackson, Todd Niven

Electron. J. Comb., 2015

2014

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

Proceedings of the IEEE Pacific Visualization Symposium, 2014

2013

Digraph related constructions and the complexity of digraph homomorphism problems

Marcel Jackson, Tomasz Kowalski, Todd Niven

CoRR, 2013

On the Reduction of the CSP Dichotomy Conjecture to Digraphs.

Jakub Bulin, Dejan Delic, Marcel Jackson, Todd Niven

Proceedings of the Principles and Practice of Constraint Programming, 2013

2011

Proving Symmetries by Model Transformation.

Christopher Mears, Todd Niven, Marcel Jackson, Mark Wallace

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

2009

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

2008

Graphs, polymorphisms and the complexity of homomorphism problems.

Libor Barto, Marcin Kozik, Todd Niven

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

2007

Dualizable but not Fully Dualizable Algebras.

Todd Niven

Int. J. Algebra Comput., 2007