| Erdős–Ko–Rado for perfect matchings N Lindzey European Journal of Combinatorics 65, 130-142, 2017 | 23 | 2017 |
| Erdős–Ko–Rado for perfect matchings N Lindzey European Journal of Combinatorics 65, 130-142, 2017 | 23 | 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 | 17 | 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 | 11 | 2017 |
| Complexity measures on the symmetric group and beyond N Dafni, Y Filmus, N Lifshitz, N Lindzey, M Vinyals arXiv preprint arXiv:2010.07405, 2020 | 9 | 2020 |
| On finding Tucker submatrices and Lekkerkerker-Boland subgraphs N Lindzey, RM McConnell Graph-Theoretic Concepts in Computer Science: 39th International Workshop …, 2013 | 9 | 2013 |
| Stability for 1-intersecting families of perfect matchings N Lindzey European Journal of Combinatorics 86, 103091, 2020 | 7 | 2020 |
| Matchings and representation theory N Lindzey University of Waterloo, 2018 | 7 | 2018 |
| A tight lower bound for non-coherent index erasure N Lindzey, A Rosmanis arXiv preprint arXiv:1902.07336, 2019 | 6 | 2019 |
| 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 |
| Intersecting families of perfect matchings N Lindzey arXiv preprint arXiv:1811.06160, 2018 | 4 | 2018 |
| Speeding up graph algorithms via switching classes N Lindzey Combinatorial Algorithms: 25th International Workshop, IWOCA 2014, Duluth …, 2015 | 3 | 2015 |
| Complexity measures on the symmetric group and beyond N Dafni, Y Filmus, N Lifshitz, N Lindzey, M Vinyals Master’s thesis, Technion—Israel Institute of Technology, 2022 | 1 | 2022 |
| Simple Algebraic Proofs of Uniqueness for Erd\H {o} s-Ko-Rado Theorems Y Filmus, N Lindzey arXiv preprint arXiv:2201.02887, 2022 | 1 | 2022 |
| On connections between association schemes and analyses of polyhedral and positive semidefinite lift-and-project relaxations YH Au, N Lindzey, L Tunçel arXiv preprint arXiv:2008.08628, 2022 | 1 | 2022 |
| Harmonic Polynomials on Perfect Matchings Y Filmus, N Lindzey Proceedings of the 34th International Conference on “Formal Power Series and …, 2022 | 1 | 2022 |
| Jack Derangements N Lindzey arXiv preprint arXiv:2304.06629, 2023 | | 2023 |
| Eigenvalues of the Derangement Graphs N Lindzey 2022 Fall Western Sectional Meeting, 2022 | | 2022 |
