Ross M. McConnell

According to our database, Ross M. McConnell authored at least 59 papers between 1983 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2020

Min-Orderable Digraphs.

Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey

SIAM J. Discret. Math., 2020

Bipartite Analogues of Comparability and Cocomparability Graphs.

Pavol Hell, Jing Huang, Jephian C.-H. Lin, Ross M. McConnell

SIAM J. Discret. Math., 2020

2018

Interval-Like Graphs and Digraphs.

Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Double Threshold Digraphs.

Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu

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.

Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim

Inf. Process. Lett., 2017

A note on finding minimum mean cycle.

Mmanu Chaturvedi, Ross M. McConnell

Inf. Process. Lett., 2017

On recognition of threshold tolerance graphs and their complements.

Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter

Discret. Appl. Math., 2017

Double Threshold Digraphs.

Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad

CoRR, 2017

2016

Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs.

Nathan Lindzey, Ross M. McConnell

SIAM J. Discret. Math., 2016

2015

Linear-Time Recognition of Probe Interval Graphs.

Ross M. McConnell, Yahav Nussbaum

SIAM J. Discret. Math., 2015

2014

Recognizing Threshold Tolerance Graphs in O(n²) Time.

Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013

Isomorphism of graph classes related to the circular-ones property.

Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter

Discret. Math. Theor. Comput. Sci., 2013

On Finding Lekkerkerker-Boland Subgraphs

Nathan Lindzey, Ross M. McConnell

CoRR, 2013

On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs.

Nathan Lindzey, Ross M. McConnell

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2011

Position heaps: A simple and dynamic text indexing data structure.

Andrzej Ehrenfeucht, Ross M. McConnell, Nissa Osheim, Sung-Whan Woo

J. Discrete Algorithms, 2011

Foreword.

Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit

Discret. Appl. Math., 2011

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

Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell

Dagstuhl Reports, 2011

Certifying algorithms.

Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer

Comput. Sci. Rev., 2011

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

Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter

Algorithmica, 2011

2010

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

Manachai Toahchoodee, Indrakshi Ray, Ross M. McConnell

Int. J. Next Gener. Comput., 2010

O(mlogn) split decomposition of strongly-connected graphs.

Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell

Discret. Appl. Math., 2010

An implicit representation of chordal comparability graphs in linear time.

Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell

Discret. Appl. Math., 2010

2009

Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure.

Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan Woo

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

<i>O</i>(<i>m</i> log<i>n</i>) Split Decomposition of Strongly Connected Graphs.

Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell

Proceedings of the Graph Theory, 2009

2008

On cliques of Helly Circular-arc Graphs.

Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter

Electron. Notes Discret. Math., 2008

2007

Efficient Algorithms For Optimizing Policy-Constrained Routing.

Andrew R. Curtis, Ross M. McConnell, Daniel Massey

Proceedings of the Fifteenth IEEE International Workshop on Quality of Service, 2007

2006

Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs.

Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad

SIAM J. Comput., 2006

Polynomial time recognition of unit circular-arc graphs.

Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy P. Spinrad, Alan Tucker

J. Algorithms, 2006

An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time.

Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Very Fast Instances for Concept Generation.

Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad

Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

2005

Linear-time modular decomposition of directed graphs.

Ross M. McConnell, Fabien de Montgolfier

Discret. Appl. Math., 2005

Algebraic Operations on PQ Trees and Modular Decomposition Trees.

Ross M. McConnell, Fabien de Montgolfier

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice.

Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad

Proceedings of the Formal Concept Analysis, Third International Conference, 2005

Reliably, Securely and Efficiently Distributing Electronic Content Using Multicasting.

Indrajit Ray, Eunjong Kim, Ross M. McConnell, Daniel Massey

Proceedings of the E-Commerce and Web Technologies: 6th International Conference, 2005

2004

PQ Trees, PC Trees, and Planar Graphs.

Wen-Lian Hsu, Ross M. McConnell

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

String Searching.

Andrzej Ehrenfeucht, Ross M. McConnell

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

A certifying algorithm for the consecutive-ones property.

Ross M. McConnell

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Reducing Damage Assessment Latency in Survivable Databases.

Indrakshi Ray, Ross M. McConnell, Monte Lunacek, Vijay Kumar

Proceedings of the Key Technologies for Data Management, 2004

2003

PC trees and circular-ones arrangements.

Wen-Lian Hsu, Ross M. McConnell

Theor. Comput. Sci., 2003

Linear-Time Recognition of Circular-Arc Graphs.

Ross M. McConnell

Algorithmica, 2003

2002

Partially Complemented Representations of Digraphs.

Elias Dahlhaus, Jens Gustedt, Ross M. McConnell

Discret. Math. Theor. Comput. Sci., 2002

Construction of probe interval models.

Ross M. McConnell, Jeremy P. Spinrad

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Nesting of prime substructures in k-ary relations.

Paola Bonizzoni, Ross M. McConnell

Theor. Comput. Sci., 2001

Efficient and Practical Algorithms for Sequential Modular Decomposition.

Elias Dahlhaus, Jens Gustedt, Ross M. McConnell

J. Algorithms, 2001

2000

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

Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot

Theor. Comput. Sci., 2000

Ordered Vertex Partitioning.

Ross M. McConnell, Jeremy P. Spinrad

Discret. Math. Theor. Comput. Sci., 2000

1999

Modular decomposition and transitive orientation.

Ross M. McConnell, Jeremy P. Spinrad

Discret. Math., 1999

1997

Linear-Time Transitive Orientation.

Ross M. McConnell, Jeremy P. Spinrad

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Efficient and Practical Modular Decomposition.

Elias Dahlhaus, Jens Gustedt, Ross M. McConnell

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Complement-Equivalence Classes on Graphs.

Ross M. McConnell

Proceedings of the Structures in Logic and Computer Science, 1997

1995

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

Ross M. McConnell

Algorithmica, 1995

1994

A k-Structure Generalization of the Theory of 2-Structures.

Andrzej Ehrenfeucht, Ross M. McConnell

Theor. Comput. Sci., 1994

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

Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan

J. Algorithms, 1994

Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs.

Ross M. McConnell, Jeremy P. Spinrad

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.

Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht

J. ACM, 1987

1986

Sequence landscapes.

B. Clift, David Haussler, Ross M. McConnell, Thomas D. Schneider, Gary D. Stormo

Nucleic Acids Res., 1986

1984

Building a Complete Inverted File for a Set of Text Files in Linear Time

Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell

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.

Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell

Proceedings of the Automata, 1984

1983

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

Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell

Bull. EATCS, 1983