Nathan Lindzey
Nathan Lindzey
Afiliação desconhecida
E-mail confirmado em uwaterloo.ca
Título
Citado por
Citado por
Ano
On finding Tucker submatrices and Lekkerkerker-Boland subgraphs
N Lindzey, RM McConnell
International Workshop on Graph-Theoretic Concepts in Computer Science, 345-357, 2013
112013
Erdős–Ko–Rado for perfect matchings
N Lindzey
European Journal of Combinatorics 65, 130-142, 2017
82017
Erdős–Ko–Rado for perfect matchings
N Lindzey
European Journal of Combinatorics 65, 130-142, 2017
82017
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
62018
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
52017
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
52017
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
52016
Speeding up graph algorithms via switching classes
N Lindzey
International Workshop on Combinatorial Algorithms, 238-249, 2014
32014
Stability for 1-intersecting families of perfect matchings
N Lindzey
European Journal of Combinatorics 86, 103091, 2020
22020
A Tight Lower Bound For Non-Coherent Index Erasure
N Lindzey, A Rosmanis
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
22020
A Tight Lower Bound for Index Erasure
N Lindzey, A Rosmanis
arXiv preprint arXiv:1902.07336, 2019
22019
Matchings and representation theory
N Lindzey
University of Waterloo, 2018
12018
Intersecting families of perfect matchings
N Lindzey
arXiv preprint arXiv:1811.06160, 2018
12018
On the Algebraic Combinatorics of Injections and its Applications to Injection Codes
PJ Dukes, F Ihringer, N Lindzey
IEEE Transactions on Information Theory, 2020
2020
Complexity measures on symmetric group and beyond
Y Filmus, N Lifshitz, N Lindzey, M Vinyals
2020
Recognizing Threshold Tolerance Graphs in Time
PA Golovach, P Heggernes, N Lindzey, RM McConnell, VF dos Santos, ...
International Workshop on Graph-Theoretic Concepts in Computer Science, 214-224, 2014
2014
Towards a general theory of Erdős-Ko-Rado combinatorics
N Lindzey
Colorado State University. Libraries, 2014
2014
Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs
B Joeris, N Lindzey, RM McConnell, N Osheim
arXiv preprint arXiv:1311.1859, 2013
2013
On Finding Lekkerkerker-Boland Subgraphs
N Lindzey, R McConnell
arXiv preprint arXiv:1303.1840, 2013
2013
Faster graph algorithms via switching classes
N Lindzey
2000-2019-CSU Theses and Dissertations, 2012
2012
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20