Nathan Lindzey

According to our database, Nathan Lindzey authored at least 18 papers between 2013 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

On connections between association schemes and analyses of polyhedral and positive semidefinite lift-and-project relaxations.

Yu Hin Au, Nathan Lindzey, Levent Tunçel

Discret. Math., 2026

2022

Simple Algebraic Proofs of Uniqueness for Erdős-Ko-Rado Theorems.

Yuval Filmus, Nathan Lindzey

CoRR, 2022

2021

Complexity Measures on the Symmetric Group and Beyond (Extended Abstract).

Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

On the Algebraic Combinatorics of Injections and its Applications to Injection Codes.

Peter J. Dukes, Ferdinand Ihringer, Nathan Lindzey

IEEE Trans. Inf. Theory, 2020

Stability for 1-intersecting families of perfect matchings.

Nathan Lindzey

Eur. J. Comb., 2020

Complexity Measures on the Symmetric Group and Beyond.

Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals

CoRR, 2020

Matchings, hypergraphs, association schemes, and semidefinite optimization.

Yu Hin Au, Nathan Lindzey, Levent Tunçel

CoRR, 2020

A Tight Lower Bound For Non-Coherent Index Erasure.

Nathan Lindzey, Ansis Rosmanis

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

A Tight Lower Bound for Index Erasure.

Nathan Lindzey, Ansis Rosmanis

CoRR, 2019

2018

A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank.

Radu Curticapean, Nathan Lindzey, Jesper Nederlof

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

Simple DFS on the complement of a graph and on partially complemented digraphs.

Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim

Inf. Process. Lett., 2017

Erdős-Ko-Rado for perfect matchings.

Nathan Lindzey

Eur. J. Comb., 2017

On recognition of threshold tolerance graphs and their complements.

Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2017

2016

Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs.

Nathan Lindzey, Ross M. McConnell

SIAM J. Discret. Math., 2016

2014

Recognizing Threshold Tolerance Graphs in O(n²) Time.

Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

Speeding up Graph Algorithms via Switching Classes.

Nathan Lindzey

Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013

On Finding Lekkerkerker-Boland Subgraphs

Nathan Lindzey, Ross M. McConnell

CoRR, 2013

On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs.

Nathan Lindzey, Ross M. McConnell

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013