Nathan Lindzey

24 papers A* 1A 2B 2C 1Journal 18
YearRankTypeTitle / Venue / Authors
2026 J jnl
An Eventown Result for Permutations.
CoRR
Nathan Lindzey
2026 J jnl
On connections between association schemes and analyses of polyhedral and positive semidefinite lift-and-project relaxations.
Discret. Math.
Yu Hin Au, Nathan Lindzey, Levent Tunçel
2022 J jnl
A tight lower bound for non-coherent index erasure.
Quantum Inf. Comput.
Nathan Lindzey, Ansis Rosmanis
2022 J jnl
Simple Algebraic Proofs of Uniqueness for Erdős-Ko-Rado Theorems.
CoRR
Yuval Filmus, Nathan Lindzey
2021 A conf
Complexity Measures on the Symmetric Group and Beyond (Extended Abstract).
ITCS
Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals
2020 A conf
A Tight Lower Bound For Non-Coherent Index Erasure.
ITCS
Nathan Lindzey, Ansis Rosmanis
2020 J jnl
Complexity Measures on the Symmetric Group and Beyond.
CoRR
Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals
2020 J jnl
Matchings, hypergraphs, association schemes, and semidefinite optimization.
CoRR
Yu Hin Au, Nathan Lindzey, Levent Tunçel
2020 J jnl
On the Algebraic Combinatorics of Injections and its Applications to Injection Codes.
IEEE Trans. Inf. Theory
Peter J. Dukes, Ferdinand Ihringer, Nathan Lindzey
2020 J jnl
Stability for 1-intersecting families of perfect matchings.
Eur. J. Comb.
Nathan Lindzey
2019 J jnl
A Tight Lower Bound for Index Erasure.
CoRR
Nathan Lindzey, Ansis Rosmanis
2018 A* conf
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank.
SODA
Radu Curticapean, Nathan Lindzey, Jesper Nederlof
2017 J jnl
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank.
CoRR
Radu Curticapean, Nathan Lindzey, Jesper Nederlof
2017 J jnl
Erdős-Ko-Rado for perfect matchings.
Eur. J. Comb.
Nathan Lindzey
2017 J jnl
On recognition of threshold tolerance graphs and their complements.
Discret. Appl. Math.
Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2017 J jnl
Simple DFS on the complement of a graph and on partially complemented digraphs.
Inf. Process. Lett.
Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim
2016 J jnl
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs.
SIAM J. Discret. Math.
Nathan Lindzey, Ross M. McConnell
2014 J jnl
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs.
CoRR
Nathan Lindzey, Ross M. McConnell
2014 B conf
Recognizing Threshold Tolerance Graphs in O(n
WG
Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad
2014 J jnl
Speeding Up Graph Algorithms via Switching Classes.
CoRR
Nathan Lindzey
2014 C conf
Speeding up Graph Algorithms via Switching Classes.
IWOCA
Nathan Lindzey
2013 J jnl
On Finding Lekkerkerker-Boland Subgraphs
CoRR
Nathan Lindzey, Ross M. McConnell
2013 B conf
On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs.
WG
Nathan Lindzey, Ross M. McConnell
2013 J jnl
Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs.
CoRR
Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim