|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
13 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Algorithms finding tree-decompositions of graphs |
Matoušek, Jiří |
1991 |
12 | 1 |
p. 1-22 22 p. |
article |
|
| 2 | A necessary and sufficient condition for the existence of a complete stable matching |
Tan, Jimmy J.M |
1991 |
12 | 1 |
p. 154-178 25 p. |
article |
|
| 3 | An improved algorithm for the planar 3-cut problem |
He, Xin |
1991 |
12 | 1 |
p. 23-37 15 p. |
article |
|
| 4 | Average case analysis of heap building by repeated insertion |
Hayward, Ryan |
1991 |
12 | 1 |
p. 126-153 28 p. |
article |
|
| 5 | Computing the visibility polygon from a convex set and related problems |
Kumar Ghosh, Subir |
1991 |
12 | 1 |
p. 75-95 21 p. |
article |
|
| 6 | Editorial Board |
1991 |
12 | 1 |
p. i- 1 p. |
article |
||
| 7 | Efficient maintenance of the union of intervals on a line, with applications |
Cheng, Siu Wing |
1991 |
12 | 1 |
p. 57-74 18 p. |
article |
|
| 8 | Finding k points with minimum diameter and related problems |
Aggarwal, Alok |
1991 |
12 | 1 |
p. 38-56 19 p. |
article |
|
| 9 | Papers to appear in forthcoming issues |
1991 |
12 | 1 |
p. 186-187 2 p. |
article |
||
| 10 | Parallel algorithms for parity graphs |
Przytycka, T |
1991 |
12 | 1 |
p. 96-109 14 p. |
article |
|
| 11 | Problems |
van Emde Boas, Peter |
1991 |
12 | 1 |
p. 183-185 3 p. |
article |
|
| 12 | Transitive compaction in parallel via branchings |
Gibbons, Phillip |
1991 |
12 | 1 |
p. 110-125 16 p. |
article |
|
| 13 | Two algorithms for the sieve method |
Wilf, Herbert S |
1991 |
12 | 1 |
p. 179-182 4 p. |
article |
13 results found