| 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 | 192 | 2009 |
| 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 | 36 | 2008 |
| 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 | 33 | 2009 |
| A finer reduction of constraint problems to digraphs J Bulin, D Delic, M Jackson, T Niven Logical Methods in Computer Science 11, 2015 | 32 | 2015 |
| 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 | 28 | 2014 |
| On the reduction of the CSP dichotomy conjecture to digraphs J Bulín, D Delić, M Jackson, T Niven Principles and Practice of Constraint Programming: 19th International …, 2013 | 26 | 2013 |
| 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 | 19 | 2009 |
| Proving symmetries by model transformation C Mears, T Niven, M Jackson, M Wallace Principles and Practice of Constraint Programming–CP 2011: 17th …, 2011 | 14 | 2011 |
| When is a full duality strong BA Davey, M Haviar, T Niven Houston J. Math 33 (1), 1-22, 2007 | 14 | 2007 |
| On maltsev digraphs C Carvalho, L Egri, M Jackson, T Niven Computer Science–Theory and Applications: 6th International Computer Science …, 2011 | 12 | 2011 |
| 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 | 8 | 2007 |
| Irresponsibility indicates an inability to be strong E Beveridge, D Casperson, J Hyndman, T Niven Algebra universalis 55, 457-477, 2006 | 8 | 2006 |
| On maltsev digraphs C Carvalho, L Egri, M Jackson, T Niven Electronic Journal of Combinatorics, 2015 | 6 | 2015 |
| Digraph related constructions and the complexity of digraph homomorphism problems M Jackson, T Kowalski, T Niven arXiv preprint arXiv:1304.4986, 2013 | 4 | 2013 |
| 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 | 3 | 2012 |
| Structural reducts and the full implies strong problem T Niven Algebra universalis 57 (1), 101-107, 2007 | 3 | 2007 |
| Dualizable but not fully dualizable algebras T Niven International Journal of Algebra and Computation 17 (02), 347-367, 2007 | 1 | 2007 |
| 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 |
Libor BartoDepartment of Algebra, Charles University, PragueZweryfikowany adres z mff.cuni.cz
