#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1983

2018

- This year (2)
- Last 5 years (5)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn 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)

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

Bipartite graphs and permutation graphs are two well known subfamilies of the perfect graphs. Neither of these families is contained in the other, and their intersection is nonempty. This paper shows… (More)

- Ton Kloks, Dieter Kratsch, Jeremy P. Spinrad
- Theor. Comput. Sci.
- 1997

We present O(n’R + n3R3) time algorithms to compute the treewidth, pathwidth, minimum fill-in and minimum interval graph completion of asteroidal triple-free graphs, where n is the number of vertices… (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)

- Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki, Xin He, Vijay Raghavan, Jeremy P. Spinrad
- Theor. Comput. Sci.
- 2003

We consider here scalar aggregation queries in databases that may violate a given set of functional dependencies. We de3ne consistent answers to such queries to be greatest-lowest/leastupper bounds… (More)

- Vijay Raghavan, Jeremy P. Spinrad
- SODA
- 2001

We introduce a new definition of efficient algorithms for restricted domains. Under this definition, an algorithm is required to be “robust,” i.e., it must produce correct output regardless of… (More)

- Tze-Heng Ma, Jeremy P. Spinrad
- J. Algorithms
- 1994

- Elaine M. Eschen, Jeremy P. Spinrad
- SODA
- 1993

In this paper we demonstrate a close relationship between circular-arc graphs and chordal bipartite graphs. We exploit this relationship to achieve an O(n2) time circular-arc graph recognition… (More)

- Jeremy P. Spinrad
- Inf. Process. Lett.
- 1993

Spinrad. J.P., Doubly lexical ordering of dense O-l matrices. Information Processing Letters 45 (1993) 229-235. We present an algorithm for the doubly lexical ordering problem on a O-1 i by j matrix… (More)

- Dieter Kratsch, Jeremy P. Spinrad
- SODA '03
- 2003

This paper uses periodic matrix multiplication to improve the time complexities for a number of graph problems. The time for finding a clique cutset in a graph is reduced from O(<i>nm</i>) to… (More)