default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoss M. McConnell
Person information
- affiliation: Colorado State University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j33]Pavol Hell, Jing Huang
, Ross M. McConnell, Arash Rafiey:
Min-Orderable Digraphs. SIAM J. Discret. Math. 34(3): 1710-1724 (2020)- [j32]Pavol Hell, Jing Huang, Jephian C.-H. Lin, Ross M. McConnell:
Bipartite Analogues of Comparability and Cocomparability Graphs. SIAM J. Discret. Math. 34(3): 1969-1983 (2020)
2010 – 2019
- 2018
- [c24]Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey:
Interval-Like Graphs and Digraphs. MFCS 2018: 68:1-68:13 - [c23]Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad, Zhisheng Xu:
Double Threshold Digraphs. MFCS 2018: 69:1-69:12 - [i8]Pavol Hell, Jing Huang, Ross M. McConnell, Arash Rafiey:
Interval-Like Graphs and Digraphs. CoRR abs/1804.05258 (2018) - 2017
- [j31]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: 171-180 (2017) - [j30]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: 35-39 (2017) - [j29]Mmanu Chaturvedi, Ross M. McConnell:
A note on finding minimum mean cycle. Inf. Process. Lett. 127: 21-22 (2017) - [i7]Peter Hamburger, Ross M. McConnell, Attila Pór, Jeremy P. Spinrad:
Double Threshold Digraphs. CoRR abs/1702.06614 (2017) - 2016
- [j28]Nathan Lindzey, Ross M. McConnell:
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. SIAM J. Discret. Math. 30(1): 43-69 (2016) - 2015
- [j27]Ross M. McConnell, Yahav Nussbaum:
Linear-Time Recognition of Probe Interval Graphs. SIAM J. Discret. Math. 29(4): 2006-2046 (2015) - 2014
- [c22]Petr A. Golovach, Pinar Heggernes, Nathan Lindzey, Ross M. McConnell, Vinícius Fernandes dos Santos, Jeremy P. Spinrad:
Recognizing Threshold Tolerance Graphs in O(n2) Time. WG 2014: 214-224 - [i6]Nathan Lindzey, Ross M. McConnell:
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. CoRR abs/1401.0224 (2014) - 2013
- [j26]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): 157-182 (2013) - [c21]Nathan Lindzey, Ross M. McConnell:
On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs. WG 2013: 345-357 - [i5]Nathan Lindzey, Ross M. McConnell:
On Finding Lekkerkerker-Boland Subgraphs. CoRR abs/1303.1840 (2013) - [i4]Ross M. McConnell, Yahav Nussbaum:
Linear-Time Recognition of Probe Interval Graphs. CoRR abs/1307.5547 (2013) - [i3]Benson L. Joeris, Nathan Lindzey, Ross M. McConnell, Nissa Osheim:
Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs. CoRR abs/1311.1859 (2013) - 2012
- [i2]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 abs/1203.4822 (2012) - 2011
- [j25]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): 215-239 (2011) - [j24]Ross M. McConnell, Kurt Mehlhorn, Stefan Näher, Pascal Schweitzer:
Certifying algorithms. Comput. Sci. Rev. 5(2): 119-161 (2011) - [j23]Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit:
Foreword. Discret. Appl. Math. 159(7): 497 (2011) - [j22]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): 100-121 (2011) - [i1]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): 29-46 (2011) - 2010
- [j21]Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell:
O(mlogn) split decomposition of strongly-connected graphs. Discret. Appl. Math. 158(7): 779-799 (2010) - [j20]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): 869-875 (2010) - [j19]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)
2000 – 2009
- 2009
- [c20]Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell:
O(m logn) Split Decomposition of Strongly Connected Graphs. Graph Theory, Computational Intelligence and Thought 2009: 158-171 - [c19]Andrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan Woo:
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure. CPM 2009: 41-53 - [c18]Ross M. McConnell, Yahav Nussbaum:
Linear-Time Recognition of Probe Interval Graphs. ESA 2009: 349-360 - [e1]Marina Lipshteyn, Vadim E. Levit, Ross M. McConnell:
Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 5420, Springer 2009, ISBN 978-3-642-02028-5 [contents] - 2008
- [j18]Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
On cliques of Helly Circular-arc Graphs. Electron. Notes Discret. Math. 30: 117-122 (2008) - 2007
- [c17]Andrew R. Curtis, Ross M. McConnell, Daniel Massey:
Efficient Algorithms For Optimizing Policy-Constrained Routing. IWQoS 2007: 113-116 - 2006
- [j17]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): 67-78 (2006) - [j16]Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad:
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs. SIAM J. Comput. 36(2): 326-353 (2006) - [c16]Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy P. Spinrad:
Very Fast Instances for Concept Generation. ICFCA 2006: 119-129 - [c15]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: 168-178 - 2005
- [j15]Ross M. McConnell, Fabien de Montgolfier:
Linear-time modular decomposition of directed graphs. Discret. Appl. Math. 145(2): 198-209 (2005) - [c14]Indrajit Ray, Eunjong Kim, Ross M. McConnell, Daniel Massey:
Reliably, Securely and Efficiently Distributing Electronic Content Using Multicasting. EC-Web 2005: 327-336 - [c13]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: 208-222 - [c12]Ross M. McConnell, Fabien de Montgolfier:
Algebraic Operations on PQ Trees and Modular Decomposition Trees. WG 2005: 421-432 - 2004
- [c11]Indrakshi Ray, Ross M. McConnell, Monte Lunacek, Vijay Kumar:
Reducing Damage Assessment Latency in Survivable Databases. BNCOD 2004: 106-111 - [c10]Ross M. McConnell:
A certifying algorithm for the consecutive-ones property. SODA 2004: 768-777 - [r2]Andrzej Ehrenfeucht, Ross M. McConnell:
String Searching. Handbook of Data Structures and Applications 2004 - [r1]Wen-Lian Hsu, Ross M. McConnell:
PQ Trees, PC Trees, and Planar Graphs. Handbook of Data Structures and Applications 2004 - 2003
- [j14]Ross M. McConnell:
Linear-Time Recognition of Circular-Arc Graphs. Algorithmica 37(2): 93-147 (2003) - [j13]Wen-Lian Hsu, Ross M. McConnell:
PC trees and circular-ones arrangements. Theor. Comput. Sci. 296(1): 99-116 (2003) - [c9]Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, Jeremy P. Spinrad:
Certifying algorithms for recognizing interval graphs and permutation graphs. SODA 2003: 158-167 - 2002
- [j12]Elias Dahlhaus, Jens Gustedt, Ross M. McConnell:
Partially Complemented Representations of Digraphs. Discret. Math. Theor. Comput. Sci. 5(1): 147-168 (2002) - [c8]Ross M. McConnell, Jeremy P. Spinrad:
Construction of probe interval models. SODA 2002: 866-875 - 2001
- [j11]Elias Dahlhaus, Jens Gustedt, Ross M. McConnell:
Efficient and Practical Algorithms for Sequential Modular Decomposition. J. Algorithms 41(2): 360-387 (2001) - [j10]Paola Bonizzoni, Ross M. McConnell:
Nesting of prime substructures in k-ary relations. Theor. Comput. Sci. 259(1-2): 341-357 (2001) - [c7]Ross M. McConnell:
Linear-time Recognition of Circular-arc Graphs. FOCS 2001: 386-394 - 2000
- [j9]Ross M. McConnell, Jeremy P. Spinrad:
Ordered Vertex Partitioning. Discret. Math. Theor. Comput. Sci. 4(1): 45-60 (2000) - [j8]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): 59-84 (2000)
1990 – 1999
- 1999
- [j7]Ross M. McConnell, Jeremy P. Spinrad:
Modular decomposition and transitive orientation. Discret. Math. 201(1-3): 189-241 (1999) - 1997
- [c6]Ross M. McConnell:
Complement-Equivalence Classes on Graphs. Structures in Logic and Computer Science 1997: 174-191 - [c5]Ross M. McConnell, Jeremy P. Spinrad:
Linear-Time Transitive Orientation. SODA 1997: 19-25 - [c4]Elias Dahlhaus, Jens Gustedt, Ross M. McConnell:
Efficient and Practical Modular Decomposition. SODA 1997: 26-35 - 1995
- [j6]Ross M. McConnell:
An O(n²) Incremental Algorithm for Modular Decomposition of Graphs and 2-Structures. Algorithmica 14(3): 229-248 (1995) - 1994
- [j5]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): 283-294 (1994) - [j4]Andrzej Ehrenfeucht, Ross M. McConnell:
A k-Structure Generalization of the Theory of 2-Structures. Theor. Comput. Sci. 132(2): 209-227 (1994) - [c3]Ross M. McConnell, Jeremy P. Spinrad:
Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs. SODA 1994: 536-545
1980 – 1989
- 1987
- [j3]Anselm Blumer, J. Blumer, David Haussler, Ross M. McConnell, Andrzej Ehrenfeucht:
Complete inverted files for efficient text retrieval and analysis. J. ACM 34(3): 578-595 (1987) - 1986
- [j2]B. Clift, David Haussler, Ross M. McConnell, Thomas D. Schneider, Gary D. Stormo:
Sequence landscapes. Nucleic Acids Res. 14(1): 141-158 (1986) - 1984
- [c2]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: 109-118 - [c1]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: 349-358 - 1983
- [j1]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: 12-20 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
