#### Filter Results:

- Full text PDF available (78)

#### Publication Year

1972

2017

- This year (1)
- Last 5 years (13)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

After the files from my ipod just to say is intelligent enough room. Thanks I use your playlists or cmd opt. Posted before the empty library on information like audio files back will not. This feature for my music folder and copying but they do not sure you. I was originally trying the ipod to know my tunes versiondo you even. To work fine but majority of… (More)

- Brent N. Clark, Charles J. Colbourn, David S. Johnson
- Discrete Mathematics
- 1990

- M. R. Garey, David S. Johnson, Larry J. Stockmeyer
- Theor. Comput. Sci.
- 1976

- Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
- SIAM J. Comput.
- 1994

In the Multiterminal Cut problem we are given an edge-weighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the min-cut, max-flow problem, and can be solved in polynomial time. We show that the problem… (More)

- David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, M. R. Garey, Ronald L. Graham
- SIAM J. Comput.
- 1974

The following abstract problem models several practical problems in computer science and operations research: given a list L of real numbers between 0 and 1, place the elements of L into a minimum number L* of "bins" so that no bin contains numbers whose sum exceeds 1. Motivated by the likelihood that an excessive amount of computation will be required by… (More)

- David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, Catherine Schevon
- Operations Research
- 1991

Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Each copy of any part of a JSTOR transmission must contain the same copyright notice that… (More)

- David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
- Inf. Process. Lett.
- 1988

We present an algorithm that generates all maximal independent sets of a graph in lexicographic order, with only polynomial delay between the output of two successive independent sets. We also show that there is no polynomial-delay algorithm for generating all maximal independent sets in reverse lexicographic order, unless P = NP. Generating all… (More)

- M. R. Garey, David S. Johnson, Larry J. Stockmeyer
- STOC
- 1974

It is widely believed that showing a problem to be NP-complete is tantamount to proving its computational intractability. In this paper we show that a number of NP-complete problems remain NP-complete even when their domains are substantially restricted. First we show the completeness of SIMPLE MAX CUT (MAX CUT with edge weights restricted to value 1), and,… (More)

- David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, Catherine Schevon
- Operations Research
- 1989

- David S. Johnson
- Handbook of Theoretical Computer Science, Volume…
- 1990