Erdős–Ko–Rado for perfect matchings N Lindzey
European Journal of Combinatorics 65, 130-142, 2017
15 2017 Erdős–Ko–Rado for perfect matchings N Lindzey
European Journal of Combinatorics 65, 130-142, 2017
15 2017 A tight lower bound for counting Hamiltonian cycles via matrix rank R Curticapea, N Lindzey, J Nederlof
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
10 2018 On recognition of threshold tolerance graphs and their complements PA Golovach, P Heggernes, N Lindzey, RM McConnell, VF dos Santos, ...
Discrete Applied Mathematics 216, 171-180, 2017
10 2017 On finding Tucker submatrices and Lekkerkerker-Boland subgraphs N Lindzey, RM McConnell
International Workshop on Graph-Theoretic Concepts in Computer Science, 345-357, 2013
10 2013 Complexity measures on the symmetric group and beyond N Dafni, Y Filmus, N Lifshitz, N Lindzey, M Vinyals
arXiv preprint arXiv:2010.07405, 2020
8 2020 A tight lower bound for non-coherent index erasure N Lindzey, A Rosmanis
arXiv preprint arXiv:1902.07336, 2019
6 2019 Stability for 1-intersecting families of perfect matchings N Lindzey
European Journal of Combinatorics 86, 103091, 2020
5 2020 Simple DFS on the complement of a graph and on partially complemented digraphs B Joeris, N Lindzey, RM McConnell, N Osheim
Information Processing Letters 117, 35-39, 2017
5 2017 Linear-time algorithms for finding Tucker submatrices and Lekkerkerker--Boland subgraphs N Lindzey, RM McConnell
SIAM Journal on Discrete Mathematics 30 (1), 43-69, 2016
5 2016 On the algebraic combinatorics of injections and its applications to injection codes PJ Dukes, F Ihringer, N Lindzey
IEEE Transactions on Information Theory 66 (11), 6898-6907, 2020
4 2020 Matchings and representation theory N Lindzey
University of Waterloo, 2018
3 2018 Intersecting families of perfect matchings N Lindzey
arXiv preprint arXiv:1811.06160, 2018
3 2018 Speeding up graph algorithms via switching classes N Lindzey
International Workshop on Combinatorial Algorithms, 238-249, 2014
3 2014 Simple Algebraic Proofs of Uniqueness for Erd\H {o} s-Ko-Rado Theorems Y Filmus, N Lindzey
arXiv preprint arXiv:2201.02887, 2022
2022 Matchings, hypergraphs, association schemes, and semidefinite optimization YH Au, N Lindzey, L Tunçel
arXiv preprint arXiv:2008.08628, 2020
2020 Matchings, hypergraphs, association schemes, and semidefinite optimization Y Hin Au, N Lindzey, L Tunçel
arXiv e-prints, arXiv: 2008.08628, 2020
2020 Complexity measures on symmetric group and beyond Y Filmus, N Lifshitz, N Lindzey, M Vinyals
2020 A Tight Lower Bound for Index Erasure N Lindzey, A Rosmanis
arXiv 2019, 2019
2019 Recognizing Threshold Tolerance Graphs in PA Golovach, P Heggernes, N Lindzey, RM McConnell, VF Santos, ...
International Workshop on Graph-Theoretic Concepts in Computer Science, 214-224, 2014
2014 