nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
AnO(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
|
Bhattacharya, Binay K. |
|
1997 |
25 |
2 |
p. 336-358 23 p. |
artikel |
2 |
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph
|
Łuczak, Tomasz |
|
1997 |
25 |
2 |
p. 311-320 10 p. |
artikel |
3 |
A Randomized Parallel Algorithm for Single-Source Shortest Paths
|
Klein, Philip N |
|
1997 |
25 |
2 |
p. 205-220 16 p. |
artikel |
4 |
A Tight Analysis of the Greedy Algorithm for Set Cover
|
Slavı́k, Petr |
|
1997 |
25 |
2 |
p. 237-254 18 p. |
artikel |
5 |
Author Index for Volume 25
|
|
|
1997 |
25 |
2 |
p. 360- 1 p. |
artikel |
6 |
Computing the Principal Branch of log-Gamma
|
Hare, D.E.G |
|
1997 |
25 |
2 |
p. 221-236 16 p. |
artikel |
7 |
Generating Multiset Permutations in Constant Time
|
Korsh, James |
|
1997 |
25 |
2 |
p. 321-335 15 p. |
artikel |
8 |
Greedy Algorithms for On-Line Data Compression
|
Békési, József |
|
1997 |
25 |
2 |
p. 274-289 16 p. |
artikel |
9 |
Improved Approximation Algorithms for Tree Alignment
|
Wang, Lusheng |
|
1997 |
25 |
2 |
p. 255-273 19 p. |
artikel |
10 |
On Two Dimensional Packing
|
Azar, Yossi |
|
1997 |
25 |
2 |
p. 290-310 21 p. |
artikel |
11 |
Papers to Appear in Forthcoming Issues
|
|
|
1997 |
25 |
2 |
p. 359- 1 p. |
artikel |