nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A simple a.s. correct algorithm for deciding if a graph has a perfect matching
|
Brito, María Rosa |
|
1995 |
63 |
2 |
p. 181-185 5 p. |
artikel |
2 |
Close-to-optimal and near-optimal broadcasting in random graphs
|
Gerbessiotis, Alexandros V. |
|
1995 |
63 |
2 |
p. 129-150 22 p. |
artikel |
3 |
Directed Moore hypergraphs
|
Ergincan, Fahir Ö. |
|
1995 |
63 |
2 |
p. 117-127 11 p. |
artikel |
4 |
Erratum
|
|
|
1995 |
63 |
2 |
p. 199-200 2 p. |
artikel |
5 |
Every matroid is a submatroid of a uniformly dense matroid
|
Lai, Hong-Jian |
|
1995 |
63 |
2 |
p. 151-160 10 p. |
artikel |
6 |
Matroid optimization with generalized constraints
|
Srinivas, Mandayam A. |
|
1995 |
63 |
2 |
p. 161-174 14 p. |
artikel |
7 |
On powers of m-trapezoid graphs
|
Flotow, Carsten |
|
1995 |
63 |
2 |
p. 187-192 6 p. |
artikel |
8 |
Scheduling dyadic intervals
|
Driscoll, James R. |
|
1995 |
63 |
2 |
p. 101-116 16 p. |
artikel |
9 |
Strongly prime PCP words
|
Lipponen, Marjo |
|
1995 |
63 |
2 |
p. 193-197 5 p. |
artikel |
10 |
The modified differencing method for the set partitioning problem with cardinality constraints
|
Tasi, Li-Hui |
|
1995 |
63 |
2 |
p. 175-180 6 p. |
artikel |