• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 22 matches

• 2022
• 
  Nathan Lindzey, Ansis Rosmanis:
  A tight lower bound for non-coherent index erasure. Quantum Inf. Comput. 22(7&8): 594-626 (2022)
• 
  Yuval Filmus, Nathan Lindzey:
  Simple Algebraic Proofs of Uniqueness for Erdős-Ko-Rado Theorems. CoRR abs/2201.02887 (2022)
• 2021
• 
  Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals:
  Complexity Measures on the Symmetric Group and Beyond (Extended Abstract). ITCS 2021: 87:1-87:5
• 2020
• 
  Nathan Lindzey:
  Stability for 1-intersecting families of perfect matchings. Eur. J. Comb. 86: 103091 (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): 6898-6907 (2020)
• 
  Nathan Lindzey, Ansis Rosmanis:
  A Tight Lower Bound For Non-Coherent Index Erasure. ITCS 2020: 59:1-59:37
• 
  Yu Hin Au, Nathan Lindzey, Levent Tunçel:
  Matchings, hypergraphs, association schemes, and semidefinite optimization. CoRR abs/2008.08628 (2020)
• 
  Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals:
  Complexity Measures on the Symmetric Group and Beyond. CoRR abs/2010.07405 (2020)
• 2019
• 
  Nathan Lindzey, Ansis Rosmanis:
  A Tight Lower Bound for Index Erasure. CoRR abs/1902.07336 (2019)
• 2018
• 
  Radu Curticapean, Nathan Lindzey, Jesper Nederlof:
  A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. SODA 2018: 1080-1099
• 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: 171-180 (2017)
• 
  Nathan Lindzey:
  Erdős-Ko-Rado for perfect matchings. Eur. J. Comb. 65: 130-142 (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: 35-39 (2017)
• 
  Radu Curticapean, Nathan Lindzey, Jesper Nederlof:
  A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank. CoRR abs/1709.02311 (2017)
• 2016
• 
  Nathan Lindzey, Ross M. McConnell:
  Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. SIAM J. Discret. Math. 30(1): 43-69 (2016)
• 2014
• 
  Nathan Lindzey:
  Speeding up Graph Algorithms via Switching Classes. IWOCA 2014: 238-249
• 
  Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad:
  Recognizing Threshold Tolerance Graphs in O(n²) Time. WG 2014: 214-224
• 
  Nathan Lindzey:
  Speeding Up Graph Algorithms via Switching Classes. CoRR abs/1408.4900 (2014)
• 
  Nathan Lindzey, Ross M. McConnell:
  Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. CoRR abs/1401.0224 (2014)
• 2013
• 
  Nathan Lindzey, Ross M. McConnell:
  On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. WG 2013: 345-357
• 
  Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim:
  Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs. CoRR abs/1311.1859 (2013)
• 
  Nathan Lindzey, Ross M. McConnell:
  On Finding Lekkerkerker-Boland Subgraphs. CoRR abs/1303.1840 (2013)