Follow
Nathan Lindzey
Nathan Lindzey
Verified email at colorado.edu - Homepage
Title
Cited by
Cited by
Year
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
272018
Erdős–Ko–Rado for perfect matchings
N Lindzey
European Journal of Combinatorics 65, 130-142, 2017
242017
Complexity measures on the symmetric group and beyond
N Dafni, Y Filmus, N Lifshitz, N Lindzey, M Vinyals
arXiv preprint arXiv:2010.07405, 2020
192020
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
112017
Matchings and representation theory
N Lindzey
University of Waterloo, 2018
92018
On finding Tucker submatrices and Lekkerkerker-Boland subgraphs
N Lindzey, RM McConnell
International Workshop on Graph-Theoretic Concepts in Computer Science, 345-357, 2013
92013
Stability for 1-intersecting families of perfect matchings
N Lindzey
European Journal of Combinatorics 86, 103091, 2020
82020
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
82016
A tight lower bound for non-coherent index erasure
N Lindzey, A Rosmanis
arXiv preprint arXiv:1902.07336, 2019
72019
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
62020
Intersecting families of perfect matchings
N Lindzey
arXiv preprint arXiv:1811.06160, 2018
62018
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
62017
Speeding up graph algorithms via switching classes
N Lindzey
International Workshop on Combinatorial Algorithms, 238-249, 2014
32014
Harmonic polynomials on perfect matchings
Y Filmus, N Lindzey
Proceedings of the 34th International Conference on “Formal Power Series andá…, 2022
22022
Jack derangements
N Lindzey
arXiv preprint arXiv:2304.06629, 2023
12023
Simple Algebraic Proofs of Uniqueness for Erd\H {o} s-Ko-Rado Theorems
Y Filmus, N Lindzey
arXiv preprint arXiv:2201.02887, 2022
12022
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, 2020
12020
On the algebraic combinatorics of injections
P Dukes, F Ihringer, N Lindzey
Proceedings of the 32nd International Conference on “Formal Power Series andá…, 2020
12020
A note on “Largest independent sets of certain regular subgraphs of the derangement graph”
Y Filmus, N Lindzey
Journal of Algebraic Combinatorics, 1-5, 2024
2024
Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings
G Chase, N Dafni, Y Filmus, N Lindzey
arXiv e-prints, arXiv: 2210.00245, 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–20