Nathan Lindzey

Publication Activity (10 Years)

Years Active: 2013-2022
Publications (10 Years): 15

Top Topics

Subgraph Mining

Equivalence Classes

Complexity Measures

Top Venues

Publications

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