( en | de | ru )

 

Disambiguation of "Lindzey, Nathan"

Author of the publication

copydeleteadd this publication to your clipboard
Recognizing Threshold Tolerance Graphs in O(n2) Time.

, , , , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 214-224. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nathan ben-Nathan

Nathan Rosenbaum

Hans Nathan

Siegfried Nathan

Nathan Schnurr

 

Other publications of authors with the same name

Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs., and . CoRR, (2014)Simple DFS on the complement of a graph and on partially complemented digraphs., , , and . Inf. Process. Lett., (2017)Complexity Measures on the Symmetric Group and Beyond., , , , and . CoRR, (2020)On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs., and . WG, volume 8165 of Lecture Notes in Computer Science, page 345-357. Springer, (2013)A Tight Lower Bound For Non-Coherent Index Erasure., and . ITCS, volume 151 of LIPIcs, page 59:1-59:37. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On recognition of threshold tolerance graphs and their complements., , , , , , and . Discret. Appl. Math., (2017)Complexity Measures on the Symmetric Group and Beyond (Extended Abstract)., , , , and . ITCS, volume 185 of LIPIcs, page 87:1-87:5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Recognizing Threshold Tolerance Graphs in O(n2) Time., , , , , and . WG, volume 8747 of Lecture Notes in Computer Science, page 214-224. Springer, (2014)Speeding up Graph Algorithms via Switching Classes.. IWOCA, volume 8986 of Lecture Notes in Computer Science, page 238-249. Springer, (2014)On Finding Lekkerkerker-Boland Subgraphs, and . CoRR, (2013)