Ross M. McConnell

According to our database1, Ross M. McConnell authored at least 55 papers between 1983 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Interval-Like Graphs and Digraphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Double Threshold Digraphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
Simple DFS on the complement of a graph and on partially complemented digraphs.
Inf. Process. Lett., 2017

A note on finding minimum mean cycle.
Inf. Process. Lett., 2017

On recognition of threshold tolerance graphs and their complements.
Discrete Applied Mathematics, 2017

2016
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs.
SIAM J. Discrete Math., 2016

2014
Recognizing Threshold Tolerance Graphs in O(n2) Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013
Isomorphism of graph classes related to the circular-ones property.
Discrete Mathematics & Theoretical Computer Science, 2013

On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2011
Position heaps: A simple and dynamic text indexing data structure.
J. Discrete Algorithms, 2011

Foreword.
Discrete Applied Mathematics, 2011

Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182).
Dagstuhl Reports, 2011

Certifying algorithms.
Computer Science Review, 2011

Linear-Time Recognition of Helly Circular-Arc Models and Graphs.
Algorithmica, 2011

2010
Using Graph Theory to Represent a Spatio-Temporal Role-Based Access Control Model.
IJNGC, 2010

O(mlogn) split decomposition of strongly-connected graphs.
Discrete Applied Mathematics, 2010

An implicit representation of chordal comparability graphs in linear time.
Discrete Applied Mathematics, 2010

2009
Linear-Time Recognition of Probe Interval Graphs.
Proceedings of the Algorithms, 2009

Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

O(m logn) Split Decomposition of Strongly Connected Graphs.
Proceedings of the Graph Theory, 2009

2008
On cliques of Helly Circular-arc Graphs.
Electronic Notes in Discrete Mathematics, 2008

2007
Efficient Algorithms For Optimizing Policy-Constrained Routing.
Proceedings of the Fifteenth IEEE International Workshop on Quality of Service, 2007

2006
Polynomial time recognition of unit circular-arc graphs.
J. Algorithms, 2006

An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Very Fast Instances for Concept Generation.
Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

2005
Linear-time modular decomposition of directed graphs.
Discrete Applied Mathematics, 2005

Algebraic Operations on PQ Trees and Modular Decomposition Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice.
Proceedings of the Formal Concept Analysis, Third International Conference, 2005

Reliably, Securely and Efficiently Distributing Electronic Content Using Multicasting.
Proceedings of the E-Commerce and Web Technologies: 6th International Conference, 2005

2004
PQ Trees, PC Trees, and Planar Graphs.
Proceedings of the Handbook of Data Structures and Applications., 2004

String Searching.
Proceedings of the Handbook of Data Structures and Applications., 2004

A certifying algorithm for the consecutive-ones property.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Reducing Damage Assessment Latency in Survivable Databases.
Proceedings of the Key Technologies for Data Management, 2004

2003
PC trees and circular-ones arrangements.
Theor. Comput. Sci., 2003

Certifying algorithms for recognizing interval graphs and permutation graphs.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Partially Complemented Representations of Digraphs.
Discrete Mathematics & Theoretical Computer Science, 2002

Construction of probe interval models.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Nesting of prime substructures in k-ary relations.
Theor. Comput. Sci., 2001

Efficient and Practical Algorithms for Sequential Modular Decomposition.
J. Algorithms, 2001

Linear-time Recognition of Circular-arc Graphs.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing.
Theor. Comput. Sci., 2000

Ordered Vertex Partitioning.
Discrete Mathematics & Theoretical Computer Science, 2000

1999
Modular decomposition and transitive orientation.
Discrete Mathematics, 1999

1997
Linear-Time Transitive Orientation.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Efficient and Practical Modular Decomposition.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Complement-Equivalence Classes on Graphs.
Proceedings of the Structures in Logic and Computer Science, 1997

1995
An O(n²) Incremental Algorithm for Modular Decomposition of Graphs and 2-Structures.
Algorithmica, 1995

1994
A k-Structure Generalization of the Theory of 2-Structures.
Theor. Comput. Sci., 1994

An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs.
J. Algorithms, 1994

Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1987
Complete inverted files for efficient text retrieval and analysis.
J. ACM, 1987

1986
Sequence landscapes.
Nucleic Acids Research, 1986

1984
Building a Complete Inverted File for a Set of Text Files in Linear Time
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time.
Proceedings of the Automata, 1984

1983
Linear size finite automata for the set of all subwords of a word - an outline of results.
Bulletin of the EATCS, 1983


  Loading...