( en | de | ru )

 

Disambiguation of "McConnell, Ross M."

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.

Aaron McConnell

Sean R McConnell

Katharina Ross

The mitochondrial protein import machinery: role in infection, apoptosis, and organelle integrity. HU Berlin, (2009)

Werner Ross

Johannes Ross

 

Other publications of authors with the same name

Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs., , , and . SIAM J. Comput., 36 (2): 326-353 (2006)Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs., and . SODA, page 536-545. ACM/SIAM, (1994)Reducing Damage Assessment Latency in Survivable Databases., , , and . BNCOD, volume 3112 of Lecture Notes in Computer Science, page 106-111. Springer, (2004)Algebraic Operations on PQ Trees and Modular Decomposition Trees., and . WG, volume 3787 of Lecture Notes in Computer Science, page 421-432. Springer, (2005)Interval-Like Graphs and Digraphs., , , and . MFCS, volume 117 of LIPIcs, page 68:1-68:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On cliques of Helly Circular-arc Graphs., , , and . Electron. Notes Discret. Math., (2008)An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs., , , and . J. Algorithms, 16 (2): 283-294 (1994)PC trees and circular-ones arrangements., and . Theor. Comput. Sci., 296 (1): 99-116 (2003)Complete inverted files for efficient text retrieval and analysis., , , , and . J. ACM, 34 (3): 578-595 (1987)Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time., , , , and . ICALP, volume 172 of Lecture Notes in Computer Science, page 109-118. Springer, (1984)