Todd Niven
Todd Niven
Verified email at latrobe.edu.au
TitleCited byYear
The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell)
L Barto, M Kozik, T Niven
SIAM Journal on Computing 38 (5), 1782-1802, 2009
1742009
Graphs, polymorphisms and the complexity of homomorphism problems
L Barto, M Kozik, T Niven
Proceedings of the fortieth annual ACM symposium on Theory of computing, 789-796, 2008
322008
CSP dichotomy for special triads
L Barto, M Kozik, M Maróti, T Niven
Proceedings of the American Mathematical Society 137 (9), 2921-2934, 2009
292009
On the reduction of the CSP dichotomy conjecture to digraphs
J Bulín, D Delić, M Jackson, T Niven
International Conference on Principles and Practice of Constraint …, 2013
262013
A finer reduction of constraint problems to digraphs
J Bulin, D Delic, M Jackson, T Niven
arXiv preprint arXiv:1406.6413, 2014
182014
Improved optimal and approximate power graph compression for clearer visualisation of dense graphs
T Dwyer, C Mears, K Morgan, T Niven, K Marriott, M Wallace
2014 IEEE Pacific Visualization Symposium, 105-112, 2014
182014
When is a full duality strong
BA Davey, M Haviar, T Niven
Houston J. Math 33 (1), 1-22, 2007
132007
Proving symmetries by model transformation
C Mears, T Niven, M Jackson, M Wallace
International Conference on Principles and Practice of Constraint …, 2011
112011
On maltsev digraphs
C Carvalho, L Egri, M Jackson, T Niven
International Computer Science Symposium in Russia, 181-194, 2011
112011
Congruence modularity implies cyclic terms for finite algebras
L Barto, M Kozik, M Maróti, R McKenzie, T Niven
Algebra universalis 61 (3-4), 365, 2009
92009
Full but not strong dualities at the finite level: extending the realm
BA Davey, M Haviar, T Niven, N Perkal
Algebra Universalis 56 (1), 37-56, 2007
72007
Complexity and polymorphisms for digraph constraint problems under some basic constructions
M Jackson, T Kowalski, T Niven
International Journal of Algebra and Computation 26 (07), 1395-1433, 2016
6*2016
Digraph related constructions and the complexity of digraph homomorphism problems
M Jackson, T Kowalski, T Niven
arXiv preprint arXiv:1304.4986, 2013
42013
On maltsev digraphs
C Carvalho, L Egri, M Jackson, T Niven
Electronic Journal of Combinatorics, 2015
32015
Structural reducts and the full implies strong problem
T Niven
Algebra universalis 57 (1), 101-107, 2007
32007
Irresponsibility indicates an inability to be strong
E Beveridge, D Casperson, J Hyndman, T Niven
Algebra universalis 55 (4), 457-477, 2006
32006
Rail disruption: passenger focused recovery
N Boland, I Evans, C Mears, T Niven, M Pattison, M Wallace, H Waterer
WIT Transactions on The Built Environment 127, 543-553, 2012
12012
Dualizable but not fully dualizable algebras
T Niven
International Journal of Algebra and Computation 17 (02), 347-367, 2007
12007
Irresponsibility indicates an inability to be strong (vol 57, pg 457, 2007)
E Beveridge, D Casperson, J Hyndman, T Niven, BA Davey
ALGEBRA UNIVERSALIS 57 (1), 1-1, 2007
2007
Variations on the Full Versus Strong Problem in the Theory of Natural Dualities
T Niven
La Trobe University, 2005
2005
The system can't perform the operation now. Try again later.
Articles 1–20