nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A linear algorithm for nonhomogeneous spectra of numbers
|
Boshernitzan, M |
|
1984 |
5 |
2 |
p. 187-198 12 p. |
artikel |
2 |
An efficient algorithm for generating all k-subsets (1 ⩽ k ⩽ m ⩽ n) of the set [1, 2,…, n] in lexicographical order
|
Semba, Ichiro |
|
1984 |
5 |
2 |
p. 281-283 3 p. |
artikel |
3 |
Characterizations of totally balanced matrices
|
Anstee, R.P |
|
1984 |
5 |
2 |
p. 215-230 16 p. |
artikel |
4 |
Finding the number of factors of a polynomial
|
Weinberger, P.J |
|
1984 |
5 |
2 |
p. 180-186 7 p. |
artikel |
5 |
Generating random regular graphs
|
Wormald, Nicholas C |
|
1984 |
5 |
2 |
p. 247-280 34 p. |
artikel |
6 |
Heuristic matching for graphs satisfying the triangle inequality
|
Plaisted, David A |
|
1984 |
5 |
2 |
p. 163-179 17 p. |
artikel |
7 |
On two geometric problems related to the travelling salesman problem
|
Papadimitriou, Christos H |
|
1984 |
5 |
2 |
p. 231-246 16 p. |
artikel |
8 |
Optimal algorithms to compute the closure of a set of iso-rectangles
|
Soisalon-Soininen, Eljas |
|
1984 |
5 |
2 |
p. 199-214 16 p. |
artikel |
9 |
Papers to appear in forthcoming issues
|
|
|
1984 |
5 |
2 |
p. 300-301 2 p. |
artikel |
10 |
The NP-completeness column: An ongoing guide
|
Johnson, David S |
|
1984 |
5 |
2 |
p. 284-299 16 p. |
artikel |