nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Better Approximation Algorithm for Finding Planar Subgraphs
|
Călinescu, Gruia |
|
1998 |
27 |
2 |
p. 269-302 34 p. |
artikel |
2 |
AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
|
Panigrahy, Rina |
|
1998 |
27 |
2 |
p. 259-268 10 p. |
artikel |
3 |
Author Index for Volume 27
|
|
|
1998 |
27 |
2 |
p. 358- 1 p. |
artikel |
4 |
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing
|
Kenyon, Claire |
|
1998 |
27 |
2 |
p. 218-235 18 p. |
artikel |
5 |
Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic
|
Lupton, Robert |
|
1998 |
27 |
2 |
p. 339-356 18 p. |
artikel |
6 |
Editor's Foreword
|
Tardos, Éva |
|
1998 |
27 |
2 |
p. 169- 1 p. |
artikel |
7 |
How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
|
Propp, James Gary |
|
1998 |
27 |
2 |
p. 170-217 48 p. |
artikel |
8 |
Papers to Appear in Forthcoming Issues
|
|
|
1998 |
27 |
2 |
p. 357- 1 p. |
artikel |
9 |
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
|
Levcopoulos, Christos |
|
1998 |
27 |
2 |
p. 303-338 36 p. |
artikel |
10 |
Routing and Admission Control in General Topology Networks with Poisson Arrivals
|
Kamath, Anil |
|
1998 |
27 |
2 |
p. 236-258 23 p. |
artikel |