| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
|
Lopez, Mario A
|
|
1999
|
33 |
1 |
p. 140-165
26 p.
|
artikel
|
| 2 |
A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
|
Yeo, Anders
|
|
1999
|
33 |
1 |
p. 124-139
16 p.
|
artikel
|
| 3 |
Approximation Algorithms for Directed Steiner Problems
|
Charikar, Moses
|
|
1999
|
33 |
1 |
p. 73-91
19 p.
|
artikel
|
| 4 |
Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
|
Fleischer, Lisa
|
|
1999
|
33 |
1 |
p. 51-72
22 p.
|
artikel
|
| 5 |
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
|
Cheriyan, Joseph
|
|
1999
|
33 |
1 |
p. 15-50
36 p.
|
artikel
|
| 6 |
Improving Minimum Cost Spanning Trees by Upgrading Nodes
|
Krumke, S.O
|
|
1999
|
33 |
1 |
p. 92-111
20 p.
|
artikel
|
| 7 |
Linear Time Algorithms for Knapsack Problems with Bounded Weights
|
Pisinger, David
|
|
1999
|
33 |
1 |
p. 1-14
14 p.
|
artikel
|
| 8 |
Minimum Coloring k-Colorable Graphs in Polynomial Average Time
|
Subramanian, C.R.
|
|
1999
|
33 |
1 |
p. 112-123
12 p.
|
artikel
|
| 9 |
On Two Segmentation Problems
|
Alon, Noga
|
|
1999
|
33 |
1 |
p. 173-184
12 p.
|
artikel
|
| 10 |
Papers to Appear in Forthcoming Issues
|
|
|
1999
|
33 |
1 |
p. 185-
1 p.
|
artikel
|
| 11 |
Splitting an Expander Graph
|
Frieze, Alan M
|
|
1999
|
33 |
1 |
p. 166-172
7 p.
|
artikel
|
Tijdschrift beschrijving