nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Constructive Enumeration of Fullerenes
|
Brinkmann, Gunnar |
|
1997 |
23 |
2 |
p. 345-358 14 p. |
artikel |
2 |
A Linear Time Algorithm for Finding ak-Tree Core
|
Shioura, Akiyoshi |
|
1997 |
23 |
2 |
p. 281-290 10 p. |
artikel |
3 |
An NC Parallel Algorithm for Edge-Coloring Series–Parallel Multigraphs
|
Zhou, Xiao |
|
1997 |
23 |
2 |
p. 359-374 16 p. |
artikel |
4 |
Author Index for Volume 23
|
|
|
1997 |
23 |
2 |
p. 405- 1 p. |
artikel |
5 |
Linearity and Unprovability of Set Union Problem Strategies
|
Loebl, Martin |
|
1997 |
23 |
2 |
p. 207-220 14 p. |
artikel |
6 |
Lower Bounds for Shellsort
|
Plaxton, C.Greg |
|
1997 |
23 |
2 |
p. 221-240 20 p. |
artikel |
7 |
Minimum Range Balanced Cuts via Dynamic Subset Sums
|
Eppstein, David |
|
1997 |
23 |
2 |
p. 375-385 11 p. |
artikel |
8 |
More Efficient Parallel Totally Monotone Matrix Searching
|
Bradford, Phillip G |
|
1997 |
23 |
2 |
p. 386-400 15 p. |
artikel |
9 |
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
|
Higham, Lisa |
|
1997 |
23 |
2 |
p. 291-328 38 p. |
artikel |
10 |
Papers to Appear in Forthcoming Issues
|
|
|
1997 |
23 |
2 |
p. 404- 1 p. |
artikel |
11 |
Parallel and On-Line Graph Coloring
|
Halldórsson, Magnus M |
|
1997 |
23 |
2 |
p. 265-280 16 p. |
artikel |
12 |
Problems
|
Khuller, Samir |
|
1997 |
23 |
2 |
p. 401-403 3 p. |
artikel |
13 |
The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
|
Bartal, Yair |
|
1997 |
23 |
2 |
p. 241-264 24 p. |
artikel |
14 |
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
|
Wang, Biing-Feng |
|
1997 |
23 |
2 |
p. 329-344 16 p. |
artikel |