#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1983

2018

- This year (3)
- Last 5 years (14)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

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

Given a finite set of texts <italic>S</italic> = {<italic>w</italic>1, â€¦ , <italic>w<subscrpt>k</subscrpt></italic>} over some fixed finite alphabet &Sgr;, a complete inverted file forâ€¦ (More)

- Ross M. McConnell, Jeremy P. Spinrad
- Discrete Mathematics
- 1999

A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canonical linear-spaceâ€¦ (More)

- Ross M. McConnell
- SODA
- 2004

We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set family does not haveâ€¦ (More)

- Ross M. McConnell, Jeremy P. Spinrad
- SODA
- 1994

A module of an undirected graph is a set X of nodes such for each node x not in X, either every member of X is adjacent to x , or no member of X is adjacent to x. There is a canonical linear-spaceâ€¦ (More)

- Wen-Lian Hsu, Ross M. McConnell
- Theor. Comput. Sci.
- 2003

A 0-1 matrix has the consecutive-ones property if its columns can be ordered so that the ones in every row are consecutive. It has the circular-ones property if its columns can be ordered so that, inâ€¦ (More)

- Ross M. McConnell
- Algorithmica
- 2003

A graph G is a circular-arc graph if it is the intersection graph of a set of arcs on a circle. That is, there is one arc for each vertex of G, and two vertices are adjacent in G if and only if theâ€¦ (More)

- Andrzej Ehrenfeucht, Ross M. McConnell, Nissa Osheim, Sung-Whan Woo
- J. Discrete Algorithms
- 2011

We address the problem of finding the locations of all instances of a string P in a text T , where preprocessing of T is allowed in order to facilitate the queries. Previous data structures for thisâ€¦ (More)

- Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
- J. Algorithms
- 2001

- Anselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell
- Bulletin of the EATCS
- 1983

- Michel Habib, Ross M. McConnell, Christophe Paul, Laurent Viennot
- Theor. Comput. Sci.
- 2000

By making use of lexicographic breadth rst search (Lex-BFS) and partition re nement with pivots, we obtain very simple algorithms for some well-known problems in graph theory. We give a O(n + m logâ€¦ (More)