nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Analysis of hashing with chaining in the prime area
|
Larson, Per-Åke |
|
1984 |
5 |
1 |
p. 36-47 12 p. |
artikel |
2 |
An O(N 2) algorithm for coloring perfect planar graphs
|
Tucker, Alan |
|
1984 |
5 |
1 |
p. 60-68 9 p. |
artikel |
3 |
A personnel assignment problem
|
Ramanan, P |
|
1984 |
5 |
1 |
p. 132-144 13 p. |
artikel |
4 |
Bounds for naive multiple machine scheduling with release times and deadlines
|
Gusfield, Dan |
|
1984 |
5 |
1 |
p. 1-6 6 p. |
artikel |
5 |
Direct-chaining with coalescing lists
|
Knott, Gary D |
|
1984 |
5 |
1 |
p. 7-21 15 p. |
artikel |
6 |
Editorial Board
|
|
|
1984 |
5 |
1 |
p. i- 1 p. |
artikel |
7 |
Efficient algorithms for a family of matroid intersection problems
|
Gabow, Harold N |
|
1984 |
5 |
1 |
p. 80-131 52 p. |
artikel |
8 |
Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
|
Leung, Joseph Y.-T |
|
1984 |
5 |
1 |
p. 22-35 14 p. |
artikel |
9 |
Optimal binary split trees
|
Huang, Shou-Hsuan Stephen |
|
1984 |
5 |
1 |
p. 69-79 11 p. |
artikel |
10 |
Papers to appear in forthcoming issues
|
|
|
1984 |
5 |
1 |
p. 161-162 2 p. |
artikel |
11 |
Problems
|
Guibas, Leo J |
|
1984 |
5 |
1 |
p. 145-146 2 p. |
artikel |
12 |
Scheduling precedence graphs of bounded height
|
Dolev, Danny |
|
1984 |
5 |
1 |
p. 48-59 12 p. |
artikel |
13 |
The NP-completeness column: An ongoing guide
|
Johnson, David S |
|
1984 |
5 |
1 |
p. 147-160 14 p. |
artikel |