Ross M. McConnell

From MaRDI portal
Person:318916

Available identifiers

zbMath Open mcconnell.ross-mMaRDI QIDQ318916

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q50051722021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50051732021-08-04Paper
Min-Orderable Digraphs2020-10-28Paper
Bipartite Analogues of Comparability and Cocomparability Graphs2020-10-27Paper
Complete inverted files for efficient text retrieval and analysis2020-04-05Paper
https://portal.mardi4nfdi.de/entity/Q46438572018-05-29Paper
A note on finding minimum mean cycle2017-08-16Paper
On recognition of threshold tolerance graphs and their complements2016-11-24Paper
Simple DFS on the complement of a graph and on partially complemented digraphs2016-10-06Paper
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs2016-01-15Paper
Linear-Time Recognition of Probe Interval Graphs2015-10-30Paper
Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time2015-09-09Paper
https://portal.mardi4nfdi.de/entity/Q55017782015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55017792015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55013382015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q49823662015-04-09Paper
Certifying algorithms2014-10-24Paper
https://portal.mardi4nfdi.de/entity/Q57473802014-02-14Paper
On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs2013-12-06Paper
Position heaps: a simple and dynamic text indexing data structure2011-05-03Paper
Linear-time recognition of Helly circular-arc models and graphs2011-03-02Paper
An implicit representation of chordal comparability graphs in linear time2010-05-25Paper
\(O(m\log n)\) split decomposition of strongly-connected graphs2010-05-25Paper
O(m logn) Split Decomposition of Strongly Connected Graphs2010-01-07Paper
Linear-Time Recognition of Probe Interval Graphs2009-10-29Paper
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure2009-07-07Paper
An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time2008-09-04Paper
On cliques of Helly Circular-arc Graphs2008-06-05Paper
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs2007-05-03Paper
Formal Concept Analysis2007-02-12Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper
Polynomial time recognition of unit circular-arc graphs2006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q33742452006-03-09Paper
Formal Concept Analysis2005-12-02Paper
Linear-time modular decomposition of directed graphs2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q48290242004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q44712902004-07-28Paper
Linear-time recognition of circular-arc graphs2004-03-11Paper
https://portal.mardi4nfdi.de/entity/Q45333742002-09-26Paper
Efficient and Practical Algorithms for Sequential Modular Decomposition2002-07-08Paper
Nesting of prime substructures in \(k-\)ary relations2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45063822000-09-18Paper
Modular decomposition and transitive orientation2000-04-04Paper
https://portal.mardi4nfdi.de/entity/Q43627331998-03-17Paper
https://portal.mardi4nfdi.de/entity/Q31289161997-08-03Paper
An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures1995-11-27Paper
A \(k\)-structure generalization of the theory of 2-structures1994-09-25Paper
An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs1994-04-21Paper
https://portal.mardi4nfdi.de/entity/Q32176311984-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Ross M. McConnell