Ross M. McConnell

Publication Activity (10 Years)

Years Active: 1983-2020
Publications (10 Years): 11

Top Topics

Equivalence Classes

Breadth First Search

Top Venues

SIAM J. Discret. Math.

Inf. Process. Lett.

Publications

Pavol Hell, Jing Huang, Jephian C.-H. Lin, Ross M. McConnell
Bipartite Analogues of Comparability and Cocomparability Graphs. SIAM J. Discret. Math. 34 (3) (2020)
Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
Min-Orderable Digraphs. SIAM J. Discret. Math. 34 (3) (2020)
Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
Interval-Like Graphs and Digraphs. MFCS (2018)
Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu
Double Threshold Digraphs. MFCS (2018)
Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey
Interval-Like Graphs and Digraphs. CoRR (2018)
Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
On recognition of threshold tolerance graphs and their complements. Discret. Appl. Math. 216 (2017)
Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad
Double Threshold Digraphs. CoRR (2017)
Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim
Simple DFS on the complement of a graph and on partially complemented digraphs. Inf. Process. Lett. 117 (2017)
Mmanu Chaturvedi, Ross M. McConnell
A note on finding minimum mean cycle. Inf. Process. Lett. 127 (2017)
Nathan Lindzey, Ross M. McConnell
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. SIAM J. Discret. Math. 30 (1) (2016)
Ross M. McConnell, Yahav Nussbaum
Linear-Time Recognition of Probe Interval Graphs. SIAM J. Discret. Math. 29 (4) (2015)
Nathan Lindzey, Ross M. McConnell
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. CoRR (2014)
Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad
) Time. WG (2014)
Ross M. McConnell, Yahav Nussbaum
Linear-Time Recognition of Probe Interval Graphs. CoRR (2013)
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
Isomorphism of graph classes related to the circular-ones property. Discret. Math. Theor. Comput. Sci. 15 (1) (2013)
Nathan Lindzey, Ross M. McConnell
On Finding Lekkerkerker-Boland Subgraphs CoRR (2013)
Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim
Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs. CoRR (2013)
Nathan Lindzey, Ross M. McConnell
On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. WG (2013)
Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
Isomorphism of graph classes related to the circular-ones property CoRR (2012)
Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, Ross M. McConnell
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). Dagstuhl Reports 1 (5) (2011)
Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer
Certifying algorithms. Comput. Sci. Rev. 5 (2) (2011)
Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
Linear-Time Recognition of Helly Circular-Arc Models and Graphs. Algorithmica 59 (2) (2011)
Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit
Foreword. Discret. Appl. Math. 159 (7) (2011)
Andrzej Ehrenfeucht, Ross M. McConnell, Nissa Osheim, Sung-Whan Woo
Position heaps: A simple and dynamic text indexing data structure. J. Discrete Algorithms 9 (1) (2011)
Manachai Toahchoodee, Indrakshi Ray, Ross M. McConnell
Using Graph Theory to Represent a Spatio-Temporal Role-Based Access Control Model. Int. J. Next Gener. Comput. 1 (2) (2010)
Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell
O(mlogn) split decomposition of strongly-connected graphs. Discret. Appl. Math. 158 (7) (2010)
Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell
An implicit representation of chordal comparability graphs in linear time. Discret. Appl. Math. 158 (8) (2010)
Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan Woo
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure. CPM (2009)
Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell
) Split Decomposition of Strongly Connected Graphs. Graph Theory, Computational Intelligence and Thought (2009)
Ross M. McConnell, Yahav Nussbaum
Linear-Time Recognition of Probe Interval Graphs. ESA (2009)
Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
On cliques of Helly Circular-arc Graphs. Electron. Notes Discret. Math. 30 (2008)
Andrew R. Curtis, Ross M. McConnell, Daniel Massey
Efficient Algorithms For Optimizing Policy-Constrained Routing. IWQoS (2007)
Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. 36 (2) (2006)
Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy P. Spinrad, Alan Tucker
Polynomial time recognition of unit circular-arc graphs. J. Algorithms 58 (1) (2006)
Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
Very Fast Instances for Concept Generation. ICFCA (2006)
Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell
An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time. WG (2006)
Ross M. McConnell, Fabien de Montgolfier
Algebraic Operations on PQ Trees and Modular Decomposition Trees. WG (2005)
Indrajit Ray, Eunjong Kim, Ross M. McConnell, Daniel Massey
Reliably, Securely and Efficiently Distributing Electronic Content Using Multicasting. EC-Web (2005)
Ross M. McConnell, Fabien de Montgolfier
Linear-time modular decomposition of directed graphs. Discret. Appl. Math. 145 (2) (2005)
Anne Berry, Marianne Huchard, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad
Efficiently Computing a Linear Extension of the Sub-hierarchy of a Concept Lattice. ICFCA (2005)
Indrakshi Ray, Ross M. McConnell, Monte Lunacek, Vijay Kumar
Reducing Damage Assessment Latency in Survivable Databases. BNCOD (2004)
Ross M. McConnell
A certifying algorithm for the consecutive-ones property. SODA (2004)
Wen-Lian Hsu, Ross M. McConnell
PC trees and circular-ones arrangements. Theor. Comput. Sci. 296 (1) (2003)
Ross M. McConnell
Linear-Time Recognition of Circular-Arc Graphs. Algorithmica 37 (2) (2003)
Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad
Certifying algorithms for recognizing interval graphs and permutation graphs. SODA (2003)
Ross M. McConnell, Jeremy P. Spinrad
Construction of probe interval models. SODA (2002)
Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
Partially Complemented Representations of Digraphs. Discret. Math. Theor. Comput. Sci. 5 (1) (2002)
Ross M. McConnell
Linear-time Recognition of Circular-arc Graphs. FOCS (2001)
Paola Bonizzoni, Ross M. McConnell
Nesting of prime substructures in k-ary relations. Theor. Comput. Sci. 259 (1-2) (2001)
Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
Efficient and Practical Algorithms for Sequential Modular Decomposition. J. Algorithms 41 (2) (2001)
Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comput. Sci. 234 (1-2) (2000)
Ross M. McConnell, Jeremy P. Spinrad
Ordered Vertex Partitioning. Discret. Math. Theor. Comput. Sci. 4 (1) (2000)
Ross M. McConnell, Jeremy P. Spinrad
Modular decomposition and transitive orientation. Discret. Math. 201 (1-3) (1999)
Ross M. McConnell
Complement-Equivalence Classes on Graphs. Structures in Logic and Computer Science (1997)
Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
Efficient and Practical Modular Decomposition. SODA (1997)
Ross M. McConnell, Jeremy P. Spinrad
Linear-Time Transitive Orientation. SODA (1997)
Ross M. McConnell
An O(n²) Incremental Algorithm for Modular Decomposition of Graphs and 2-Structures. Algorithmica 14 (3) (1995)
Andrzej Ehrenfeucht, Harold N. Gabow, Ross M. McConnell, Stephen J. Sullivan
An O(n²) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs. J. Algorithms 16 (2) (1994)
Andrzej Ehrenfeucht, Ross M. McConnell
A k-Structure Generalization of the Theory of 2-Structures. Theor. Comput. Sci. 132 (2) (1994)
Ross M. McConnell, Jeremy P. Spinrad
Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. SODA (1994)
Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht
Complete inverted files for efficient text retrieval and analysis. J. ACM 34 (3) (1987)
B. Clift, David Haussler, Ross M. McConnell, Thomas D. Schneider, Gary D. Stormo
Sequence landscapes. Nucleic Acids Res. 14 (1) (1986)
Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
Building a Complete Inverted File for a Set of Text Files in Linear Time STOC (1984)
Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time. ICALP (1984)
Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
Linear size finite automata for the set of all subwords of a word - an outline of results. Bull. EATCS 21 (1983)