- O(m log n) Split Decomposition of Strongly Connected Graphs
- Algebraic Operations on PQ Trees and Modular Decomposition Trees Ross M. McConnell , Fabien de Montgolfier
- LexBFS and Partition Refinement, with Applications to Transitive Orientation, Interval
- Linear-time modular decomposition of directed graphs
- Complement-equivalence classes on graphs Ross McConnell 1
- SIAM J. COMPUT. c 2006 Society for Industrial and Applied Mathematics Vol. 36, No. 2, pp. 326353
- Discrete Mathematics and Theoretical Computer Science 4, 2000, 045--060 Ordered Vertex Partitioning +
- Nesting of Prime Substructures in kary Paola Bonizzoni
- A certifying algorithm for the consecutive-ones property Ross M. McConnell
- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
- On cliques of Helly Circular-arc Graphs Min Chih Lin a,1
- String Searching Andrzej Ehrenfeucht
- Position Heaps: A Simple and Dynamic Text Indexing Data Structure
- An Implicit Representation of Chordal Comparabilty Graphs in Linear-time
- O(m log n) Split Decomposition of Strongly Connected Graphs
- An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time
- Certifying Algorithms for RecognizingInterval Graphs and Permutation Graphs Dieter Kratsch * Ross M. McConnell t Kurt Mehlhorn ~ Jeremy P. Spinrad
- Ross M. McConnell* The transitive orientation problem is the problem of
- Discrete Mathematics 201 (1999) 189241 Modular decomposition and transitive orientation
- Theoretical Computer Science 132 (1994) 209-227 A k-structure generalization
- CompleteInverted Files for Efficient Text Retrieval andAnalysis
- Volume 14 Number 1 1986 Nucleic Acids Research Sequence landscapes
- Building a Complete Inverted File for a Set of Text Files in Linear Time
- PQ Trees, PC Trees, and Planar Wen-Lian Hsu
- PC Trees and Circular-Ones Arrangements Wen-Lian Hsu
- Linear-Time Recognition of Probe Interval Ross M. McConnell1
- Graph Algorithms and the Outward Equivalence Elias Dahlhaus Jens Gustedt y Ross M. McConnell z
- Discrete Mathematics and Theoretical Computer Science 4, 2000, 045060 Ordered Vertex Partitioning
- Linear-time recognition of circular-arc graphs Ross M. McConnell
- Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs
- Ecient and Practical Algorithms for Sequential Modular Decomposition
- Discrete Mathematics and Theoretical Computer Science 5, 2002, 147--168 Partially Complemented Representations of
- DOI: 10.1007/s00453-003-1032-7 Algorithmica (2003) 37: 93147
- Efficient and Eiias Dahlhaust
- ARTICLE IN PRESS S0196-6774(04)00146-4/FLA AID:1401 Vol.() [DTD5] P.1 (1-12)
- Algorithmica (2011) 59: 215239 DOI 10.1007/s00453-009-9304-5
