| Generalised dualities and maximal finite antichains in the homomorphism order of relational structures J Foniok, J Nešetřil, C Tardif European Journal of Combinatorics 29 (4), 881-899, 2008 | 55 | 2008 |
| Pivoting in linear complementarity: Two polynomial-time cases J Foniok, K Fukuda, B Gärtner, HJ Lüthi Discrete & Computational Geometry 42, 187-205, 2009 | 22 | 2009 |
| Ramsey properties of permutations J Böttcher, J Foniok arXiv preprint arXiv:1103.5686, 2011 | 19 | 2011 |
| Digraph functors which admit both left and right adjoints J Foniok, C Tardif Discrete Mathematics 338 (4), 527-535, 2015 | 15 | 2015 |
| Counting unique-sink orientations J Foniok, B Gärtner, L Klaus, M Sprecher Discrete Applied Mathematics 163, 155-164, 2014 | 14 | 2014 |
| Infinitely many minimal classes of graphs of unbounded clique-width A Collins, J Foniok, N Korpelainen, V Lozin, V Zamaraev Discrete Applied Mathematics 248, 145-152, 2018 | 13 | 2018 |
| Homomorphisms and structural properties of relational systems J Foniok arXiv preprint arXiv:0710.4477, 2007 | 12 | 2007 |
| Combinatorial characterizations of K-matrices J Foniok, K Fukuda, L Klaus Linear algebra and its applications 434 (1), 68-80, 2011 | 10 | 2011 |
| Hedetniemi's conjecture and adjoint functors in thin categories J Foniok, C Tardif arXiv preprint arXiv:1608.02918, 2016 | 9 | 2016 |
| Deciding the Bell number for hereditary graph properties A Atminas, A Collins, J Foniok, VV Lozin SIAM Journal on Discrete Mathematics 30 (2), 1015-1031, 2016 | 9 | 2016 |
| Adjoint functors and tree duality J Foniok, C Tardif Discrete Mathematics & Theoretical Computer Science 11 (Graph and Algorithms), 2009 | 9 | 2009 |
| Generalised dualities and finite maximal antichains J Foniok, J Nešetřil, C Tardif International Workshop on Graph-Theoretic Concepts in Computer Science, 27-36, 2006 | 6 | 2006 |
| Adjoint functors in graph theory J Foniok, C Tardif arXiv preprint arXiv:1304.2215, 2013 | 4 | 2013 |
| Dualities and dual pairs in heyting algebras J Foniok, J Nesetril, A Pultr, C Tardif arXiv preprint arXiv:0908.0428, 2009 | 4 | 2009 |
| On finite maximal antichains in the homomorphism order J Foniok, J Nešetřil, C Tardif Electronic Notes in Discrete Mathematics 29, 389-396, 2007 | 4 | 2007 |
| Generalized dualities and maximal finite antichains in the homomorphism order of relational structures, to appear in European J J Foniok, J Nešetril, C Tardif Comb, 2006 | 4 | 2006 |
| Interleaved adjoints of directed graphs J Foniok, J Nešetřil, C Tardif European Journal of Combinatorics 32 (7), 1018-1024, 2011 | 3 | 2011 |
| Deciding the Bell number for hereditary graph properties A Atminas, A Collins, J Foniok, VV Lozin International Workshop on Graph-Theoretic Concepts in Computer Science, 69-80, 2014 | 2 | 2014 |
| On Ramsey properties of classes with forbidden trees J Foniok Logical Methods in Computer Science 10 (3), 9:1–28, 2014 | 2 | 2014 |
| The hidden K-matrix linear complementarity problem is at least as hard as linear programming over cubes J Foniok, K Fukuda, L Klaus IEICE Technical Report; IEICE Tech. Rep. 113 (371), 45-52, 2013 | 1 | 2013 |
Claude TardifDepartment of Mathematics and Computer Science, Royal Military College of CanadaVerified email at rmc.ca