|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
12 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Algorithms for maximum independent sets |
Robson, J.M |
1986 |
7 | 3 |
p. 425-440 16 p. |
article |
|
| 2 | An algorithm for constructing m-ary de Bruijn sequences |
Etzion, Tuvi |
1986 |
7 | 3 |
p. 331-340 10 p. |
article |
|
| 3 | An algorithmic proof of a generalization of the birkhoff-von neumann theorem |
Lewandowski, J.L |
1986 |
7 | 3 |
p. 323-330 8 p. |
article |
|
| 4 | An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem |
Megiddo, Nimrod |
1986 |
7 | 3 |
p. 358-368 11 p. |
article |
|
| 5 | Fast computation of the modality of polygons |
Aggarwal, Alok |
1986 |
7 | 3 |
p. 369-381 13 p. |
article |
|
| 6 | Faster construction of optimal binary split trees |
Hester, J.H |
1986 |
7 | 3 |
p. 412-424 13 p. |
article |
|
| 7 | Finding short cycles in planar graphs using separators |
Richards, Dana |
1986 |
7 | 3 |
p. 382-394 13 p. |
article |
|
| 8 | Graph minors. II. Algorithmic aspects of tree-width |
Robertson, Neil |
1986 |
7 | 3 |
p. 309-322 14 p. |
article |
|
| 9 | On deletion in threaded binary trees |
Brinck, Keith |
1986 |
7 | 3 |
p. 395-411 17 p. |
article |
|
| 10 | Optimal expected-time algorithms for merging |
Mai Thanh, |
1986 |
7 | 3 |
p. 341-357 17 p. |
article |
|
| 11 | Papers to appear in forthcoming issues |
1986 |
7 | 3 |
p. 448- 1 p. |
article |
||
| 12 | Point retrieval for polygons |
Paterson, Michael S |
1986 |
7 | 3 |
p. 441-447 7 p. |
article |
12 results found