| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations
|
Ibaraki, Toshihide
|
|
1998
|
18 |
1 |
p. 61-83
|
artikel
|
| 2 |
An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth
|
Kohayakawa, Y.
|
|
1998
|
18 |
1 |
p. 101-120
|
artikel
|
| 3 |
Boolean Functions With Low Average Sensitivity Depend On Few Coordinates
|
Friedgut, Ehud
|
|
1998
|
18 |
1 |
p. 27-35
|
artikel
|
| 4 |
Log-Concave Functions And Poset Probabilities
|
Kahn, Jeff
|
|
1998
|
18 |
1 |
p. 85-99
|
artikel
|
| 5 |
Non-Expansive Hashing
|
Linial, Nathan
|
|
1998
|
18 |
1 |
p. 121-132
|
artikel
|
| 6 |
On Linear Combinatorics II. Structure Theorems via Additive Number Theory
|
Elekes, György
|
|
1998
|
18 |
1 |
p. 13-25
|
artikel
|
| 7 |
On Small Blocking Sets
|
Polito, Pompeo
|
|
1998
|
18 |
1 |
p. 133-137
|
artikel
|
| 8 |
On the Simplest Inverse Problem for Sums of Sets in Several Dimensions
|
Stanchescu, Yonutz
|
|
1998
|
18 |
1 |
p. 139-149
|
artikel
|
| 9 |
Partitioning Graphs of Bounded Tree-Width
|
Ding, Guoli
|
|
1998
|
18 |
1 |
p. 1-12
|
artikel
|
| 10 |
Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs
|
Goemans, Michel X.
|
|
1998
|
18 |
1 |
p. 37-59
|
artikel
|
Tijdschrift beschrijving