#### Filter Results:

- Full text PDF available (32)

#### Publication Year

1981

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Cell Type

#### Key Phrases

#### Method

#### Organism

Learn More

- Derek G. Corneil, Yehoshua Perl, Lorna Stewart
- SIAM J. Comput.
- 1985

- Jeremy P. Spinrad, Andreas Brandstädt, Lorna Stewart
- Discrete Applied Mathematics
- 1987

This paper examines the class ofbipartite permutation graphs. Two chaiacterizations of graphs i n this class are presented. These characterizations l ead to a linear time recognition algorithm, and to polynomial time algorithms for a number of NP-complete problems when restricted to graphs i n this class. Bipartite graphs and permutation graphs are two well… (More)

An independent set of three vertices such that each pair is joined by a path that avoids the neighborhood of the third is called an asteroidal triple. A graph is asteroidal triple-free (AT-free) if it contains no asteroidal triples. The motivation for this investigation was provided, in part, by the fact that the AT-free graphs provide a common… (More)

- Derek G. Corneil, Stephan Olariu, Lorna Stewart
- SIAM J. Discrete Math.
- 2009

A graph is an interval graph if it is the intersection graph of intervals on a line. Interval graphs are known to be the intersection of chordal graphs and asteroidal triple-free graphs, two families where the well-known Lexicographic Breadth First Search (LBFS) plays an important algorithmic and structural role. In this paper we show that interval graphs… (More)

- Derek G. Corneil, Stephan Olariu, Lorna Stewart
- SODA
- 1998

An independent set of three vertices is called an asteroidal triple if between every two vertices in the triple there exists a path avoiding the neighbourhood of the third. A graph is asteroidal triple-free (AT-free, for short) if it contains no asteroidal triple. A classic result states that a graph is an interval graph if and only if it is chordal and… (More)

- Dieter Kratsch, Lorna Stewart
- SIAM J. Discrete Math.
- 1993

- Derek G. Corneil, Stephan Olariu, Lorna Stewart
- ICALP
- 1995

An independent set of three vertices is called an asteroidal triple if between each pair in the triple there exists a path that avoids the neighborhood of the third. A graph is asteroidal triple-free (AT-free) if it contains no asteroidal triple. The motivation for this investigation is provided, in part, by the fact that AT-free graphs offer a common… (More)

- Ramesh S. Sankaranarayana, Lorna Stewart
- Networks
- 1992

- Frédérique Liégeois, Angela T Morgan, Lorna H Stewart, J Helen Cross, Adam P Vogel, Faraneh Vargha-Khadem
- Brain and language
- 2010

Hemispherectomy (disconnection or removal of an entire cerebral hemisphere) is a rare surgical procedure used for the relief of drug-resistant epilepsy in children. After hemispherectomy, contralateral hemiplegia persists whereas gross expressive and receptive language functions can be remarkably spared. Motor speech deficits have rarely been examined… (More)

- Derek G. Corneil, Stephan Olariu, Lorna Stewart
- SODA '98
- 1998

An independent set of three vertices is called an asteroidal triple if between every two vertices in the triple there exists a path avoiding the neighbourhood of the third. A graph is asteroidal triple-free (AT-free, for short) if it contains no asteroidal triple. A classic result states that a graph is an interval graph if and only if it is chordal and… (More)